Dictionary Learning for L1-Exact Sparse Coding

DOI10.1007/978-3-540-74494-8_51zbMath1173.94382OpenAlexW1492835675MaRDI QIDQ3608579

Mark D. Plumbley

Publication date: 5 March 2009

Published in: Independent Component Analysis and Signal Separation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74494-8_51

Mathematics Subject Classification ID

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

We Found 3 Related Items (max. 100)

Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Unnamed Item ⋮ On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD

Cites Work

• A simplified neuron model as a principal component analyzer
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Atomic Decomposition by Basis Pursuit
• Dictionary Learning Algorithms for Sparse Representation
• Independent Component Analysis and Blind Signal Separation
• Underdetermined blind source separation using sparse representations
• Unnamed Item

This page was built for publication: Dictionary Learning for L1-Exact Sparse Coding