Dictionary Learning for Sparse Approximations With the Majorization Method

DOI10.1109/TSP.2009.2016257MaRDI QIDQ4569698zbMATHFDO

Authors Mehrdad Yaghoobi, Thomas Blumensath, M. E. Davies

Publication date 9 July 2018

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(13)

• Optimal dictionary for least squares representation
• A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators
• FRIST-flipping and rotation invariant sparsifying transform learning and applications
• Convergence radius and sample complexity of ITKM algorithms for dictionary learning
• Dictionary Learning for L1-Exact Sparse Coding
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
• Sparse and Spurious: Dictionary Learning With Noise and Outliers
• Structured overcomplete sparsifying transform learning with convergence guarantees and applications
• A tree-based dictionary learning framework
• An MDL Framework for Sparse Coding and Dictionary Learning
• Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
• Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
• An improved analysis of the ER-SpUD dictionary learning algorithm

This page was built for publication: Dictionary Learning for Sparse Approximations With the Majorization Method

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