PeRL STUDIES AUTONOMOUS NAVIGATION & MAPPING FOR MOBILE ROBOTS IN A PRIORI UNKNOWN ENVIRONMENTS.

Scalable recognition with a vocabulary tree

Summary


David Nistér and Henrik Stewénius, Scalable recognition with a vocabulary tree. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 2161-2168, 2006.

Abstract

A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme builds upon popular techniques of indexing descriptors extracted from local regions, and is robust to background clutter and occlusion. The local region descriptors are hierarchically quantized in a vocabulary tree. The vocabulary tree allows a larger and more discriminatory vocabulary to be used efficiently, which we show experimentally leads to a dramatic improvement in retrieval quality. The most significant property of the scheme is that the tree directly defines the quantization. The quantization and the indexing are therefore fully integrated, essentially being one and the same. The recognition quality is evaluated through retrieval on a database with ground truth, showing the power of the vocabulary tree approach, going as high as 1 million images.

Bibtex entry

@INPROCEEDINGS { dnister-2006a,
    AUTHOR = { David Nistér and Henrik Stewénius },
    TITLE = { Scalable recognition with a vocabulary tree },
    BOOKTITLE = { Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition },
    YEAR = { 2006 },
    VOLUME = { 2 },
    PAGES = { 2161--2168 },
    DOI = { 10.1109/CVPR.2006.264 },
}