Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices
Guangjing Song, Weiyang Ding, Michael K. Ng

TL;DR
This paper introduces an optimal low-rank pure quaternion matrix approximation method for color images, using projections on quaternion matrix manifolds to improve image representation.
Contribution
It develops an alternating projections algorithm to find the best low-rank pure quaternion approximation, addressing limitations of previous methods.
Findings
The algorithm effectively finds optimal low-rank pure quaternion approximations.
Numerical experiments demonstrate improved image representation quality.
The convergence of the method is theoretically established.
Abstract
Quaternion matrices are employed successfully in many color image processing applications. In particular, a pure quaternion matrix can be used to represent red, green and blue channels of color images. A low-rank approximation for a pure quaternion matrix can be obtained by using the quaternion singular value decomposition. However, this approximation is not optimal in the sense that the resulting low-rank approximation matrix may not be pure quaternion, i.e., the low-rank matrix contains real component which is not useful for the representation of a color image. The main contribution of this paper is to find an optimal rank- pure quaternion matrix approximation for a pure quaternion matrix (a color image). Our idea is to use a projection on a low-rank quaternion matrix manifold and a projection on a quaternion matrix with zero real component, and develop an alternating projections…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Advanced Vision and Imaging · Matrix Theory and Algorithms
