short-paper

Vocabulary-based hashing for image search

Authors:

Yingyu Liang,

Jianmin Li,

Bo ZhangAuthors Info & Claims

MM '09: Proceedings of the 17th ACM international conference on Multimedia

Pages 589 - 592

https://doi.org/10.1145/1631272.1631363

Published: 19 October 2009 Publication History

Get Access

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

[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.

Digital Library

Google Scholar

[2]

M. Casey and M. Slaney. Song intersection by approximate nearest neighbour search. In ISMIR, 2006.

Google Scholar

[3]

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG, 2004.

Digital Library

Google Scholar

[4]

H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, 2008.

Digital Library

Google Scholar

[5]

A. Joly and O. Buisson. A posteriori multi-probe locality sensitive hashing. In MM, 2008.

Digital Library

Google Scholar

[6]

Y. Ke, R. Sukthankar, and L. Huston. Efficient near-duplicate detection and sub-image retrieval. In MM, 2004.

Google Scholar

[7]

D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004.

Digital Library

Google Scholar

[8]

D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In CVPR, 2006.

Digital Library

Google Scholar

[9]

S. Poullot, O. Buisson, and M. Crucianu. Z-grid-based probabilistic retrieval for scaling up content-based copy detection. In CIVR, 2007.

Digital Library

Google Scholar

[10]

J. Sivic and A. Zisserman. Video Google: A text retrieval approach to object matching in videos. In ICCV, 2003.

Digital Library

Google Scholar

[11]

H. Yang, Q. Wang, and Z. He. Randomized sub-vectors hashing for high-dimensional image feature matching. In MM, 2008.

Digital Library

Google Scholar

Cited By

View all

Zhou MZhou ZWen C(2016)Real-time monitoring of batch processes using the fast k-nearest neighbor rule2016 35th Chinese Control Conference (CCC)10.1109/ChiCC.2016.7554434(6843-6848)Online publication date: Jul-2016
https://doi.org/10.1109/ChiCC.2016.7554434
Tsay JLin CTseng CChang K(2011)On Visual Clothing SearchProceedings of the 2011 International Conference on Technologies and Applications of Artificial Intelligence10.1109/TAAI.2011.43(206-211)Online publication date: 11-Nov-2011
https://dl.acm.org/doi/10.1109/TAAI.2011.43
Liang YLi JZhang B(2010)Learning vocabulary-based hashing with adaboostProceedings of the 16th international conference on Advances in Multimedia Modeling10.1007/978-3-642-11301-7_54(545-555)Online publication date: 6-Jan-2010
https://dl.acm.org/doi/10.1007/978-3-642-11301-7_54

Index Terms

Vocabulary-based hashing for image search
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Computer vision tasks
2. Information systems
  1. Information retrieval

Recommendations

Fast image similarity search by distributed locality sensitive hashing
Highlights
- Our approach addresses hashing for distributed data and suitable for large databases.
Abstract
Approximate Nearest Neighbor (ANN) search approaches that use possible neighbors instead of exact neighbors are widely investigated by researchers in recent years. ANN approaches are usually applied in a centralized manner. However, in ...
Rank Preserving Hashing for Rapid Image Search
DCC '15: Proceedings of the 2015 Data Compression Conference

In recent years, hashing techniques are becoming overwhelmingly popular for their high efficiency in handling large-scale computer vision applications. It has been shown that hashing techniques which leverage supervised information can significantly ...
Parallel image search application based on online hashing hierarchical ranking
Abstract
As we know that the nearest neighbor search is a good and effective method for large-scaled image search. This paper mainly focuses on the design and implementation of parallel image retrieval system based on Hadoop architecture and hashing binary ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MM '09: Proceedings of the 17th ACM international conference on Multimedia

October 2009

1202 pages

ISBN:9781605586083

DOI:10.1145/1631272

General Chairs:
Wen Gao
Peking University, China
,
Yong Rui
Microsoft, China
,
Alan Hanjalic
Delft University of Technology, The Netherlands
,
Program Chairs:
Changsheng Xu
Institute of Automation, Chinese Academy of Sciences, China
,
Eckehard Steinbach
Technical University of Munich, Germany
,
Abdulmotaleb El Saddik
University of Ottawa, Canada
,
Michelle Zhou
IBM T. J. Watson Research Center, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

MM09

Sponsor:

SIGMM

MM09: ACM Multimedia Conference

October 19 - 24, 2009

Beijing, China

Acceptance Rates

Overall Acceptance Rate 2,145 of 8,556 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
302
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou MZhou ZWen C(2016)Real-time monitoring of batch processes using the fast k-nearest neighbor rule2016 35th Chinese Control Conference (CCC)10.1109/ChiCC.2016.7554434(6843-6848)Online publication date: Jul-2016
https://doi.org/10.1109/ChiCC.2016.7554434
Tsay JLin CTseng CChang K(2011)On Visual Clothing SearchProceedings of the 2011 International Conference on Technologies and Applications of Artificial Intelligence10.1109/TAAI.2011.43(206-211)Online publication date: 11-Nov-2011
https://dl.acm.org/doi/10.1109/TAAI.2011.43
Liang YLi JZhang B(2010)Learning vocabulary-based hashing with adaboostProceedings of the 16th international conference on Advances in Multimedia Modeling10.1007/978-3-642-11301-7_54(545-555)Online publication date: 6-Jan-2010
https://dl.acm.org/doi/10.1007/978-3-642-11301-7_54

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fast image similarity search by distributed locality sensitive hashing

Rank Preserving Hashing for Rapid Image Search

Parallel image search application based on online hashing hierarchical ranking