The cosparse analysis model and algorithms
From MaRDI portal
Abstract: After a decade of extensive study of the sparse representation synthesis model, we can safely say that this is a mature and stable field, with clear theoretical foundations, and appealing applications. Alongside this approach, there is an analysis counterpart model, which, despite its similarity to the synthesis alternative, is markedly different. Surprisingly, the analysis model did not get a similar attention, and its understanding today is shallow and partial. In this paper we take a closer look at the analysis approach, better define it as a generative model for signals, and contrast it with the synthesis one. This work proposes effective pursuit methods that aim to solve inverse problems regularized with the analysis-model prior, accompanied by a preliminary theoretical study of their performance. We demonstrate the effectiveness of the analysis model in several experiments.
Recommendations
Cited in
(63)- Theory and applications of compressed sensing
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Maximal solutions of sparse analysis regularization
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- Local behavior of sparse analysis regularization: applications to risk estimation
- Compressive sensing with redundant dictionaries and structured measurements
- Multi-layer sparse coding: the holistic way
- Dual principal component pursuit
- Sparsity based methods for overparameterized variational problems
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Learning sparse FRAME models for natural image patterns
- Image recovery via geometrically structured approximation
- Cosparsity in Compressed Sensing
- Sampling in the analysis transform domain
- Greedy-like algorithms for the cosparse analysis model
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- Block-based refitting in \(\ell_{12}\) sparse regularization
- The generalized Lasso problem and uniqueness
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- Persistent homology for low-complexity models
- An introduction to continuous optimization for imaging
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Optimal compressive imaging of Fourier data
- Compressive sensing in acoustic imaging
- Dictionary-sparse recovery via thresholding-based algorithms
- Bilevel Methods for Image Reconstruction
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- Model selection with low complexity priors
- Greedy signal space methods for incoherence and beyond
- The Geometry of Sparse Analysis Regularization
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- On inexact ADMMs with relative error criteria
- Iterative hard thresholding for compressed data separation
- Analysis non-sparse recovery for relaxed ALASSO
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Analysis versus synthesis in signal priors
- Image reconstruction using analysis model prior
- A bimodal co-sparse analysis model for image processing
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Low complexity regularization of linear inverse problems
- NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems
- Guarantees of total variation minimization for signal recovery
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Dimensionality reduction with subgaussian matrices: a unified theory
- Dualizable shearlet frames and sparse approximation
- Inpainting via high-dimensional universal shearlet systems
- Sparsity and nullity: paradigms for analysis dictionary learning
- Approximate first-order primal-dual algorithms for saddle point problems
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization
- Analysis of inpainting via clustered sparsity and microlocal analysis
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- Sampling rates for \(\ell^1\)-synthesis
- Cardinality minimization, constraints, and regularization: a survey
- Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Compressed data separation via unconstrained l1-split analysis
- Discriminative sparse representations
- Compressed sensing with frames and sparsity in levels class
- Star DGT: a robust Gabor transform for speech denoising
This page was built for publication: The cosparse analysis model and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762317)
