Abstract
This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with nonconvex regularization. We employ parameterized nonconvex penalty functions to estimate the nonzero singular values more accurately than the nuclear norm. A closed-form solution for the global optimum of the proposed objective function (sum of data fidelity and the nonconvex regularizer) is also derived. The solution reduces to singular value thresholding method as a special case. The proposed method is demonstrated for image denoising.
Original language | English (US) |
---|---|
Article number | 7420602 |
Pages (from-to) | 493-497 |
Number of pages | 5 |
Journal | IEEE Signal Processing Letters |
Volume | 23 |
Issue number | 4 |
DOIs | |
State | Published - Apr 1 2016 |
Keywords
- convex
- image denoising
- Low-rank matrix
- non-convex regularization
- nuclear norm
- optimization
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Signal Processing
- Applied Mathematics