Distance-Based multiple paths quantization of vocabulary tree for object and scene retrieval

Authors:
Heng Yang;Qing Wang;Ellen Yi-Luen Do
Affiliations:
School of Computer Science and Engineering, Northwestern Polytechnical University, Xi’an, P.R. China;School of Computer Science and Engineering, Northwestern Polytechnical University, Xi’an, P.R. China;College of Computing, Georgia Institute of Technology, Atlanta, GA
Venue:
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
Year:
2009

Citing 5
Cited 0

Video Google: A Text Retrieval Approach to Object Matching in Videos

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Scalable Recognition with a Vocabulary Tree

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Parallel bisecting k-means with prediction clustering algorithm

The Journal of Supercomputing
Randomized sub-vectors hashing for high-dimensional image feature matching

MM '08 Proceedings of the 16th ACM international conference on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state of the art in image retrieval on large scale databases is achieved by the work inspired by the text retrieval approaches. A key step of these methods is the quantization stage which maps the high-dimensional feature vectors to discriminatory visual words. This paper mainly proposes a distance-based multiple paths quantization (DMPQ) algorithm to reduce the quantization loss of the vocabulary tree based methods. In addition, a more efficient way to build a vocabulary tree is presented by using sub-vectors of features. The algorithm is evaluated on both the standard object recognition and the location recognition databases. The experimental results have demonstrated that the proposed algorithm can effectively improve image retrieval performance of the vocabulary tree based methods on both the databases.