Fast multidimensional nearest neighbor search algorithm using priority queue

Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

Volumn 164, Issue 3, 2008, Pages 69-77

  Ajioka, Shiro ^a   Tsuge, Satoru ^a   Shishibori, Masami ^a   Kita, Kenji ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

Fast linear search; High dimensional space; Multimedia information retrieval; Nearest neighbor search; Priority queue

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ARCHITECTURAL DESIGN; BOOLEAN FUNCTIONS; DECISION SUPPORT SYSTEMS; EVOLUTIONARY ALGORITHMS; FEATURE EXTRACTION; IMAGE RETRIEVAL; INFORMATION MANAGEMENT; INFORMATION SERVICES; KNOWLEDGE MANAGEMENT; LEARNING ALGORITHMS; MANAGEMENT INFORMATION SYSTEMS; NUMERICAL METHODS; PACKET SWITCHING; PATTERN RECOGNITION; SCHEDULING ALGORITHMS; SEARCH ENGINES; SPEECH RECOGNITION;

(2+1) DIMENSIONS; (2+1)-DIMENSIONAL; ARITHMETIC OPERATIONS; EFFICIENT ALGORITHMS; EFFICIENT SEARCH; EXPERIMENTAL RESULTS; HIGH DIMENSIONAL SPACES; HIGH DIMENSIONALITY; HIGH-DIMENSIONAL; LINEAR SEARCH; MULTI DIMENSIONAL VECTOR; MULTIDIMENSIONAL (MD); MULTIDIMENSIONAL SEARCH; MULTIMEDIA INFORMATION RETRIEVAL (MIR); NEAREST NEIGHBOR (NN) SEARCH; PAPER ADDRESSES; PRIORITY QUEUEING; SORTING METHODS;

ALGORITHMS;

EID: 44649102662     PISSN: 04247760     EISSN: 15206416     Source Type: Journal    
DOI: 10.1002/eej.20502     Document Type: Article

References (25)

1. Salton G, Wong A, Yang CS. A vector space model for automatic indexing. Commun ACM 1975;18:613-620.
2. Flickner M et al. Query by image and video content: The QBIC system. IEEE Computer 1995;28:23-32.
3. Pentland A, Picard R, Sclaroff S. Photobook: Content-based manipulation of image databases. Int J Computer Vision 1996;18:233-254.
4. Gaede V, Günther O. Multidimensional access methods. ACM Computing Surv 1998;30:170-231.
5. Guttman A. R-trees: A dynamic index structure for spatial searching. Proc ACM SIGMOD International Conference on Management of Data, p 47-57, 1984.
6. Sellis T, Roussopoulos N, Faloutsos C. The R+-tree: A dynamic index for multi-dimensional objects. Proc 12th International Conference on Very Large Data Bases, p 507-518, 1987.
7. Beckmann N, Kriegel HP, Schneider R, Seeger B. The R*-tree: An efficient and robust access method for points and rectangles. Proc ACM SIGMOD International Conference on Management of Data, p 322-331, 1990.
8. White DA, Jain R. Similarity indexing with the SS-tree. Proc 12th IEEE International Conference on Data Engineering, p 516-523, 1996.
9. Kurniawati R, Jin JS, Shepherd JA. The SS+-tree: An improved index structure for similarity searches in a high dimensional feature space. Proc SPIE: Storage and Retrieval for Image and Video Databases, p 110-120, 1997.
10. Jin JS. Indexing and retrieving high dimensional visual features. In Feng D, Siu WC, Zhang HJ (editors). Multimedia information retrieval and management. Springer; 2003.
11. Berchtold S, Keim DA, Kriegel HP. The X-tree: An index structure for high-dimensional data. Proc 22nd International Conference on Very Large Data Bases, p 28-39, 1996.
12. Katayama N, Satoh S. The SR-tree: An index structure for high-dimensional nearest neighbor queries. Proc ACM SIGMOD International Conference on Management of Data, p 369-380, 1997.
13. Yianilos PN. Data structures and algorithms for nearest neighbor search in general metric spaces. Proc Fourth ACM-SIAM Symposium on Discrete Algorithms, p311-321, 1993.
14. Bozkaya T, Özsoyoglu ZM. Indexing large metric spaces for similarity search queries. ACM Trans Database Syst 1999;24:361-404.
15. Ciaccia P, Patella M, Zezula P. M-tree: An efficient access method for similarity search in metric spaces. Proc 23rd International Conference on Very Large Data Bases (VLDB'97), p 426-435.
16. Aggarwal CC, Hinneburg A, Keim DA. On the surprising behavior of distance metrics in high dimensional space. Proc 8th International Conference on Database Theory, p 420-434, 2001.
17. Beyer KS, Goldstein J, Ramakrishnan R, Shaft U. When is "nearest neighbor" meaningful? Proc 7th International Conference on Database Theory, p 217-235, 1999.
18. Blott S, Weber R. A simple vector-approximation file for similarity in high-dimensional vector spaces. Tech Rep Nr. 19, ESPRIT project HERMES (No. 9141), 1997.
19. Sedgewick R. Algorithms. Addison-Wesley; 1988. (in Japanese)
20. Barnea DI, Silverman HF. A class of algorithms for fast digital image registration. IEEE Trans Computers 1972;21:179-186.
21. Hel-Or Y, Hel-Or H. Real time pattern matching using projection kernels. Proc Ninth IEEE International Conference on Computer Vision (ICCV03), p 1486-1493.
22. Takemoto K et al. Nearest neighbor classification for quad tree representations of binary images. Tech Rep IEICE PRMU 2003;103:1-6. (in Japanese)
23. Mount DM, Arya S. ANN: A library for approximate nearest neighbor searching version 1.1. http://www.cs.umd.edu/~mount/ANN/
24. Koizumi D, Tsuge S, Shishibori M, Kita K. Development of image keyword registration system for cross-media information retrieval between text and images. IPSJ Tech Rep, 2002. (in Japanese)
25. Koizumi D, Tsuge S, Shishibori M, Kita K. Development of WWW image retrieval system using the image knowledge database. FIT2003, p 31-32.