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
(65)- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- Maximal solutions of sparse analysis regularization
- On inexact ADMMs with relative error criteria
- Inpainting via high-dimensional universal shearlet systems
- Learning sparse FRAME models for natural image patterns
- A bimodal co-sparse analysis model for image processing
- The generalized Lasso problem and uniqueness
- Block-based refitting in \(\ell_{12}\) sparse regularization
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Iterative hard thresholding for compressed data separation
- Analysis non-sparse recovery for relaxed ALASSO
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- Analysis of inpainting via clustered sparsity and microlocal analysis
- Local behavior of sparse analysis regularization: applications to risk estimation
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Greedy signal space methods for incoherence and beyond
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Greedy-like algorithms for the cosparse analysis model
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems
- Low complexity regularization of linear inverse problems
- Image recovery via geometrically structured approximation
- Theory and applications of compressed sensing
- Sparsity and nullity: paradigms for analysis dictionary learning
- Sparsity based methods for overparameterized variational problems
- Compressive sensing with redundant dictionaries and structured measurements
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- Compressive sensing in acoustic imaging
- Cosparsity in Compressed Sensing
- Discriminative sparse representations
- Dual principal component pursuit
- Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization
- Guarantees of total variation minimization for signal recovery
- Model selection with low complexity priors
- Optimal compressive imaging of Fourier data
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Multi-layer sparse coding: the holistic way
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Dimensionality reduction with subgaussian matrices: a unified theory
- Persistent homology for low-complexity models
- Image reconstruction using analysis model prior
- Analysis versus synthesis in signal priors
- Dualizable shearlet frames and sparse approximation
- An introduction to continuous optimization for imaging
- Approximate first-order primal-dual algorithms for saddle point problems
- Bilevel Methods for Image Reconstruction
- Compressed data separation via unconstrained l1-split analysis
- Dictionary-sparse recovery via thresholding-based algorithms
- Star DGT: a robust Gabor transform for speech denoising
- Sampling rates for ^1-synthesis
- The Geometry of Sparse Analysis Regularization
- Cardinality minimization, constraints, and regularization: a survey
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
- Compressed sensing with frames and sparsity in levels class
- Generalization analysis of an unfolding network for analysis-based compressed sensing
- Sparse signal recovery from phaseless measurements via _1² - _2² minimization
- A null space analysis of the _1-synthesis method in dictionary-based compressed sensing
- Sampling in the analysis transform domain
- Analysis _1-recovery with frames and Gaussian measurements
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)
