Name
Abstract | ||
|---|---|---|
We propose an efficient and easy-to-implement method to settle the inpainting problem for low-rank images following the recent studies about low-rank matrix completion. In general, our method has three steps: first, corresponding to the three channels of RGB color space, an incomplete image is split into three incomplete matrices; second, each matrix is restored by solving a convex problem derived from the nuclear norm relaxation; at last, the three recovered matrices are merged to produce the final output. During the process, in order to efficiently solve the nuclear norm minimization problem, we employ the alternating direction method. Except for the basic image inpainting problem, we also enable our method to handle cases where corrupted images not only have missing values but also have noisy entries. Our experiments show that our method outperforms the existing inpainting techniques both quantitatively and qualitatively. We also demonstrate that our method is capable of processing many other situations, including block-wise low-rank image completion, large-scale image restoration, and object removal. (C) 2014 SPIE and IS&T |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1117/1.JEI.23.3.033018 | JOURNAL OF ELECTRONIC IMAGING |
Keywords | Field | DocType |
image inpainting,low rank,matrix completion,alternating direction method | Computer vision,Matrix completion,Pattern recognition,Matrix (mathematics),Computer science,RGB color space,Inpainting,Matrix norm,Artificial intelligence,Missing data,Image restoration,Convex optimization | Journal |
Volume | Issue | ISSN |
23 | 3 | 1017-9909 |
Citations | PageRank | References |
2 | 0.41 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Li | 1 | 38 | 2.85 |
| Lei Zhao | 2 | 17 | 3.82 |
| Duanqing Xu | 3 | 78 | 13.16 |
| Dongming Lu | 4 | 163 | 32.29 |