Dictionary evaluation and optimization for sparse coding based speech processing
From MaRDI portal
Publication:1749610
DOI10.1016/j.ins.2015.03.010zbMath1391.94235OpenAlexW2079710880MaRDI QIDQ1749610
Jiqing Han, Deyun Chen, Guanglu Sun, Yong-Jun He
Publication date: 17 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.03.010
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Atomic Decomposition by Basis Pursuit
- Morphological Component Analysis: An Adaptive Thresholding Strategy
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Uncertainty principles and ideal atomic decomposition
- Recursive Least Squares Dictionary Learning Algorithm
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Dictionary evaluation and optimization for sparse coding based speech processing