This paper discusses important scalability issues exhibited by the high-dimensional, automatic audio recognition problem. The emphasis is especially put on a well-known, robust fingerprint algorithm. Extensive tests on a very large database show the importance of the parametrization of the algorithm, in order to afford an efficient search strategy. We also quantitatively verify the capital attention that should be devoted to the caching issue, in order to avoid disk access as much as possible. Comparisons and insights are provided also with the respect to the bruteforce approach.

Scalability Issues in Fingerprinted Audio Searching

BELLETTINI, Carlo;MAZZINI, Gianluca
2009

Abstract

This paper discusses important scalability issues exhibited by the high-dimensional, automatic audio recognition problem. The emphasis is especially put on a well-known, robust fingerprint algorithm. Extensive tests on a very large database show the importance of the parametrization of the algorithm, in order to afford an efficient search strategy. We also quantitatively verify the capital attention that should be devoted to the caching issue, in order to avoid disk access as much as possible. Comparisons and insights are provided also with the respect to the bruteforce approach.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11392/1379371
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact