Sampling in the analysis transform domain
From MaRDI portal
Abstract: Many signal and image processing applications have benefited remarkably from the fact that the underlying signals reside in a low dimensional subspace. One of the main models for such a low dimensionality is the sparsity one. Within this framework there are two main options for the sparse modeling: the synthesis and the analysis ones, where the first is considered the standard paradigm for which much more research has been dedicated. In it the signals are assumed to have a sparse representation under a given dictionary. On the other hand, in the analysis approach the sparsity is measured in the coefficients of the signal after applying a certain transformation, the analysis dictionary, on it. Though several algorithms with some theory have been developed for this framework, they are outnumbered by the ones proposed for the synthesis methodology. Given that the analysis dictionary is either a frame or the two dimensional finite difference operator, we propose a new sampling scheme for signals from the analysis model that allows to recover them from their samples using any existing algorithm from the synthesis model. The advantage of this new sampling strategy is that it makes the existing synthesis methods with their theory also available for signals from the analysis framework.
Recommendations
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization
- A mathematical introduction to compressive sensing
- A simple proof of the restricted isometry property for random matrices
- Adaptive greedy approximations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Analysis Operator Learning and its Application to Image Reconstruction
- Analysis versus synthesis in signal priors
- Approximation-tolerant model-based compressive sensing
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing with coherent and redundant dictionaries
- Decoding by Linear Programming
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Graph implementations for nonsmooth convex programs
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Matching pursuits with time-frequency dictionaries
- Model-Based Compressive Sensing
- Modern statistical estimation via oracle inequalities
- NESTA: A fast and accurate first-order method for sparse recovery
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Optimization with sparsity-inducing penalties
- Probing the Pareto frontier for basis pursuit solutions
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Robust Recovery of Signals From a Structured Union of Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Simultaneous analysis of Lasso and Dantzig selector
- Smoothing and Decomposition for Analysis Sparse Recovery
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable and Robust Sampling Strategies for Compressive Imaging
- Stable image reconstruction using total variation minimization
- Stable recovery of sparse overcomplete representations in the presence of noise
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The cosparse analysis model and algorithms
Cited in
(8)- Compressive sensing with redundant dictionaries and structured measurements
- Sampling for the V-line transform with vertex on a circle
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Analysis versus synthesis in signal priors
- Image reconstruction using analysis model prior
- The cosparse analysis model and algorithms
This page was built for publication: Sampling in the analysis transform domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900778)
