We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3times104 streetside images of a city. We investigate how the traditional invariant feature matching approach falls down as the size of the database grows. In particular we show that by carefully selecting the vocabulary using the most informative features, retrieval performance is significantly improved, allowing us to increase the number of database images by a factor of 10. We also introduce a generalization of the traditional vocabulary tree search algorithm which improves performance by effectively increasing the branching factor of a fixed vocabulary tree.
|Published - Jun 2007
|CVPR '07: IEEE Conference on Computer Vision and Pattern Recognition, 2007 - Minneapolis
Duration: 17 Jun 2007 → 22 Jun 2007
|CVPR '07: IEEE Conference on Computer Vision and Pattern Recognition, 2007
|17/06/07 → 22/06/07