ACM Home Page
Please provide us with feedback. Feedback
Vocabulary-based hashing for image search
Full text PdfPdf (339 KB)
Source
International Multimedia Conference archive
Proceedings of the seventeen ACM international conference on Multimedia table of contents
Beijing, China
SESSION: Short papers session 1: content analysis table of contents
Pages 589-592  
Year of Publication: 2009
ISBN:978-1-60558-608-3
Authors
Yingyu Liang  Tsinghua University, Beijing, China
Jianmin Li  Tsinghua University, Beijing, China
Bo Zhang  Tsinghua University, Beijing, China
Sponsor
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 34,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1631272.1631363
What is a DOI?

ABSTRACT

This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated with a set of feature points, i.e. a vocabulary, and maps an input point to the ID of the nearest one in the vocabulary. The function family can be employed to build a high-dimensional index for approximate nearest neighbor search. Then we concentrate on its application in image search. Guiding rules for the construction of the vocabularies are derived, which improve the effectiveness of the approach in this context by taking advantage of the data distribution. The rules are applied to design an algorithm for vocabulary construction in practice. Experiments show promising performance of the approach and the effectiveness of the guiding rules. Comparison with the popular Euclidean locality-sensitive hashing also shows the advantage of our approach in image search.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 1998.
 
2
M. Casey and M. Slaney. Song intersection by approximate nearest neighbour search. In ISMIR, 2006.
 
3
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG, 2004.
 
4
H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, 2008.
 
5
A. Joly and O. Buisson. A posteriori multi-probe locality sensitive hashing. In MM, 2008.
 
6
Y. Ke, R. Sukthankar, and L. Huston. Efficient near-duplicate detection and sub-image retrieval. In MM, 2004.
 
7
D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004.
 
8
D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In CVPR, 2006.
 
9
S. Poullot, O. Buisson, and M. Crucianu. Z-grid-based probabilistic retrieval for scaling up content-based copy detection. In CIVR, 2007.
 
10
J. Sivic and A. Zisserman. Video Google: A text retrieval approach to object matching in videos. In ICCV, 2003.
 
11
H. Yang, Q. Wang, and Z. He. Randomized sub-vectors hashing for high-dimensional image feature matching. In MM, 2008.