Dictionary Learning for Sparse Approximations With the Majorization Method

DOI10.1109/TSP.2009.2016257zbMath1391.94456MaRDI QIDQ4569698

Mehrdad Yaghoobi, Thomas Blumensath, Michael E. Davies

Publication date: 9 July 2018

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

Mathematics Subject Classification ID

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

Related Items

Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging ⋮ FRIST—flipping and rotation invariant sparsifying transform learning and applications ⋮ A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators ⋮ Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Structured overcomplete sparsifying transform learning with convergence guarantees and applications ⋮ On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD ⋮ Optimal dictionary for least squares representation

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