An efficient algorithm for learning dictionary under coherence constraint

DOI10.1155/2016/5737381zbMath1400.94046OpenAlexW2476820244WikidataQ59131683 ScholiaQ59131683MaRDI QIDQ1793336

Huang Bai, Qianru Jiang, Sheng Li

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/5737381

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Unnamed Item
• Grassmannian frames with applications to coding and communication
• Dictionary-based image denoising by fused-lasso atom selection
• Greed is Good: Algorithmic Results for Sparse Approximation
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse and Redundant Representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Parametric Dictionary Design for Sparse Coding
• On Projection Matrix Optimization for Compressive Sensing Systems
• Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
• Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization