Reweighted Low-Rank Matrix Recovery and its Application in Image Restoration
Lists
Only you see this
Abstract
In this paper, we propose a reweighted low-rank matrix recovery method and demonstrate its application for robust image restoration. In the literature, principal component pursuit solves low-rank matrix recovery problem via a convex program of mixed nuclear norm and ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm. Inspired by reweighted ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> 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 both on numerical simulations and real images/videos restoration, including single image restoration, hyperspectral image restoration, and background modeling from corrupted observations. All of these experiments give empirical evidence on significant improvements of the proposed algorithm over previous work on low-rank matrix recovery.
BibTeX
@article{peng2014reweighted,
author = {YiGang Peng and Jin-Li Suo and Qionghai Dai and Wenli Xu},
title = {{Reweighted Low-Rank Matrix Recovery and its Application in Image Restoration}},
journal = {IEEE Trans. Cybernetics},
year = {2014},
url = {https://openreview.net/forum?id=nba0LHrqVz},
}Loading related content...