Optimizing kd-trees for scalable visual descriptor indexing

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 3392-3399

  Jia, You ^a   Wang, Jingdong ^b   Zeng, Gang ^a   Zha, Hongbin ^a   Hua, Xian Sheng ^b  

^a Peking University   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SPACE PARTITIONING; COORDINATE AXES; DESCRIPTORS; DISTANCE COMPUTATION; IMAGE SEARCH; INDEXING METHODS; INTERNAL NODES; K-D TREE; NEAREST NEIGHBOR SEARCH; QUERY POINTS; SCALE-UP; SIFT FEATURE; SPACE PARTITIONING; TIME COST; TREE CONSTRUCTION; VISION APPLICATIONS;

COMPUTER VISION; IMAGE RETRIEVAL; INDEXING (OF INFORMATION); OPTIMIZATION;

BINARY TREES;

EID: 77955990235     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540006     Document Type: Conference Paper

References (31)

1. S. Arya and D. M. Mount. Algorithms for fast vector quantizaton. In Data Compression Conference, pages 381-390, 1993.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891-923, 1998.
3. J. S. Beis and D. G. Lowe. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In CVPR, pages 1000-1006, 1997.
4. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
5. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33(3):322-373, 2001.
6. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
7. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984.
8. M. Brown and D. G. Lowe. Recognising panoramas. In ICCV, pages 1218-1227, 2003.
9. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry, pages 253-262, 2004.
10. M. de Berg, T. Eindhoven, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2008.
11. L. Fei-Fei, R. Fergus, and P. Perona. Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In CVPR 2004 Workshop on Generative-Model Based Vision, 2004.
12. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3(3):209-226, 1977.
13. G. Hua, M. Brown, and S. A. J. Winder. Discriminant embedding for local image descriptors. In ICCV, pages 1-8, 2007.
14. P. Jain, B. Kulis, and K. Grauman. Fast image search for learned metrics. In CVPR, 2008.
15. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
16. N. Kumar, L. Zhang, and S. K. Nayar. What is a good nearest neighbors algorithm for finding similar patches in images? In ECCV (2), pages 364-378, 2008.
17. T. Liu, A. W. Moore, A. G. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In NIPS, 2004.
18. D. G. Lowe. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60(2):91-110, 2004.
19. J. D. MacDonald and K. S. Booth. Heuristics for ray tracing using space subdivision. The Visual Computer, 6(3):153-166, 1990.
20. J. McNames. A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans. Pattern Anal. Mach. Intell., 23(9):964-976, 2001.
21. K. Mikolajczyk and J. Matas. Improving descriptors for fast tree matching by optimal linear projection. In ICCV, pages 1-8, 2007.
22. A. W. Moore. The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In UAI, pages 397-405, 2000.
23. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISSAPP (1), pages 331-340, 2009.
24. D. Nistér and H. Stewénius. Scalable recognition with a vocabulary tree. In CVPR (2), pages 2161-2168, 2006.
25. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, 2007.
26. G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. The MIT press, 2006.
27. C. Silpa-Anan and R. Hartley. Optimised kd-trees for fast image descriptor matching. In CVPR, 2008.
28. N. Snavely, S. M. Seitz, and R. Szeliski. Photo tourism: exploring photo collections in 3D. ACM Trans. Graph., 25(3):835-846, 2006.
29. R. F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6(4):579-589, 1991.
30. A. B. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE Trans. Pattern Anal. Mach. Intell., 30(11):1958-1970, 2008.
31. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, pages 311-321, 1993.