Jifei Miao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jifei Miao has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Kit Ian Kou
Department of Mathematics, Faculty of Science and Technology, University of Macau, Macao, China
12 shared publications - Jun Liu
School of Mathematics and Statistics, Northeast Normal University, Changchun, China
2 shared publications - Liang-Jian Deng
University of Electronic Science and Technology of China
2 shared publications - Liangtian He
School of Mathematical Sciences, Anhui University, Hefei, China
2 shared publications - Liqiao Yang
Department of Mathematics Faculty of Science and Technology University of Macau 999078 Macau China
2 shared publications - Zhijie Wang2 shared publications
Latest Publications
- Open Access
- 18 October 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (5) , e70126
Nonnegative Reduced Biquaternion Matrix Factorization With Applications in Color Face Recognition
Quaternion numbers are commonly used to represent color image pixels. Since color image pixels are nonnegative, nonnegativity constraint should be incorporated into the components of quaternion numbers. However, existing quaternion‐based matrix factorization models do not fully satisfy nonnegativity constraints. The main purpose of this paper is to propose and develop nonnegative quaternion matrix factorization models to address the relevant color image processing problems. Our main idea is to employ the product of reduced biquaternion (RB) matrices in the factorization such that nonnegativity constraint can be incorporated properly. The proposed nonnegative RB matrix factorization (NRBMF) model is solved by an alternating minimization algorithm, which alternately solves the RB nonnegative least squares problem of latent features and encoding factors. The theoretical convergence of the alternating minimization algorithm is also established. Experimental results on color face recognition demonstrate that the proposed NRBMF model achieves superior recognition performance compared with existing competing models.
- 18 October 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (5) , e70126
Open AccessNonnegative Reduced Biquaternion Matrix Factorization With Applications in Color Face Recognition
Quaternion numbers are commonly used to represent color image pixels. Since color image pixels are nonnegative, nonnegativity constraint should be incorporated into the components of quaternion numbers. However, existing quaternion‐based matrix factorization models do not fully satisfy nonnegativity constraints. The main purpose of this paper is to propose and develop nonnegative quaternion matrix factorization models to address the relevant color image processing problems. Our main idea is to employ the product of reduced biquaternion (RB) matrices in the factorization such that nonnegativity constraint can be incorporated properly. The proposed nonnegative RB matrix factorization (NRBMF) model is solved by an alternating minimization algorithm, which alternately solves the RB nonnegative least squares problem of latent features and encoding factors. The theoretical convergence of the alternating minimization algorithm is also established. Experimental results on color face recognition demonstrate that the proposed NRBMF model achieves superior recognition performance compared with existing competing models.
- 9 December 2025
- Published by Elsevier in Information Sciences
- Vol. 733
Reweighted low-rank quaternion matrix factorization with deep denoising prior for color image inpainting
- 9 December 2025
- Published by Elsevier in Information Sciences
- Vol. 733
Reweighted low-rank quaternion matrix factorization with deep denoising prior for color image inpainting
- Open Access
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.
Open AccessQuaternion 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.
- Open Access
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.
Open AccessQuaternion 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.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 32 (10577149) , 446-457
Quaternion Scalar and Vector Norm Decomposition: Quaternion PCA for Color Face Recognition
This paper proposes a decomposition called quaternion scalar and vector norm decomposition (QSVND) for approximation problems in color image processing. Different from traditional quaternion norm approximations that are always the single objective models (SOM), QSVND is adopted to transform the SOM into the bi-objective model (BOM). Furthermore, regularization is used to solve the BOM problem as a common scalarization method, which converts the BOM into a more reasonable SOM. This can handle over-fitting or under-fitting problems neglected in this kind of research for quaternion representation (QR) in color image processing. That is how to treat redundancy caused by the extra scalar part when the vector part of a quaternion is used to represent a color pixel. We apply QSVND to quaternion principal component analysis (QPCA) for color face recognition (FR), which can deal with the phenomenon of under-fitting of vector part norm approximation. Comparisons with the competing approaches on AR, FERET, FEI, and KDEF&AKDEF databases consistently show the superiority of the proposed approach for color FR.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 32 (10577149) , 446-457
Quaternion Scalar and Vector Norm Decomposition: Quaternion PCA for Color Face Recognition
This paper proposes a decomposition called quaternion scalar and vector norm decomposition (QSVND) for approximation problems in color image processing. Different from traditional quaternion norm approximations that are always the single objective models (SOM), QSVND is adopted to transform the SOM into the bi-objective model (BOM). Furthermore, regularization is used to solve the BOM problem as a common scalarization method, which converts the BOM into a more reasonable SOM. This can handle over-fitting or under-fitting problems neglected in this kind of research for quaternion representation (QR) in color image processing. That is how to treat redundancy caused by the extra scalar part when the vector part of a quaternion is used to represent a color pixel. We apply QSVND to quaternion principal component analysis (QPCA) for color face recognition (FR), which can deal with the phenomenon of under-fitting of vector part norm approximation. Comparisons with the competing approaches on AR, FERET, FEI, and KDEF&AKDEF databases consistently show the superiority of the proposed approach for color FR.
- Open Access
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.
Open AccessQuaternion 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.
- Open Access
- 16 September 2022
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 224, 103560
Quaternion-based dynamic mode decomposition for background modeling in color videos
- 16 September 2022
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 224, 103560
Open AccessQuaternion-based dynamic mode decomposition for background modeling in color videos
- Top Cited Papers
- 22 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 190-201
Color Image Recovery Using Low-Rank Quaternion Matrix Completion Algorithm
As a new color image representation tool, quaternion has achieved excellent results in color image processing problems. In this paper, we propose a novel low-rank quaternion matrix completion algorithm to recover missing data of a color image. Motivated by two kinds of low-rank approximation approaches (low-rank decomposition and nuclear norm minimization) in traditional matrix-based methods, we combine the two approaches in our quaternion matrix-based model. Furthermore, the nuclear norm of the quaternion matrix is replaced by the sum of the Frobenius norm of its two low-rank factor quaternion matrices. Based on the relationship between the quaternion matrix and its equivalent complex matrix, the problem eventually is converted from the quaternion number domain to the complex number domain. An alternating minimization method is applied to solve the model. Simulation results on color image recovery show the superior performance and efficiency of the proposed algorithm over some tensor-based and quaternion-based ones.
- 22 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 190-201
Top Cited PapersColor Image Recovery Using Low-Rank Quaternion Matrix Completion Algorithm
As a new color image representation tool, quaternion has achieved excellent results in color image processing problems. In this paper, we propose a novel low-rank quaternion matrix completion algorithm to recover missing data of a color image. Motivated by two kinds of low-rank approximation approaches (low-rank decomposition and nuclear norm minimization) in traditional matrix-based methods, we combine the two approaches in our quaternion matrix-based model. Furthermore, the nuclear norm of the quaternion matrix is replaced by the sum of the Frobenius norm of its two low-rank factor quaternion matrices. Based on the relationship between the quaternion matrix and its equivalent complex matrix, the problem eventually is converted from the quaternion number domain to the complex number domain. An alternating minimization method is applied to solve the model. Simulation results on color image recovery show the superior performance and efficiency of the proposed algorithm over some tensor-based and quaternion-based ones.
- 1 November 2020
- Published by Elsevier in Pattern Recognition
- Vol. 107
Low-rank quaternion tensor completion for recovering color videos and images
- 1 November 2020
- Published by Elsevier in Pattern Recognition
- Vol. 107
Low-rank quaternion tensor completion for recovering color videos and images