KFCE: a dictionary generation algorithm for sparse representation
From MaRDI portal
Publication:1032447
DOI10.1016/j.sigpro.2009.04.001zbMath1178.94157OpenAlexW2087363292MaRDI QIDQ1032447
Publication date: 26 October 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2009.04.001
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Multi-frame compression: theory and design.
- Atomic Decomposition by Basis Pursuit
- An affine scaling methodology for best basis selection
- Face Detection: A Survey
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Dictionary Learning Algorithms for Sparse Representation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Theory of Reproducing Kernels
This page was built for publication: KFCE: a dictionary generation algorithm for sparse representation