Exact Reconstruction Conditions for Regularized Modified Basis Pursuit

08/16/2011
by   Wei Lu, et al.
0

In this correspondence, we obtain exact recovery conditions for regularized modified basis pursuit (reg-mod-BP) and discuss when the obtained conditions are weaker than those for modified-CS or for basis pursuit (BP). The discussion is also supported by simulation comparisons. Reg-mod-BP provides a solution to the sparse recovery problem when both an erroneous estimate of the signal's support, denoted by T, and an erroneous estimate of the signal values on T are available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2021

Error-Correction for Sparse Support Recovery Algorithms

Consider the compressed sensing setup where the support s^* of an m-spar...
research
07/06/2015

Subspace-Sparse Representation

Given an overcomplete dictionary A and a signal b that is a linear combi...
research
10/31/2017

Accelerated Sparse Subspace Clustering

State-of-the-art algorithms for sparse subspace clustering perform spect...
research
12/20/2019

When Explanations Lie: Why Modified BP Attribution Fails

Modified backpropagation methods are a popular group of attribution meth...
research
07/15/2019

Recovery Guarantees for Compressible Signals with Adversarial Noise

We provide recovery guarantees for compressible signals that have been c...
research
03/03/2019

Deterministic Analysis of Weighted BPDN With Partially Known Support Information

In this paper, with the aid of the powerful Restricted Isometry Constant...
research
06/02/2020

Modified Hard Thresholding Pursuit with Regularization Assisted Support Identification

Hard thresholding pursuit (HTP) is a recently proposed iterative sparse ...

Please sign up or login with your details

Forgot password? Click here to reset