Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation

DOI10.1016/J.JFRANKLIN.2020.03.032zbMATH Open1457.94022arXiv1911.08914OpenAlexW3022212446MaRDI QIDQ776102FDOQ776102

Authors: Yunyi Li, Li Liu, Yu Zhao, Guan Gui, Xie-Feng Cheng 

Publication date: 30 June 2020

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Abstract: Group sparse representation (GSR) based method has led to great successes in various image recovery tasks, which can be converted into a low-rank matrix minimization problem. As a widely used surrogate function of low-rank, the nuclear norm based convex surrogate usually leads to over-shrinking problem, since the standard soft-thresholding operator shrinks all singular values equally. To improve traditional sparse representation based image compressive sensing (CS) performance, we propose a generalized CS framework based on GSR model, which leads to a nonconvex nonsmooth low-rank minimization problem. The popular L_2-norm and M-estimator are employed for standard image CS and robust CS problem to fit the data respectively. For the better approximation of the rank of group-matrix, a family of nuclear norms are employed to address the over-shrinking problem. Moreover, we also propose a flexible and effective iteratively-weighting strategy to control the weighting and contribution of each singular value. Then we develop an iteratively reweighted nuclear norm algorithm for our generalized framework via an alternating direction method of multipliers framework, namely, GSR-AIR. Experimental results demonstrate that our proposed CS framework can achieve favorable reconstruction performance compared with current state-of-the-art methods and the robust CS framework can suppress the outliers effectively.

Full work available at URL: https://arxiv.org/abs/1911.08914

Recommendations

• Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
• Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
• A non-convex regularization approach for compressive sensing
• A generalized robust minimization framework for low-rank matrix recovery

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Nearly unbiased variable selection under minimax concave penalty
• Reduced rank regression via adaptive nuclear norm penalization
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Analysis of multi-stage convex relaxation for sparse regularization
• A Statistical View of Some Chemometrics Regression Tools
• Nonlocally Centralized Sparse Representation for Image Restoration
• A Review of Image Denoising Algorithms, with a New One
• An algorithm for total variation minimization and applications
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
• FSIM: A Feature Similarity Index for Image Quality Assessment
• Group-Based Sparse Representation for Image Restoration
• Improved adaptive sparse channel estimation using mixed square/fourth error criterion
• Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
• Compressive Sensing via Nonlocal Low-Rank Regularization
• Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
• Globally sparse and locally dense signal recovery for compressed sensing
• Image Denoising by Exploring External and Internal Correlations
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• Compressive Sensing Image Restoration Using Adaptive Curvelet Thresholding and Nonlocal Sparse Regularization
• Reconstruction of Structurally-Incomplete Matrices With Reweighted Low-Rank and Sparsity Priors
• Textured Image Demoiréing via Signal Decomposition and Guided Filtering
• Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
• Improved Image Recovery From Compressed Data Contaminated With Impulsive Noise

Cited In (13)

• A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
• Nonconvex \(L_{1/2}\)-regularized nonlocal self-similarity denoiser for compressive sensing based CT reconstruction
• Smoothed amplitude flow-based phase retrieval algorithm
• Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery
• Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
• Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity
• Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
• Patch-based weighted SCAD prior for compressive sensing
• Sparse Bayesian learning approach for discrete signal reconstruction
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
• A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm

Uses Software

• FSIM

This page was built for publication: Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776102)