A modified greedy analysis pursuit algorithm for the cosparse analysis model

DOI10.1007/S11075-016-0174-ZMaRDI QIDQ513670zbMATH OpenOpenAlexFDO

Authors Zisheng Liu, Jicheng Li, Wenbo Li, Ping-Fan Dai

Publication date 7 March 2017

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-016-0174-z

zbMATH Keywords

inverse problemnon-convex optimizationsparse representationcosparse analysis modelgreedy analysis pursuit algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Greedy-like algorithms for the cosparse analysis model
• The cosparse analysis model and algorithms
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• Sampling in the analysis transform domain
• Fast sparse reconstruction: Greedy inverse scale space flows

Cites work

• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Theory for Sampling Signals From a Union of Subspaces
• A general branch-and-bound algorithm for fair division problems
• A generalized forward-backward splitting
• A wavelet tour of signal processing. The sparse way.
• Analysis versus synthesis in signal priors
• Atomic Decomposition by Basis Pursuit
• Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
• Compressed sensing with coherent and redundant dictionaries
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Greed is Good: Algorithmic Results for Sparse Approximation
• Greedy-like algorithms for the cosparse analysis model
• Just relax: convex programming methods for identifying sparse signals in noise
• L 1/2 regularization
• Local behavior of sparse analysis regularization: applications to risk estimation
• Matching pursuits with time-frequency dictionaries
• Multi-frame compression: theory and design.
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Online learning for matrix factorization and sparse coding
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
• Restricted isometry properties and nonconvex compressive sensing
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
• Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• Sparse representations in unions of bases
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Split Bregman methods and frame based image restoration
• 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

(4)

• Greedy-like algorithms for the cosparse analysis model
• Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
• Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
• The cosparse analysis model and algorithms

Describes a project that uses

Uses Software

• CVX
• PDCO

This page was built for publication: A modified greedy analysis pursuit algorithm for the cosparse analysis model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513670)