Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization
From MaRDI portal
Publication:4594564
Abstract: Analysis -recovery refers to a technique of recovering a signal that is sparse in some transform domain from incomplete corrupted measurements. This includes total variation minimization as an important special case when the transform domain is generated by a difference operator. In the present paper we provide a bound on the number of Gaussian measurements required for successful recovery for total variation and for the case that the analysis operator is a frame. The bounds are particularly suitable when the sparsity of the analysis representation of the signal is not very small.
Recommendations
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Guarantees of total variation minimization for signal recovery
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
- Robust signal recovery for \(\ell_{1-2}\) minimization via prior support information
- Robust recovery of a kind of weighted l1-minimization without noise level
- Image recovery via total variation minimization and related problems
- Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements
- Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
- Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
Cites work
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Analysis versus synthesis in signal priors
- Compressed sensing with coherent and redundant dictionaries
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- Greedy-like algorithms for the cosparse analysis model
- Living on the edge: phase transitions in convex programs with random data
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Stable image reconstruction using total variation minimization
- The convex geometry of linear inverse problems
- The cosparse analysis model and algorithms
Cited in
(13)- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Robust recovery of a kind of weighted l1-minimization without noise level
- Sampling rates for \(\ell^1\)-synthesis
- Signal recovery from incomplete measurements in the presence of outliers
- Cosparsity in Compressed Sensing
- A note on the guarantees of total variation minimization
- Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
- Compressed sensing with 1D total variation: breaking sample complexity barriers via non-uniform recovery
- Stable image reconstruction using transformed total variation minimization
- Guarantees of total variation minimization for signal recovery
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Theory and fast learned solver for \(\ell^1\)-TV regularization
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
This page was built for publication: Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594564)
