Principal component hashing: An accelerated approximate nearest neighbor search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5414 LNCS, Issue , 2009, Pages 374-385

  Matsushita, Yusuke ^a   Wada, Toshikazu ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

Approximate Nearest Neighbor Search; High dimensional space; P stable Locality Sensitive Hashing

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION MANAGEMENT; LEARNING ALGORITHMS; LEARNING SYSTEMS;

APPROXIMATE NEAREST NEIGHBOR SEARCH; APPROXIMATE NEAREST-NEIGHBOR SEARCHES; DATA DISTRIBUTIONS; HASH VALUES; HIGH DIMENSIONAL SPACE; MACHINE LEARNING APPLICATIONS; P-STABLE LOCALITY SENSITIVE HASHING; PRINCIPAL COMPONENTS; RELATIVE ERRORS; SEARCH ALGORITHMS;

IMAGE RETRIEVAL;

EID: 60149090867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92957-4_33     Document Type: Conference Paper

References (12)

1. Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory IT-13(1), 21-27 (1967)
2. Zhang, Z.: Iterative Point Matching for Registration of Free-Form Curves and Surfaces. Tech. Report INRIA, No 1658 (1992)
3. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975)
4. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM 45, 891-923 (1998)
5. ANN: Library for Approximate Nearest Neighbor Searching, http://www.cs.umd.edu/~mount/ANN/
6. Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 604-613 (May 1998)
7. Datar, M., Indyk, P., Immorlica, N., Mirrokni, V.: Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In: Proceedings of the 20th Annual Symposium on Computational Geometry (SCG 2004) (June 2004)
8. Andoni, A., Indyk, P.: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In: Proc. of FOCS 2006, pp. 459-468 (2006)
9. Vidal, R.: An algorithm for finding nearest neighbor in (approximately) constant average time. Pattern Recognition Letters 4, 145-158 (1986)
10. Mico, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbor approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognition Letters 15, 9-17 (1994)
11. Brin, S.: Near neighbor search in large metric spaces. In: Proc. of 21st Conf. on very large database (VLDB), Zurich, Switzerland, pp. 574-584 (1995)
12. Yianilos, P.Y.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of the Fourth Annual ACM-SIAM Symp. on Discrete Algorithms, Austin, TX, pp. 311-321 (1993)