Robust image restoration via reweighted low-rank matrix recovery

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a robust image restoration method via reweighted low-rank matrix recovery. In the literature, Principal Component Pursuit (PCP) solves low-rank matrix recovery problem via a convex program of mixed nuclear norm and ℓ1 norm. Inspired by reweighted ℓ1 minimization for sparsity enhancement, we propose reweighting singular values to enhance low rank of a matrix. An efficient iterative reweighting scheme is proposed for enhancing low rank and sparsity simultaneously and the performance of low-rank matrix recovery is prompted greatly. We demonstrate the utility of the proposed method on robust image restoration, including single image and hyperspectral image restoration. All of these experiments give appealing results on robust image restoration. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Peng, Y., Suo, J., Dai, Q., Xu, W., & Lu, S. (2014). Robust image restoration via reweighted low-rank matrix recovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8325 LNCS, pp. 315–326). https://doi.org/10.1007/978-3-319-04114-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free