A simple algorithm for nearest neighbor search in high dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 19, Issue 9, 1997, Pages 989-1003

  Nene, Sameer A ^a   Nayar, Shree K ^a  

^a Columbia University ^*  (United States)

Author keywords

Benchmarks; Hardware architecture; Nearest neighbor; Object recognition; Pattern classification; Searching by slicing; Visual correspondence

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER VISION; DATA STRUCTURES; OBJECT RECOGNITION;

HARDWARE SEARCH ENGINE; NEAREST NEIGHBOR SEARCH; PROJECTION SEARCH;

PATTERN RECOGNITION;

EID: 0031238245     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.615448     Document Type: Article

References (40)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. S. Arya, Nearest Neighbor Searching and Applications," no. CSTR-3490, Univ. of Maryland, June 1995.
3. F. Aurenhammer, Voronoi Diagrams-A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, Sept. 1991.
4. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, The RTree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, pp. 322-331, Atlantic City, NJ, May 1990.
5. J.L. Bentley, Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, Sept. 1975.
6. J.L. Bentley, Multidimensional Binary Search Trees in Database Applications," JEEE Trans. Software Engineering, vol. 5, no. 4, pp. 333-340, July 1979.
7. J.L. Bentley and B.W. Weide, Optimal Expected-Time Algorithms for Closest Point Problems," ACM Trans. Mathematical Software, vol. 6, no. 4, pp. 563-580, Dec. 1980.
8. J.L. Bentley, Multidimensional Divide-and-Conquer, Comm. ACM, vol. 23, no. 4, pp. 214-229, Apr. 1980.
9. A. Califano and R. Mohan, Multidimensional Indexing for Recognizing Visual Shapes," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 28-34, June 1991.
10. K. L. Clarkson, A Randomized Algorithm for Closest-Point Queries," SIAM }. Computing, vol. 17, no. 4, pp. 830-847, Aug. 1988.
11. D. Dobkin and R.J. Lipton, Multidimensional Searching Problems," SIAM }. Computing, vol. 5, no. 2, pp. 181-186, June 1976.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry. BerlinHeidelberg: Springer, 1987.
13. A. Farago, T. Linder, and G. Lubosi, Fast Nearest-Neighbor Search in Dissimilarity Spaces," JEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 957-962, Sept. 1993.
14. J.H. Friedman, F. Baskett, and L.J. Shustek, An Algorithm for Finding Nearest Neighbors," JEEE Trans. Computers, pp. 1,0001,006, Oct. 1975.
15. J.H. Friedman, J.L. Bentley, and R.A. Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time," ACM Trans. Mathematical Software, vol. 3, no. 3, pp. 209-226, Sept. 1977.
16. K. Fukunaga and P. M. Narendra, A Branch and Bound Algorithm for Computing k-Nearest Neighbors," JEEE Trans. Computers, pp. 750-753, July 1975.
17. I. Gargantini, An Effective Way to Represent Quadtrees," Comm. ACM, vol. 25, no. 12, pp. 905-910, Dec. 1982.
18. A. Guttman, R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, June 1984.
19. E. Horowitz and S. Sahni, Fundamentals of Data Structures, 2nd ed. Rockville, Md.: Computer Science Press, 1987.
20. V. Klee, On the Complexity of d-Dimensional Voronoi Diagrams," Arch. Math, vol. 34, pp. 75-80,1980.
21. D.E. Knuth, Sorting and Searching," The Art of Computer Programming, vol. 3. Reading, Mass.: Addison-Wesley, 1973.
22. D.B. Lomet and B. Salzberg, The hb-Tree: A Multiattribute Indexing Method With Good Guaranteed Performance," Proc. ACM TODS, vol. 15, no. 4, pp. 625-658, Dec. 1990.
23. M.L. Mico, J. Oncina, and E. Vidai, A New Version of the Nearest-Neighbor Approximating and Eliminating Search Algorithm (AESA) With Linear Preprocessing Time and Memory Requirements," Pattern Recognition Letters, no. 15, pp. 9-17,1994.
24. H. Murase and S.K. Nayar, Visual Learning and Recognition of 3D Objects From Appearance," Int'l ]. Computer Vision, vol. 14, no. 1, pp. 5-24, Jan. 1995.
25. S.K. Nayar, S. Baker, and H. Murase, Parametric Feature Detection," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition (CVPR), pp. 471-477, San Francisco, Calif., June 1996.
26. S.K. Nayar, H. Murase, and S.A. Nene, Learning, Positioning, and Tracking Visual Appearance," Proc. IEEE Int'l Conf. Robotics and Automation, San Diego, Calif., May 1994.
27. S.K. Nayar, S.A. Nene, and H. Murase, Real-Time 100 Object Recognition System," Proc. IEEE Int'l Conf. Robotics and Automation, Twin Cities, May 1996.
28. S.A. Nene and S.K. Nayar, SLAM: A Software Library for Appearance Matching," Proc. ARPA Image Understanding Workshop, Monterey, Calif., Nov. 1994. Also Technical Report CUCS-019-94.
29. A.N. Netravali, Digital Pictures: Representation, Compression, and Standards, 2nd ed. New York: Plenum Press, 1995.
30. E.G.M. Petrakis and C. Faloutsos, Similarity Searching in Large Image Databases," Technical Report CS-TR-3388, Dept. Computer Science, Univ. of Maryland, Dec. 1994.
31. P.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. New York: Springer, 1985.
32. W.H. Press, S. A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, 2nd ed. Cambridge Univ. Press, 1992.
33. T. Robinson, The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes," Proc. ACM SIGMOD, pp. 10-18, 1981.
34. N. Roussopoulos and D. Leifker, Direct Spatial Search on Pictorial Databases Using Packed R-Trees," Proc. ACM SIGMOD, May 1985.
35. T. Sellis, N. Roussopoulos, and C. Faloutsos, The R+-Tree: A Dynamic Index for Multidimensional Objects, Proc. 13th Int'l Conf. VIDE, pp. 507-518, Sept. 1987.
36. R.F. Sproull, Refinements to Nearest-Neighbor Searching in kDimensional Trees," Algorithmica, vol. 6, pp. 579-589,1991.
37. J.M. Vilar, Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm," Information Processing Letters, 1996.
38. H. Wolfson, Model-Based Object Recognition by Geometric Hashing," Proc. First European Conf. Comp. Vision, pp. 526-536, Apr. 1990.
39. P.N. Yianilos, Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces," Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 311-321,1993.
40. T.P. Yunck, A Technique to Identify Nearest Neighbors," JEEE Trans. Systems, Man, and Cybernetics, vol. 6, no. 10, pp. 678-683, Oct. 1976.