Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model

DOI10.1109/TSP.2012.2226445MaRDI QIDQ4578387zbMATH OpenOpenAlexWikidataFDO

Authors Ron Rubinstein, Tomer Peleg, Michael Elad

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2012.2226445

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Sparsity and nullity: paradigms for analysis dictionary learning
• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Analysis SimCO Algorithms for Sparse Analysis Model Based Dictionary Learning
• Sparse representation and performance analysis for LSP parameters via dictionary learning
• Analysis of fast structured dictionary learning
• Dictionary Learning Algorithms for Sparse Representation
• A max-margin dictionary learning algorithm for sparse representation
• Low-rank and sparse dictionary learning
• Dictionary Learning for Sparse Approximations With the Majorization Method
• Frame-Based Sparse Analysis and Synthesis Signal Representations and Parseval K-SVD

Cited in

(28)

• KFCE: a dictionary generation algorithm for sparse representation
• Poissonian image deconvolution via sparse and redundant representations and framelet regularization
• A novel model and ADMM algorithm for MR image reconstruction
• Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
• An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
• A bimodal co-sparse analysis model for image processing
• Image deblurring with coupled dictionary learning
• Manifold optimization-based analysis dictionary learning with an \(\ell_{1/2}\)-norm regularizer
• Adapting total generalized variation for blind image restoration
• Greedy-like algorithms for the cosparse analysis model
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• Sparsity and nullity: paradigms for analysis dictionary learning
• Cosparsity in Compressed Sensing
• Discriminative sparse representations
• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• An improved analysis of the ER-SpUD dictionary learning algorithm
• Multi-layer sparse coding: the holistic way
• A tree-based dictionary learning framework
• Image reconstruction using analysis model prior
• Learning overcomplete, low coherence dictionaries with linear inference
• Image denoising with generalized Gaussian mixture model patch priors
• A Novel Safety Assessment Approach Based on Evolutionary Clustering Learning
• Nonconvex \(L_{1/2}\)-regularized nonlocal self-similarity denoiser for compressive sensing based CT reconstruction
• Learning sparsity-promoting regularizers using bilevel optimization
• Deep block proximal linearized minimization algorithm for nonconvex inverse problems
• On minimal smallest singular value of subframes for signal recovery
• Decentralized Byzantine-resilient dictionary learning
• Dip-based anisotropic total variation regularization for image denoising

This page was built for publication: Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model

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