Name
Abstract | ||
|---|---|---|
In this paper, we study robust quaternion matrix completion and provide a rigorous analysis for provable estimation of quaternion matrix from a random subset of their corrupted entries. In order to generalize the results from real matrix completion to quaternion matrix completion, we derive some new formulas to handle noncommutativity of quaternions. We solve a convex optimization problem, which minimizes a nuclear norm of quaternion matrix that is a convex surrogate for the quaternion matrix rank, and the l(1)-norm of sparse quaternion matrix entries. We show that, under incoherence conditions, a quaternion matrix can be recovered exactly with overwhelming probability, provided that its rank is sufficiently small and that the corrupted entries are sparsely located. The quaternion framework can be used to represent red, green, and blue channels of color images. The results of missing/noisy color image pixels as a robust quaternion matrix completion problem are given to show that the performance of the proposed approach is better than that of the testing methods, including image inpainting methods, the tensor-based completion method, and the quaternion completion method using semidefinite programming. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/nla.2245 | NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS |
Keywords | Field | DocType |
color images,convex optimization,low rank,matrix recovery,quaternion | Mathematical optimization,Quaternion matrix,Quaternion,Algorithm,Inpainting,Convex optimization,Mathematics | Journal |
Volume | Issue | ISSN |
26.0 | 4.0 | 1070-5325 |
Citations | PageRank | References |
2 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhigang Jia | 1 | 43 | 9.02 |
| Ng Michael | 2 | 4231 | 311.70 |
| Guang-Jing Song | 3 | 45 | 7.06 |