Fast approximate nearest neighbors with automatic algorithm configuration

VISAPP 2009 - Proceedings of the 4th International Conference on Computer Vision Theory and Applications

Volumn 1, Issue , 2009, Pages 331-340

  Muja, Marius ^a   Lowe, David G ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Clustering; Hierarchical k means tree; Nearest neighbors search; Randomized kd trees

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATE NEAREST NEIGHBOR; AUTOMATIC ALGORITHMS; CLUSTERING; COMPUTER VISION PROBLEMS; DATA SETS; DEGREE OF PRECISION; EXACT ALGORITHMS; HIERARCHICAL K-MEANS TREE; HIGH DIMENSIONAL SPACES; HIGH-DIMENSIONAL PROBLEMS; K-D TREE; K-MEANS; LINEAR SEARCH; NEAREST-NEIGHBORS; NEAREST-NEIGHBORS SEARCH; ORDER OF MAGNITUDE; PARAMETER SELECTION; PARAMETER VALUES; PUBLIC DOMAINS; QUERY TIME; RANDOMIZED KD-TREES;

COMPUTER VISION;

ALGORITHMS;

EID: 70349675925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Andoni, A., (2006). Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 459-468.
2. Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., and Wu, A. Y. (1998). An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM, 45:891-923.
3. Beis, J. S. and Lowe, D. G. (1997). Shape indexing using approximate nearest-neighbor search in high dimensional spaces. In CVPR, pages 1000-1006.
4. Brin, S. (1995). Near neighbor search in large metric spaces. In VLDB, pages 574-584.
5. Freidman, J. H., Bentley, J. L., and Finkel, R. A. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3:209-226.
6. Fukunaga, K. and Narendra, P. M. (1975). A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput., 24:750-753.
7. Leibe, B., Mikolajczyk, K., and Schiele, B. (2006). Efficient clustering and matching for object class recognition. In BMVC.
8. Liu, T., Moore, A., Gray, A., and Yang, K. (2004). An investigation of practical approximate nearest neighbor algorithms. In Neural Information Processing Systems.
9. Lowe, D. G. (2004). Distinctive image features from scale-invariant keypoints. Int. Journal of Computer Vision, 60:91-110.
10. Mikolajczyk, K. and Matas, J. (2007). Improving descriptors for fast tree matching by optimal linear projection. In Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on, pages 1-8.
11. Nister, D. and Stewenius, H. (2006). Scalable recognition with a vocabulary tree. In CVPR, pages 2161-2168.
12. Philbin, J., Chum, O., Isard, M., Sivic, J., and Zisserman, A. (2007). Object retrieval with large vocabularies and fast spatial matching. In CVPR.
13. Schindler, G., Brown, M., and Szeliski, R. (2007). City-scale location recognition. In CVPR, pages 1-7.
14. Silpa-Anan, C. and Hartley, R. (2004). Localization using an imagemap. In Australasian Conference on Robotics and Automation.
15. Silpa-Anan, C. and Hartley, R. (2008). Optimised KD-trees for fast image descriptor matching. In CVPR.
16. Sivic, J. and Zisserman, A. (2003). Video Google: A text retrieval approach to object matching in videos. In ICCV.
17. Torralba, A., Fergus, R., and Freeman, W. T. (2008). 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(11): 1958-1970.