A modified greedy analysis pursuit algorithm for the cosparse analysis model

DOI10.1007/S11075-016-0174-ZzbMATH Open1402.94030OpenAlexW2476121399MaRDI QIDQ513670FDOQ513670

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

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

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

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)

Cites Work

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

Cited In (1)

• Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem

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)