On unified view of nullspace-type conditions for recoveries associated with general sparsity structures

07/04/2012
by   Anatoli Juditsky, et al.
0

We discuss a general notion of "sparsity structure" and associated recoveries of a sparse signal from its linear image of reduced dimension possibly corrupted with noise. Our approach allows for unified treatment of (a) the "usual sparsity" and "usual ℓ_1 recovery," (b) block-sparsity with possibly overlapping blocks and associated block-ℓ_1 recovery, and (c) low-rank-oriented recovery by nuclear norm minimization. The proposed recovery routines are natural extensions of the usual ℓ_1 minimization used in Compressed Sensing. Specifically we present nullspace-type sufficient conditions for the recovery to be precise on sparse signals in the noiseless case. Then we derive error bounds for imperfect (nearly sparse signal, presence of observation noise, etc.) recovery under these conditions. In all of these cases, we present efficiently verifiable sufficient conditions for the validity of the associated nullspace properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2016

Tight Performance Bounds for Compressed Sensing With Group Sparsity

Compressed sensing refers to the recovery of a high-dimensional but spar...
research
11/10/2011

Accuracy guaranties for ℓ_1 recovery of block-sparse signals

We introduce a general framework to handle structured models (sparse and...
research
04/05/2018

Sparse Recovery of Fusion Frame Structured Signals

Fusion frames are collection of subspaces which provide a redundant repr...
research
10/19/2020

Sparse Recovery Analysis of Generalized J-Minimization with Results for Sparsity Promoting Functions with Monotonic Elasticity

In this paper we theoretically study exact recovery of sparse vectors fr...
research
03/12/2021

Block sparse signal recovery via minimizing the block q-ratio sparsity

In this paper, we propose a method for block sparse signal recovery that...
research
11/29/2010

New Null Space Results and Recovery Thresholds for Matrix Rank Minimization

Nuclear norm minimization (NNM) has recently gained significant attentio...
research
11/22/2013

Finding sparse solutions of systems of polynomial equations via group-sparsity optimization

The paper deals with the problem of finding sparse solutions to systems ...

Please sign up or login with your details

Forgot password? Click here to reset