Audio Signal Representations for Factorization in the sparse domain

Abstract :

In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that they are both sparse and approximately shift-invariant, which allows similarity search in a sparse domain. The common sparse support of detected similar patterns is then used to factorize their representations. The potential of this method for simultaneous structural analysis and compressing tasks is illustrated by preliminary experiments on simple musical data.

Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-imt.archives-ouvertes.fr/hal-00696188
Contributor : Admin Télécom Paristech <>
Submitted on : Friday, May 11, 2012 - 10:54:53 AM
Last modification on : Thursday, July 4, 2019 - 11:00:03 AM
Long-term archiving on : Sunday, August 12, 2012 - 2:22:24 AM

File

icassp11_moussallam_final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00696188, version 1

Citation

Manuel Moussallam, L. Daudet, G. Richard. Audio Signal Representations for Factorization in the sparse domain. ICASSP, May 2011, Prague, Czech Republic. pp.513-516. ⟨hal-00696188⟩

Share

Metrics

Record views

258

Files downloads

164