2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings
DOI: 10.1109/icassp.2006.1660659
|View full text |Cite
|
Sign up to set email alerts
|

Recovery Conditions of Sparse Representations in the Presence of Noise.

Abstract: When seeking a representation of a signal on a redundant basis one generally replaces the quest for the sparsest model by an 1 minimization and solves thus a linear program. In the presence of noise one has in addition to replace the exact reconstruction constraint by an approximate one. We consider simultaneously several ways to allow for reconstruction errors and analyze precisely under which conditions exact recovery is possible in the absence of noise. These are then also the conditions that allow recovery… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…The minimization problem in (83) has at least one solution by coercivity, and is non-convex. But, for fixed γ (resp.…”
Section: The Algorithmic Viewpointmentioning
confidence: 99%
See 1 more Smart Citation
“…The minimization problem in (83) has at least one solution by coercivity, and is non-convex. But, for fixed γ (resp.…”
Section: The Algorithmic Viewpointmentioning
confidence: 99%
“…γ) is convex. As solutions of problem (83) have no explicit formulation, we again propose solving it by means of a block-coordinate relaxation iterative algorithm by alternately minimizing with respect to γ holding ν fixed, and vice versa. Thus, by classical ideas in convex analysis, a necessary condition for (γ, ν) to be a minimizer is that the zero is an element of the subdifferential of the objective at (γ, ν).…”
Section: The Algorithmic Viewpointmentioning
confidence: 99%
“…Sparse recovery and stability conditions have been studied in [41][42][43] in the monochannel case. More particularly, conditions are proved in [41] under which OMP verifies an Exact Selection Property in the presence of bounded noise Z < .…”
Section: Handling Bounded Noise With Mmcamentioning
confidence: 99%