Loading menu…

Fast Dictionary Learning for Sparse Representations of Speech Signals

§ Kingas College London, London, U.K

Send Message

To: Author

Fast Dictionary Learning for Sparse Representations of Speech Signals

Article Fingerprint

ReserarchID

CSTNWS92JS3

Fast Dictionary Learning for Sparse Representations of Speech Signals Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

For dictionary-based decompositions of certain types, it has been observed that there might be a link between sparsity in the dictionary and sparsity in the decomposition. Sparsity in the dictionary has also been associated with the derivation of fast and efficient dictionary learning algorithms. Therefore, in this paper we present a greedy adaptive dictionary learning algorithm that sets out to find sparse atoms for speech signals. The algorithm learns the dictionary atoms on data frames taken from a speech signal. It iteratively extracts the data frame with minimum sparsity index, and adds this to the dictionary matrix. The contribution of this atom to the data frames is then removed, and the process is repeated. The algorithm is found to yield a sparse signal decomposition, supporting the hypothesis of a link between sparsity in the decomposition and dictionary. The algorithm is applied to the problem of speech representation and speech denoising, and its performance is compared to other existing methods.

References

29 Cites in Article
  1. 1. P Földiák (1990). Forming sparse representations by local anti-Hebbian learning. Biolog. Cybern, 64, 165-170.
  2. 2. B Olshausen,D Field (1996). Emergence of simplecell receptive field properties by learning a sparse code for natural images. Nature, 381, 607-609.
  3. 3. T Shan,L Jiao (2005). New evidences for sparse coding strategy employed in visual neurons: From the image processing and nonlinear approximation viewpoint. Proc. Eur. Symp. Artif. Neural Netw. (ESANN), 441-446.
  4. 4. Michael Zibulevsky,Barak Pearlmutter (2001). Blind Source Separation by Sparse Decomposition in a Signal Dictionary. Neural Computation, 13(4), 863-882.
  5. 5. Ö Yilmaz,S Rickard (2004). Blind separation of speech mixtures via time-frequency masking. IEEE Trans. Signal Process, 52(7), 1830-1847.
  6. 6. R (2002). Sparse decomposition of stereo signals with Matching Pursuit and application to blind separation of more than two sources from a stereo mixture. IEEE International Conference on Acoustics Speech and Signal Processing, 3, III-3057-III-3060.
  7. 7. M Elad,M Aharon (2006). Image denoising via sparse redundant representations over learned dictionaries. IEEE Trans. Image Process, 15(12), 3736-3745.
  8. 8. R Gribonval,K Schnass (2008). Some recovery conditions for basis learning by L1-minimization. Proc. Int. Symp. Commun., Control, Signal Process, 768-733.
  9. 9. L Rebollo-Neira (2004). Dictionary redundancy elimination. IEE Proc.-Vis., Image, Signal Process, 151, 31-34.
  10. 10. Michael Lewicki,Terrence Sejnowski (2000). Learning Overcomplete Representations. Neural Computation, 12(2), 337-365.
  11. 11. Irina Gorodnitsky,John George,Bhaskar Rao (1995). Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm. Electroencephalography and Clinical Neurophysiology, 95(4), 231-251.
  12. 12. M Aharon,M Elad,A Bruckstein (2006). K-SVD: An algorithm for designing overcomplete dictionaries for sparse representations. IEEE Trans. Signal Process, 54(11), 4311-4322.
  13. 13. Mark Plumbley (2007). Dictionary Learning for L1-Exact Sparse Coding. Lecture Notes in Computer Science, 406-413.
  14. 14. J Mairal,F Bach,J Ponce,G Sapiro (2009). Online dictionary learning for sparse coding. Proc. Int. Conf. Mach. Learn. (ICML), 382, 689-696.
  15. 15. R Rubinstein,M Zibulevsky,M Elad (2010). Double sparsity: Learning sparse dictionaries for sparse signal approximation. IEEE Trans. Signal Process, 58(3), 1553-1564.
  16. 16. Maria Jafari,Emmanuel Vincent,Samer Abdallah,Mark Plumbley,Mike Davies (2008). An adaptive stereo basis method for convolutive blind audio source separation. Neurocomputing, 71(10-12), 2087-2097.
  17. 17. S Abdallah,M Plumbley (2001). If edges are the independent components of natural images, what are the independent components of natural sounds?. Proc. Int. Conf. Ind. Compon. Anal. Blind Signal Separat. (ICA), 534-539.
  18. 18. M Goodwin,M Vetterli (1999). Matching pursuit and atomic signal models based on recursive filter banks. IEEE Transactions on Signal Processing, 47(7), 1890-1902.
  19. 19. V Tan,C Févotte (2005). A study of the effect of source sparsity for various transforms on blind audio source separation performance. Proc. Workshop Signal Process. With Adapt. Sparse Structured Represent
  20. 20. Maria Jafari,Mark Plumbley (2008). An adaptive orthogonal sparsifying transform for speech signals. 2008 3rd International Symposium on Communications, Control and Signal Processing, 786-790.
  21. 21. S Mallat,Z Zhang (1993). Matching pursuit with timefrequency dictionaries. IEEE Trans. Signal Process, 41(12), 3397-3415.
  22. 22. S Mallat,G Davis,Z Zhang (1994). Adaptive timefrequency decompositions. SPIE J. Opt. Eng, 33, 2183-2191.
  23. 23. S Haykin (1999). Neural Networks: A Comprehensive Foundation. Neural Networks: A Comprehensive Foundation
  24. 24. Frederic Font (2021). SOURCE: a Freesound Community Music Sampler. Audio Mostly 2021, 182-187.
  25. 25. R Rubinstein Unknown Title.
  26. 26. S Valiollahzadeh,H Firouzi,M Babaie-Zadeh,C Jutten (2009). Image denoising using sparse representations. Proc. Int. Conf. Ind. Compon. Anal. Signal Separat. (ICA), 557-564.
  27. 27. A Hyvaerinen,J Karhunen,E Oja (2000). Independent Component Analysis. Independent Component Analysis
  28. 28. N Hurley,S Rickard (2009). Comparing measures of sparsity. IEEE Trans. Inf. Theory, 55(10), 4723-4741.
  29. 29. W Kleijn (1993). Encoding speech using prototype waveforms. IEEE Transactions on Speech and Audio Processing, 1(4), 386-399.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Bharathi. 2014. "Fast Dictionary Learning for Sparse Representations of Speech Signals". Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 14 (GJCST Volume 14 Issue E8).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-E Classification I.2.6
Version of record
v1.2

Issue date
December 30, 2014

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 3.1K
Total Downloads: 191
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Fast Dictionary Learning for Sparse Representations of Speech Signals

Bharathi
Bharathi Kingas College London, London, U.K