@inproceedings{2b077782c77942538b53ce2b21966ed8,
title = "How sparsely can a signal be approximated while keeping its class identity?",
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.",
keywords = "Algorithms, Experimentation",
author = "Manuel Moussallam and Thomas Fillon and Ga{\"e}l Richard and Laurent Daudet",
year = "2010",
month = dec,
day = "1",
doi = "10.1145/1878003.1878012",
language = "English",
isbn = "9781450301619",
series = "MML'10 - Proceedings of the 3rd ACM International Workshop on Machine Learning and Music, Co-located with ACM Multimedia 2010",
pages = "25--28",
booktitle = "MML'10 - Proceedings of the 3rd ACM International Workshop on Machine Learning and Music, Co-located with ACM Multimedia 2010",
note = "3rd ACM International Workshop on Machine Learning and Music, MML'10, Co-located with ACM Multimedia 2010 ; Conference date: 25-10-2010 Through 25-10-2010",
}