Enhanced Low-Rank Matrix Approximation

Abstract

This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization. We employ parameterized non-convex penalty functions to estimate the non-zero 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 non-convex regularizer) is also derived. The solution reduces to singular value thresholding method as a special case. The proposed method is demonstrated for image denoising.

5 pages, 2 figures. MATLAB code available at https://goo.gl/xAi85N

References in corpus (7)

• Nearly unbiased variable selection under minimax concave penalty
• Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm
• Sparsity-based Algorithm for Detecting Faults in Rotating Machines
• A Singular Value Thresholding Algorithm for Matrix Completion
• On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
• Concentration-Based Guarantees for Low-Rank Matrix Reconstruction
• Matrix reconstruction with the local max norm

Cited by in corpus (16)

• Sparse Regularization via Convex Analysis
• Total Variation Denoising via the Moreau Envelope
• ${\ell }_0$-Motivated Low-Rank Sparse Subspace Clustering
• Improved Sparse Low-Rank Matrix Estimation
• A Class of Nonconvex Penalties Preserving Overall Convexity in Optimization-Based Mean Filtering
• Nonconvex penalties with analytical solutions for one-bit compressive sensing
• A Penalty Function Promoting Sparsity Within and Across Groups
• Linearly-involved Moreau-Enhanced-over-Subspace Model: Debiased Sparse Modeling and Stable Outlier-Robust Regression
• A Unified Framework for Solving a General Class of Nonconvexly Regularized Convex Models
• A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
• Continuous Relaxation of Discontinuous Shrinkage Operator: Proximal Inclusion and Conversion
• A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning
• A Fast Data Driven Shrinkage of Singular Values for Arbitrary Rank Signal Matrix Denoising
• Constrained low-rank quaternion approximation for color image denoising by bilateral random projections
• A Convex-Nonconvex Framework for Enhancing Minimization Induced Penalties
• Low Tensor Train- and Low Multilinear Rank Approximations for De-speckling and Compression of 3D Optical Coherence Tomography Images