Audio fingerprinting: Nearest neighbor search in high dimensional binary spaces

Proceedings of 2002 IEEE Workshop on Multimedia Signal Processing, MMSP 2002

Volumn , Issue , 2002, Pages 182-185

  Miller, Matthew L ^a   Rodriguez, Manuel Acevedo ^b   Cox, Ingemar J ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b EPFL   (Switzerland)

^c EURECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING ALGORITHMS; MULTIMEDIA SIGNAL PROCESSING; SIGNAL PROCESSING;

AUDIO FINGERPRINTING; BINARY REPRESENTATIONS; CURSE OF DIMENSIONALITY; HIGH-DIMENSIONAL; MEMORY COST; PROBABILISTIC SEARCH ALGORITHMS; RESEARCH FIELDS; SEARCH ALGORITHMS;

NEAREST NEIGHBOR SEARCH;

EID: 84942249318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MMSP.2002.1203277     Document Type: Conference Paper

References (5)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions./. of the ACM, 45(6):891-923, 1998
2. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing (be curse of dimensionality. In Proc. of the 30th annual ACM Symp. on Theory of Computing, pages 604-613, 1998
3. T. Kalker. Persona] communication, 2002
4. J, M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions. In Ptoc. of the 29th annual ACM Symp. on Theory of Computing, pages 599-608, 1997
5. P. N. Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. In Proc. of the 11th annual ACM-SIAM Symp, on Discrete Algorithms, pages 361-370, 2000