How sparsely can a signal be approximated while keeping its class identity?

Manuel Moussallam, Thomas Fillon, Gaël Richard, Laurent Daudet

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper explores the degree of sparsity of a signal approximation that can be reached while ensuring that a sufficient amount of information is retained, so that its main characteristics remains. Here, sparse approximations are obtained by decomposing the signals on an overcomplete dictionary of multiscale time-frequency "atoms". The resulting representation is highly dependent on the choice of dictionary, decomposition algorithm and depth of the decomposition. The class identity is measured by indirect means as the speech/music discrimination power of features derived from the sparse representation compared to those of classical PCM-based features. Evaluation is performed on French Broadcast TV and Radio recordings from the QUAERO project database with two different statistical classifiers.

Original languageEnglish
Title of host publicationMML'10 - Proceedings of the 3rd ACM International Workshop on Machine Learning and Music, Co-located with ACM Multimedia 2010
Pages25-28
Number of pages4
DOIs
Publication statusPublished - 1 Dec 2010
Externally publishedYes
Event3rd ACM International Workshop on Machine Learning and Music, MML'10, Co-located with ACM Multimedia 2010 - Firenze, Italy
Duration: 25 Oct 201025 Oct 2010

Publication series

NameMML'10 - Proceedings of the 3rd ACM International Workshop on Machine Learning and Music, Co-located with ACM Multimedia 2010

Conference

Conference3rd ACM International Workshop on Machine Learning and Music, MML'10, Co-located with ACM Multimedia 2010
Country/TerritoryItaly
CityFirenze
Period25/10/1025/10/10

Keywords

  • Algorithms
  • Experimentation

Fingerprint

Dive into the research topics of 'How sparsely can a signal be approximated while keeping its class identity?'. Together they form a unique fingerprint.

Cite this