Successive Concave Sparsity Approximation for Compressed Sensing

DOI10.1109/TSP.2016.2585096MaRDI QIDQ4621019zbMATH OpenOpenAlexFDO

Authors Mohammadreza Malek-Mohammadi, Ali Koochakzadeh, Massoud Babaie-Zadeh, Magnus Jansson, Cristian R. Rojas

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: In this paper, based on a successively accuracy-increasing approximation of the $el{l}_0$ norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class of concave functions that aggressively induce sparsity and their closeness to the $el{l}_0$ norm can be controlled. We prove that the series of the approximations asymptotically coincides with the $el{l}_1$ and $el{l}_0$ norms when the approximation accuracy changes from the worst fitting to the best fitting. When measurements are noise-free, an optimization scheme is proposed which leads to a number of weighted $el{l}_1$ minimization programs, whereas, in the presence of noise, we propose two iterative thresholding methods that are computationally appealing. A convergence guarantee for the iterative thresholding method is provided, and, for a particular function in the class of the approximating functions, we derive the closed-form thresholding operator. We further present some theoretical analyses via the restricted isometry, null space, and spherical section properties. Our extensive numerical simulations indicate that the proposed algorithm closely follows the performance of the oracle estimator for a range of sparsity levels wider than those of the state-of-the-art algorithms.

Cited in

(11)

• A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
• A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
• Linearized Bregman iterations for compressed sensing
• On the Doubly Sparse Compressed Sensing Problem
• Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery
• On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
• A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
• Sparse recovery based on the generalized error function
• Min-max framework for majorization-minimization algorithms in signal processing applications: an overview
• A new framework for compressed sensing by p-concave functions
• A compression recovery method based on non-convex regularization and log-TV regularization

This page was built for publication: Successive Concave Sparsity Approximation for Compressed Sensing

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