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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Scalability Issues in Fingerprinted Audio Searching | |
Autori: | ||
Data di pubblicazione: | 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. | |
Handle: | http://hdl.handle.net/11392/1379371 | |
Appare nelle tipologie: | 04.2 Contributi in atti di convegno (in Volume) |