Greedy signal space methods for incoherence and beyond
From MaRDI portal
Publication:2347895
Abstract: Compressive sampling (CoSa) has provided many methods for signal recovery of signals compressible with respect to an orthonormal basis. However, modern applications have sparked the emergence of approaches for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary. Recently, several "signal-space" greedy methods have been proposed to address signal recovery in this setting. However, such methods inherently rely on the existence of fast and accurate projections which allow one to identify the most relevant atoms in a dictionary for any given signal, up to a very strict accuracy. When the dictionary is highly overcomplete, no such projections are currently known; the requirements on such projections do not even hold for incoherent or well-behaved dictionaries. In this work, we provide an alternate analysis for signal space greedy methods which enforce assumptions on these projections which hold in several settings including those when the dictionary is incoherent or structurally coherent. These results align more closely with traditional results in the standard CoSa literature and improve upon previous work in the signal space setting.
Recommendations
- Near oracle performance and block analysis of signal space greedy methods
- Signal Recovery on Incoherent Manifolds
- Signal separation under coherent dictionaries and _p-bounded noise
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Processing of sparse signals and mutual coherence of ``measurable vectors
- Sparsity and incoherence in compressive sampling
- Optimum and Suboptimum Space-Diversity Detection of Weak Signals in Non-Gaussian Noise
- On the sparsity of signals in a random sample
- Sparse representations of random signals
- Non-uniform random sampling and reconstruction in signal spaces with finite rate of innovation
Cites work
- Adaptive greedy approximations
- Analysis versus synthesis in signal priors
- Approximation-tolerant model-based compressive sensing
- Coherence pattern-guided compressive sensing with unresolved grids
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing with coherent and redundant dictionaries
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greedy-like algorithms for the cosparse analysis model
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Model-Based Compressive Sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Robust Sparse Analysis Regularization
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Spectral compressive sensing
- Stable image reconstruction using total variation minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The cosparse analysis model and algorithms
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Towards a Mathematical Theory of Super‐resolution
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
Cited in
(8)- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Near oracle performance and block analysis of signal space greedy methods
- Sparsity based methods for overparameterized variational problems
- Compressive sensing with redundant dictionaries and structured measurements
- Forward/backward spatial smoothing techniques for coherent signal identification
- Dictionary-sparse recovery via thresholding-based algorithms
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
- Sampling in the analysis transform domain
This page was built for publication: Greedy signal space methods for incoherence and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347895)
