Sampling in the analysis transform domain
From MaRDI portal
Publication:900778
DOI10.1016/J.ACHA.2015.04.004zbMATH Open1330.94026arXiv1410.6558OpenAlexW2963201836MaRDI QIDQ900778FDOQ900778
Authors: Raja Giryes 
Publication date: 22 December 2015
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1410.6558
Recommendations
Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Cites Work
- NESTA: A fast and accurate first-order method for sparse recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Probing the Pareto frontier for basis pursuit solutions
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- A simple proof of the restricted isometry property for random matrices
- Sparse and redundant representations. From theory to applications in signal and image processing.
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Sparse Reconstruction by Separable Approximation
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Stable image reconstruction using total variation minimization
- Optimization with sparsity-inducing penalties
- Graph implementations for nonsmooth convex programs
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- A mathematical introduction to compressive sensing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Adaptive greedy approximations
- Stable and Robust Sampling Strategies for Compressive Imaging
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- The cosparse analysis model and algorithms
- Compressed Sensing and Redundant Dictionaries
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Analysis versus synthesis in signal priors
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Model-Based Compressive Sensing
- Compressed sensing with coherent and redundant dictionaries
- Hard thresholding pursuit: an algorithm for compressive sensing
- Robust Recovery of Signals From a Structured Union of Subspaces
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- Modern statistical estimation via oracle inequalities
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Greedy-like algorithms for the cosparse analysis model
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Greedy signal space methods for incoherence and beyond
- A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization
- Smoothing and Decomposition for Analysis Sparse Recovery
- Analysis Operator Learning and its Application to Image Reconstruction
- Approximation-tolerant model-based compressive sensing
Cited In (8)
- Sampling for the V-line transform with vertex on a circle
- Analysis versus synthesis in signal priors
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- The cosparse analysis model and algorithms
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
- Compressive sensing with redundant dictionaries and structured measurements
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Image reconstruction using analysis model prior
Uses Software
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)
