arXiv subjects

Jifei Miao

Publications and source records attributed to Jifei Miao.

At least 19 recordsLinked to original sources

arXiv2026

Tensor Orthogonal Subspace Split: Theory and Applications

Tensor representations have emerged as a fundamental paradigm for modeling multidimensional data by preserving intrinsic correlations across multiple modes. This paper proposes a novel theoretical framework, termed Tensor Orthogonal Subspace Split (TOSS), which explicitly splits a tensor, along a prescribed mode, into two orthogonal components: a dominant component lying in a prescribed subspace and a residual component lying in the corresponding orthogonal complement. We first present the general formulation of TOSS and systematically investigate its fundamental properties. As an important and practically meaningful special case, we further introduce the rank-one TOSS, which imposes a separable rank-one structure along the splitting mode and admits a clear geometric interpretation. This formulation naturally captures dominant consistent patterns while effectively isolating orthogonal residual component. The proposed framework establishes a unified theoretical foundation for tensor-domain orthogonal split and opens new avenues for structured tensor modeling across diverse applications. Building upon the developed TOSS theory, hyperspectral image restoration and color video background modeling are considered as two representative tasks, for which corresponding optimization models are formulated. Efficient algorithms are developed to solve the resulting problems. Extensive experimental results validate the effectiveness and superiority of the proposed approaches.

math.NA↗

arXiv2026

Quaternion Tensor Modeling for Joint Color-Polarization Demosaicking

Division-of-focal-plane (DoFP) color polarization cameras enable snapshot acquisition of color polarization mosaic images, but the inherently sparse sampling pattern makes color polarization demosaicking severely ill-posed. Existing methods often fail to jointly exploit the correlations among polarization channels and the physical constraints inherent in polarization imaging, resulting in noticeable demosaicking artifacts. To address this issue, a quaternion-tensor-based color polarization demosaicking (CPDM) method incorporating Stokes-domain total variation (TV) regularization is proposed. Correlation analysis shows that the correlations among polarization channels are stronger than those among color channels. Accordingly, the color polarization images acquired at $0^\circ$, $45^\circ$, $90^\circ$, and $135^\circ$ are encoded into the four components of a third-order quaternion tensor, with the color channels organized along its third mode. A low-rank prior is then imposed on the quaternion tensor to exploit the global structural redundancy in the color polarization data. Moreover, spatial gradients are mapped to the Stokes domain through an orthogonal transformation to separate intensity, polarization and residual variations, with adaptive quaternion weights enabling component-specific regularization and preserving the energy consistency of the reconstructed Stokes vectors. An efficient optimization algorithm is derived for the resulting model. Extensive experiments demonstrate the superior demosaicking performance of the proposed method.

cs.CV↗

arXiv2025

Matrix Completion Via Reweighted Logarithmic Norm Minimization

Low-rank matrix completion (LRMC) has demonstrated remarkable success in a wide range of applications. To address the NP-hard nature of the rank minimization problem, the nuclear norm is commonly used as a convex and computationally tractable surrogate for the rank function. However, this approach often yields suboptimal solutions due to the excessive shrinkage of singular values. In this letter, we propose a novel reweighted logarithmic norm as a more effective nonconvex surrogate, which provides a closer approximation than many existing alternatives. We efficiently solve the resulting optimization problem by employing the alternating direction method of multipliers (ADMM). Experimental results on image inpainting demonstrate that the proposed method achieves superior performance compared to state-of-the-art LRMC approaches, both in terms of visual quality and quantitative metrics.

cs.CV↗

arXiv2025

Non-Negative Reduced Biquaternion Matrix Factorization with Applications in Color Face Recognition

Reduced biquaternion (RB), as a four-dimensional algebra highly suitable for representing color pixels, has recently garnered significant attention from numerous scholars. In this paper, for color image processing problems, we introduce a concept of the non-negative RB matrix and then use the multiplication properties of RB to propose a non-negative RB matrix factorization (NRBMF) model. The NRBMF model is introduced to address the challenge of reasonably establishing a non-negative quaternion matrix factorization model, which is primarily hindered by the multiplication properties of traditional quaternions. Furthermore, this paper transforms the problem of solving the NRBMF model into an RB alternating non-negative least squares (RB-ANNLS) problem. Then, by introducing a method to compute the gradient of the real function with RB matrix variables, we solve the RB-ANNLS optimization problem using the RB projected gradient algorithm and conduct a convergence analysis of the algorithm. Finally, we validate the effectiveness and superiority of the proposed NRBMF model in color face recognition.

cs.CV↗

arXiv2024

Randomized Quaternion UTV Decomposition and Randomized Quaternion Tensor UTV Decomposition

In this paper, the quaternion matrix UTV (QUTV) decomposition and quaternion tensor UTV (QTUTV) decomposition are proposed. To begin, the terms QUTV and QTUTV are defined, followed by the algorithms. Subsequently, by employing random sampling from the quaternion normal distribution, randomized QUTV and randomized QTUTV are generated to provide enhanced algorithmic efficiency. These techniques produce decompositions that are straightforward 9 to understand and require minimal cost. Furthermore, theoretical analysis is discussed. Specifically, the upper bounds for approximating QUTV on the rank-K and QTUTV on the TQt-rank K errors are provided, followed by deterministic error bounds and average-case error bounds for the randomized situations, which demonstrate the correlation between the accuracy of the low-rank approximation and the singular values. Finally, numerous numerical experiments are presented to verify that the proposed algorithms work more efficiently and with similar relative errors compared to other comparable decomposition methods. For the novel decompositions, the theory analysis offers a solid theoretical basis and the experiments show significant potential for the associated processing tasks of color images and color videos.

math.NA↗

arXiv2023

Quaternion tensor left ring decomposition and application for color image inpainting

In recent years, tensor networks have emerged as powerful tools for solving large-scale optimization problems. One of the most promising tensor networks is the tensor ring (TR) decomposition, which achieves circular dimensional permutation invariance in the model through the utilization of the trace operation and equitable treatment of the latent cores. On the other hand, more recently, quaternions have gained significant attention and have been widely utilized in color image processing tasks due to their effectiveness in encoding color pixels by considering the three color channels as a unified entity. Therefore, in this paper, based on the left quaternion matrix multiplication, we propose the quaternion tensor left ring (QTLR) decomposition, which inherits the powerful and generalized representation abilities of the TR decomposition while leveraging the advantages of quaternions for color pixel representation. In addition to providing the definition of QTLR decomposition and an algorithm for learning the QTLR format, the paper further proposes a low-rank quaternion tensor completion (LRQTC) model and its algorithm for color image inpainting based on the defined QTLR decomposition. Finally, extensive experiments on color image inpainting demonstrate that the proposed LRQTC method is highly competitive.

cs.CV↗

arXiv2023

$L_{2,1}$-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition

Color image completion is a challenging problem in computer vision, but recent research has shown that quaternion representations of color images perform well in many areas. These representations consider the entire color image and effectively utilize coupling information between the three color channels. Consequently, low-rank quaternion matrix completion (LRQMC) algorithms have gained significant attention. We propose a method based on quaternion Qatar Riyal decomposition (QQR) and quaternion $L_{2,1}$-norm called QLNM-QQR. This new approach reduces computational complexity by avoiding the need to calculate the QSVD of large quaternion matrices. We also present two improvements to the QLNM-QQR method: an enhanced version called IRQLNM-QQR that uses iteratively reweighted quaternion $L_{2,1}$-norm minimization and a method called QLNM-QQR-SR that integrates sparse regularization. Our experiments on natural color images and color medical images show that IRQLNM-QQR outperforms QLNM-QQR and that the proposed QLNM-QQR-SR method is superior to several state-of-the-art methods.

cs.CV↗

arXiv2023

Quaternion Matrix Completion Using Untrained Quaternion Convolutional Neural Network for Color Image Inpainting

The use of quaternions as a novel tool for color image representation has yielded impressive results in color image processing. By considering the color image as a unified entity rather than separate color space components, quaternions can effectively exploit the strong correlation among the RGB channels, leading to enhanced performance. Especially, color image inpainting tasks are highly beneficial from the application of quaternion matrix completion techniques, in recent years. However, existing quaternion matrix completion methods suffer from two major drawbacks. First, it can be difficult to choose a regularizer that captures the common characteristics of natural images, and sometimes the regularizer that is chosen based on empirical evidence may not be the optimal or efficient option. Second, the optimization process of quaternion matrix completion models is quite challenging because of the non-commutativity of quaternion multiplication. To address the two drawbacks of the existing quaternion matrix completion approaches mentioned above, this paper tends to use an untrained quaternion convolutional neural network (QCNN) to directly generate the completed quaternion matrix. This approach replaces the explicit regularization term in the quaternion matrix completion model with an implicit prior that is learned by the QCNN. Extensive quantitative and qualitative evaluations demonstrate the superiority of the proposed method for color image inpainting compared with some existing quaternion-based and tensor-based methods.

eess.IV↗

arXiv2022

Quaternion Tensor Completion with Sparseness for Color Video Recovery

A novel low-rank completion algorithm based on the quaternion tensor is proposed in this paper. This approach uses the TQt-rank of quaternion tensor to maintain the structure of RGB channels throughout the entire process. In more detail, the pixels in each frame are encoded on three imaginary parts of a quaternion as an element in a quaternion matrix. Each quaternion matrix is then stacked into a quaternion tensor. A logarithmic function and truncated nuclear norm are employed to characterize the rank of the quaternion tensor in order to promote the low rankness of the tensor. Moreover, by introducing a newly defined quaternion tensor discrete cosine transform-based (QTDCT) regularization to the low-rank approximation framework, the optimized recovery results can be obtained in the local details of color videos. In particular, the sparsity of the quaternion tensor is reasonably characterized by l1 norm in the QDCT domain. This strategy is optimized via the two-step alternating direction method of multipliers (ADMM) framework. Numerical experimental results for recovering color videos show the obvious advantage of the proposed method over other potential competing approaches.

eess.IV↗

arXiv2022

Low Rank Quaternion Matrix Completion Based on Quaternion QR Decomposition and Sparse Regularizer

Matrix completion is one of the most challenging problems in computer vision. Recently, quaternion representations of color images have achieved competitive performance in many fields. Because it treats the color image as a whole, the coupling information between the three channels of the color image is better utilized. Due to this, low-rank quaternion matrix completion (LRQMC) algorithms have gained considerable attention from researchers. In contrast to the traditional quaternion matrix completion algorithms based on quaternion singular value decomposition (QSVD), we propose a novel method based on quaternion Qatar Riyal decomposition (QQR). In the first part of the paper, a novel method for calculating an approximate QSVD based on iterative QQR is proposed (CQSVD-QQR), whose computational complexity is lower than that of QSVD. The largest $r \ (r>0)$ singular values of a given quaternion matrix can be computed by using CQSVD-QQR. Then, we propose a new quaternion matrix completion method based on CQSVD-QQR which combines low-rank and sparse priors of color images. Experimental results on color images and color medical images demonstrate that our model outperforms those state-of-the-art methods.

eess.IV↗

arXiv2022

Quaternion Tensor Train Rank Minimization with Sparse Regularization in a Transformed Domain for Quaternion Tensor Completion

The tensor train rank (TT-rank) has achieved promising results in tensor completion due to its ability to capture the global low-rankness of higher-order (>3) tensors. On the other hand, recently, quaternions have proven to be a very suitable framework for encoding color pixels, and have obtained outstanding performance in various color image processing tasks. In this paper, the quaternion tensor train (QTT) decomposition is presented, and based on that the quaternion TT-rank (QTT-rank) is naturally defined, which are the generalizations of their counterparts in the real number field. In addition, to utilize the local sparse prior of the quaternion tensor, a general and flexible transform framework is defined. Combining both the global low-rank and local sparse priors of the quaternion tensor, we propose a novel quaternion tensor completion model, i.e., QTT-rank minimization with sparse regularization in a transformed domain. Specifically, we use the quaternion weighted nuclear norm (QWNN) of mode-n canonical unfolding quaternion matrices to characterize the global low-QTT-rankness, and the l1-norm of the quaternion tensor in a transformed domain to characterize the local sparse property. Moreover, to enable the QTT-rank minimization to handle color images and better handle color videos, we generalize KA, a tensor augmentation method, to quaternion tensors and define quaternion KA (QKA), which is a helpful pretreatment step for QTT-rank based optimization problems. The numerical experiments on color images and color videos inpainting tasks indicate the advantages of the proposed method over the state-of-the-art ones.

eess.IV↗

arXiv2021

Quaternion-based dynamic mode decomposition for background modeling in color videos

Scene Background Initialization (SBI) is one of the challenging problems in computer vision. Dynamic mode decomposition (DMD) is a recently proposed method to robustly decompose a video sequence into the background model and the corresponding foreground part. However, this method needs to convert the color image into the grayscale image for processing, which leads to the neglect of the coupling information between the three channels of the color image. In this study, we propose a quaternion-based DMD (Q-DMD), which extends the DMD by quaternion matrix analysis, so as to completely preserve the inherent color structure of the color image and the color video. We exploit the standard eigenvalues of the quaternion matrix to compute its spectral decomposition and calculate the corresponding Q-DMD modes and eigenvalues. The results on the publicly available benchmark datasets prove that our Q-DMD outperforms the exact DMD method, and experiment results also demonstrate that the performance of our approach is comparable to that of the state-of-the-art ones.

cs.CV↗

arXiv2021

Quaternion tensor singular value decomposition using a flexible transform-based approach

A flexible transform-based tensor product named $\star_{\rm{QT}}$-product for $L$th-order ($L\geq 3$) quaternion tensors is proposed. Based on the $\star_{\rm{QT}}$-product, we define the corresponding singular value decomposition named TQt-SVD and the rank named TQt-rank of the $L$th-order ($L\geq 3$) quaternion tensor. Furthermore, with orthogonal quaternion transformations, the TQt-SVD can provide the best TQt-rank-$s$ approximation of any $L$th-order ($L\geq 3$) quaternion tensor. In the experiments, we have verified the effectiveness of the proposed TQt-SVD in the application of the best TQt-rank-$s$ approximation for color videos represented by third-order quaternion tensors.

math.NA↗

arXiv2021

Low Rank Quaternion Matrix Recovery via Logarithmic Approximation

In color image processing, image completion aims to restore missing entries from the incomplete observation image. Recently, great progress has been made in achieving completion by approximately solving the rank minimization problem. In this paper, we utilize a novel quaternion matrix logarithmic norm to approximate rank under the quaternion matrix framework. From one side, unlike the traditional matrix completion method that handles RGB channels separately, the quaternion-based method is able to avoid destroying the structure of images via putting the color image in a pure quaternion matrix. From the other side, the logarithmic norm induces a more accurate rank surrogate. Based on the logarithmic norm, we take advantage of not only truncated technique but also factorization strategy to achieve image restoration. Both strategies are optimized based on the alternating minimization framework. The experimental results demonstrate that the use of logarithmic surrogates in the quaternion domain is more superior in solving the problem of color images completion.

eess.IV↗

arXiv2021

Weighted Truncated Nuclear Norm Regularization for Low-Rank Quaternion Matrix Completion

In recent years, quaternion matrix completion (QMC) based on low-rank regularization has been gradually used in image de-noising and de-blurring.Unlike low-rank matrix completion (LRMC) which handles RGB images by recovering each color channel separately, the QMC models utilize the connection of three channels by processing them as a whole. Most of the existing quaternion-based methods formulate low-rank QMC (LRQMC) as a quaternion nuclear norm (a convex relaxation of the rank) minimization problem.The main limitation of these approaches is that the singular values being minimized simultaneously so that the low-rank property could not be approximated well and efficiently. To achieve a more accurate low-rank approximation, the matrix-based truncated nuclear norm has been proposed and also been proved to have the superiority. In this paper, we introduce a quaternion truncated nuclear norm (QTNN) for LRQMC and utilize the alternating direction method of multipliers (ADMM) to get the optimization.We further propose weights to the residual error quaternion matrix during the update process for accelerating the convergence of the QTNN method with admissible performance. The weighted method utilizes a concise gradient descent strategy which has a theoretical guarantee in optimization. The effectiveness of our method is illustrated by experiments on real visual datasets.

eess.IV↗

arXiv2021

Quaternion higher-order singular value decomposition and its applications in color image processing

Higher-order singular value decomposition (HOSVD) is one of the most efficient tensor decomposition techniques. It has the salient ability to represent high_dimensional data and extract features. In more recent years, the quaternion has proven to be a very suitable tool for color pixel representation as it can well preserve cross-channel correlation of color channels. Motivated by the advantages of the HOSVD and the quaternion tool, in this paper, we generalize the HOSVD to the quaternion domain and define quaternion-based HOSVD (QHOSVD). Due to the non-commutability of quaternion multiplication, QHOSVD is not a trivial extension of the HOSVD. They have similar but different calculation procedures. The defined QHOSVD can be widely used in various visual data processing with color pixels. In this paper, we present two applications of the defined QHOSVD in color image processing: multi_focus color image fusion and color image denoising. The experimental results on the two applications respectively demonstrate the competitive performance of the proposed methods over some existing ones.

eess.IV↗

arXiv2020

Constrained low-rank quaternion approximation for color image denoising by bilateral random projections

In this letter, we propose a novel low-rank quaternion approximation (LRQA) model by directly constraining the quaternion rank prior for effectively removing the noise in color images. The LRQA model treats the color image holistically rather than independently for the color space components, thus it can fully utilize the high correlation among RGB channels. We design an iterative algorithm by using quaternion bilateral random projections (Q-BRP) to efficiently optimize the proposed model. The main advantage of Q-BRP is that the approximation of the low-rank quaternion matrix can be obtained quite accurately in an inexpensive way. Furthermore, color image denoising is further based on nonlocal self-similarity (NSS) prior. The experimental results on color image denoising illustrate the effectiveness and superiority of the proposed method.

eess.IV↗

arXiv2020

Quaternion-based bilinear factor matrix norm minimization for color image inpainting

As a new color image representation tool, quaternion has achieved excellent results in the color image processing, because it treats the color image as a whole rather than as a separate color space component, thus it can make full use of the high correlation among RGB channels. Recently, low-rank quaternion matrix completion (LRQMC) methods have proven very useful for color image inpainting. In this paper, we propose three novel LRQMC methods based on three quaternion-based bilinear factor (QBF) matrix norm minimization models. Specifically, we define quaternion double Frobenius norm (Q-DFN), quaternion double nuclear norm (Q-DNN) and quaternion Frobenius/nuclear norm (Q-FNN), and then show their relationship with quaternion-based matrix Schatten-p (Q- Schatten-p ) norm for certain p values. The proposed methods can avoid computing quaternion singular value decompositions (QSVD) for large quaternion matrices, and thus can effectively reduce the calculation time compared with existing (LRQMC) methods. The experimental results demonstrate the superior performance of the proposed methods over some state-of-the-art low-rank (quaternion) matrix completion methods.

eess.IV↗