Dictionary evaluation and optimization for sparse coding based speech processing
From MaRDI portal
Recommendations
- Sparse representations for speech recognition
- Sparse representation and performance analysis for LSP parameters via dictionary learning
- Efficient dictionary learning with sparseness-enforcing projections
- Dictionary Learning Algorithms for Sparse Representation
- An efficient algorithm for learning dictionary under coherence constraint
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A wavelet tour of signal processing. The sparse way.
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Atomic decomposition by basis pursuit
- Compressed sensing
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Matching pursuits with time-frequency dictionaries
- Morphological Component Analysis: An Adaptive Thresholding Strategy
- Recursive Least Squares Dictionary Learning Algorithm
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse Approximate Solutions to Linear Systems
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable signal recovery from incomplete and inaccurate measurements
- Uncertainty principles and ideal atomic decomposition
Cited in
(3)
This page was built for publication: Dictionary evaluation and optimization for sparse coding based speech processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749610)