Optimised KD-trees for fast image descriptor matching

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Silpa Anan, Chanop ^a   Hartley, Richard ^b  

^a Australian Capital Territory   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FEATURE EXTRACTION; FINANCIAL DATA PROCESSING; IMAGE PROCESSING; PATTERN RECOGNITION; PRINCIPAL COMPONENT ANALYSIS; TOOLS;

COORDINATE AXES; DATA SETS; IMAGE DESCRIPTOR; IMAGE DESCRIPTORS; K-D TREES; PRINCIPAL AXIS; PRINCIPAL COMPONENTS; SEARCH PERFORMANCE; SIFT DESCRIPTORS;

TREES (MATHEMATICS);

EID: 51949097915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587638     Document Type: Conference Paper

References (15)

1. Y. Amit and D. Geman. Shape quantization and recognition with randomized trees. Neural Quantization, 9(7):1545-1588, 1997.
2. S. Arya and D. M. Mount. Algorithms for fast vector quantization. In Proceedings of the data compression conference, pages 381-390, 1993.
3. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, and Angela Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM, 45(6):891-923, 1998.
4. Jeffrey S. Beis and David G. Lowe. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In Proceedings of computer vision and pattern recognition, pages 1000-1006, Puerto Rico, June 1997.
5. Jon Louis Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
6. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the symposium on computational geometry, pages 253-262, 2004.
7. Jerome H. Freidman, Jon Louis Bently, and Raphael Arifinkel. An algorithm for finding best matches in logarithmic expected time. ACM transactions on mathematical software, 3(3):209-206, september 1977.
8. K. Grauman and T. Darrell. Pyramid match hashing: Sublinear time indexing over partial correspondences. In Proc. IEEE Conference on Computer Vision and Pattern Recognition, 2007.
9. V. Lepetit and P. Fua. Keypoint recognition using randomized trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(9):1465-1479, 2006.
10. D. Lowe. Distinctive image features from scale invariant keypoints. IJCV, 60(2):91-110, 2004.
11. David G. Lowe. Distictive image features from scale-invariant keypoints. International journal of computer vision, 60(2):91-110, 2004.
12. J. McNames. A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:964-976, September 201.
13. Krystian Mikolajczyk and Cordelia Schmid. A performance evaluation of local descriptors. In Proceedings of computer vision and pattern recognition, 2003.
14. D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In Proc. IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages 2161-2168, 2006.
15. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In Proc. IEEE Conference on Computer Vision and Pattern Recognition, 2007.