Name
Abstract | ||
|---|---|---|
Rank minimization problem has a wide range of applications in different areas. However, since this problem is NP-hard and non-convex, the frequently used method is to replace the matrix rank minimization with nuclear norm minimization. Nuclear norm is the convex envelope of the matrix rank and it is more computationally tractable. Matrix completion is a special case of rank minimization problem. In this paper, we consider directly using matrix rank as the regularization term instead of nuclear norm in the cost function for matrix completion problem. The solution is analyzed and obtained by a hard-thresholding operation on the singular values of the observed matrix. Then by exploiting patch-based nonlocal self-similarity scheme, we apply the proposed rank minimization algorithm to remove white Gaussian additive noise in images. Gamma multiplicative noise is also removed in logarithm domain. The experimental results illustrate that the proposed algorithm can remove noises in images more efficiently than nuclear norm can do. And the results are also competitive with those obtained by using the existing state-of-the-art noise removal methods in the literature. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ins.2017.10.047 | Information Sciences |
Keywords | Field | DocType |
Rank minimization problem,Nuclear norm,White Gaussian additive noise removal,Gamma multiplicative noise removal,Nonlocal self-similarity,Block matching | Rank (linear algebra),Discrete mathematics,Singular value,Matrix completion,Matrix (mathematics),Matrix norm,Low-rank approximation,Logarithm,Mathematics,Multiplicative noise | Journal |
Volume | Issue | ISSN |
429 | C | 0020-0255 |
Citations | PageRank | References |
2 | 0.42 | 29 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-Mei Huang | 1 | 258 | 11.83 |
| Hui-Yin Yan | 2 | 7 | 1.01 |
| You-Wei Wen | 3 | 353 | 18.93 |
| Xue Yang | 4 | 15 | 10.21 |