Pith. sign in

REVIEW

Color image recovery using low-rank quaternion matrix completion algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.06567 v1 pith:I7ABPR34 submitted 2019-09-14 math.NA cs.NAeess.IV

classification math.NAcs.NAeess.IV
keywords quaternioncolorimagelow-rankmatrixalgorithmnormapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 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 Frobenius norm of its two low-rank factor quaternion matrices. Based on the relationship between quaternion matrix and its equivalent complex matrix, the problem eventually is converted from quaternion number field to complex number field. An alternating minimization method is applied to solve the model. Simulation results on real world color image recovery show the superior performance and efficiency of the proposed algorithm over some state-of-the-art tensor-based ones.

Discussion (0). Sign in to comment.

Pith tools