skip to main content
research-article

Image retrieval with query-adaptive hashing

Published: 19 February 2013 Publication History

Abstract

Hashing-based approximate nearest-neighbor search may well realize scalable content-based image retrieval. The existing semantic-preserving hashing methods leverage the labeled data to learn a fixed set of semantic-aware hash functions. However, a fixed hash function set is unable to well encode all semantic information simultaneously, and ignores the specific user's search intention conveyed by the query. In this article, we propose a query-adaptive hashing method which is able to generate the most appropriate binary codes for different queries. Specifically, a set of semantic-biased discriminant projection matrices are first learnt for each of the semantic concepts, through which a semantic-adaptable hash function set is learnt via a joint sparsity variable selection model. At query time, we further use the sparsity representation procedure to select the most appropriate hash function subset that is informative to the semantic information conveyed by the query. Extensive experiments over three benchmark image datasets well demonstrate the superiority of our proposed query-adaptive hashing method over the state-of-the-art ones in terms of retrieval accuracy.

References

[1]
Bosch, A., Zisserman, A., and Muñoz, X. 2006. Scene classification via plsa. In Proceedings of the European Conference on Computer Vision. 517--530.
[2]
Boyd, S. and Vandenberghe, L. 2004. Convex Optimization. Cambridge University Press.
[3]
Candès, E. and Romberg, J. 2007. L1-magic. http://users.ece.gatech.edu/~justin/l1magic/.
[4]
Fei-Fei, L., Robert, F., and Pietro, P. 2007. Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. Comput. Vision Image Understand. 106, 1, 59--70.
[5]
Indyk, P. and Motwani, R. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the Annual ACM Symposium on Theory of Computing. 604--613.
[6]
Jégou, H., Amsaleg, L., Schmid, C., and Gros, P. 2008. Query-Adaptive locality sensitive hashing. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing. 12--15.
[7]
Jia, D., Wei, D., Richard, S., Li-jia, L., Kai, L., and Fei-Fei, L. 2009. Imagenet: A large-scale hierarchical image database. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 248--255.
[8]
Jiang, Y.-G., Wang, J., and Chang, S.-F. 2011. Lost in binarization: Query-adaptive ranking for similar image search with compact codes. In Proceedings of the ACM International Conference on Multimedia Retrieval.
[9]
Kulis, B. and Darrell, T. 2009. Learning to hash with binary reconstructive embeddings. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems. 1042--1050.
[10]
Kulis, B. and Grauman, K. 2009. Kernelized locality-sensitive hashing for scalable image search. In Proceedings of the International Conference on Computer Vision. 2130--2137.
[11]
Kulis, B., Jain, B., and Grauman, K. 2009. Fast similarity search for learned metrics. IEEE Trans. Pattern Anal. Mach. Intell. 31, 12, 2143--2157.
[12]
Lee, D., Ke, Q., and Isard, M. 2010. Partition min-hash for partial duplicate image discovery. In Proceedings of the European Conference on Computer Vision. 648--662.
[13]
Raginsky, M. and Lazebnik, S. 2009. Locality-sensitive binary codes from shift-invariant kernels. In Proceedings of 23rd Annual Conference on Neural Information Processing Systems. 1509--1517.
[14]
Rui, Y., Huang, T., and Chang, S.-F. 1999. Image retrieval: Current techniques, promising directions, and open issues. J. Vis. Comm. Image Represent. 10, 1, 39--62.
[15]
Salakhutdinov, R. and Hinton, G. 2009. Semantic hashing. Int. J. Approx. Reasoning 50, 7, 969--978.
[16]
Shakhnarovich, G., Viola, P., and Darrell, T. 2003. Fast pose estimation with parameter-sensitive hashing. In Proceedings of the International Conference on Computer Vision. 750--757.
[17]
Shakhnarovich, R. and Hinton, G. 2007. Learning a nonlinear embedding by preserving class neighbourhood structure. In Proceedings of the International Conference on Artificial Intelligence and Statistics. 1--8.
[18]
Tseng, P. 2008. On accelerated proximal gradient methods for convex-concave optimization. SIAM J. Optim. (to appear).
[19]
Wang, J., Kumar, S., and Chang, S.-F. 2010. Semi-Supervised hashing for scalable image retrieval. In Proceedings of the International Conference on Computer Vision. 3424--3431.
[20]
Weiss, Y., Torralba, A., and Fergus, R. 2001. Small sample learning during multimedia retrieval using biasmap. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 11--17.
[21]
Weiss, Y., Torralba, A., and Fergus, R. 2008. Spectral hashing. In Advances in Neural Information Processing. 1753--1760.
[22]
Winder, S. and Brown, M. 2007. Learning local image descriptors. In Proceedings of the International Conference on Computer Vision. 1--8.

Cited By

View all
  • (2024)Fast Unsupervised Cross-Modal Hashing with Robust Factorization and Dual ProjectionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/369468420:12(1-21)Online publication date: 26-Nov-2024
  • (2023)Weakly Supervised Hashing with Reconstructive Cross-modal AttentionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/358918519:6(1-19)Online publication date: 8-Apr-2023
  • (2021)Lifelog Image Retrieval Based on Semantic Relevance MappingACM Transactions on Multimedia Computing, Communications, and Applications10.1145/344620917:3(1-18)Online publication date: 22-Jul-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Multimedia Computing, Communications, and Applications
ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 9, Issue 1
February 2013
158 pages
ISSN:1551-6857
EISSN:1551-6865
DOI:10.1145/2422956
Issue’s Table of Contents
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 February 2013
Accepted: 01 March 2012
Revised: 01 December 2011
Received: 01 May 2011
Published in TOMM Volume 9, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Image retrieval
  2. hashing
  3. joint sparsity
  4. query-adaptive

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Fast Unsupervised Cross-Modal Hashing with Robust Factorization and Dual ProjectionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/369468420:12(1-21)Online publication date: 26-Nov-2024
  • (2023)Weakly Supervised Hashing with Reconstructive Cross-modal AttentionACM Transactions on Multimedia Computing, Communications, and Applications10.1145/358918519:6(1-19)Online publication date: 8-Apr-2023
  • (2021)Lifelog Image Retrieval Based on Semantic Relevance MappingACM Transactions on Multimedia Computing, Communications, and Applications10.1145/344620917:3(1-18)Online publication date: 22-Jul-2021
  • (2018)A Survey on Learning to HashIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2017.269996040:4(769-790)Online publication date: 1-Apr-2018
  • (2016)Approximate Asymmetric Search for Binary Embedding CodesACM Transactions on Multimedia Computing, Communications, and Applications10.1145/299050413:1(1-25)Online publication date: 25-Oct-2016
  • (2016)Query Adaptive Search System Based On Hamming Distance for Image RetrievalProceedings of the Third International Symposium on Computer Vision and the Internet10.1145/2983402.2983443(141-147)Online publication date: 21-Sep-2016
  • (2015)Neighborhood Discriminant Hashing for Large-Scale Image RetrievalIEEE Transactions on Image Processing10.1109/TIP.2015.242144324:9(2827-2840)Online publication date: Sep-2015
  • (2014)News videos anchor person detection by shot clusteringNeurocomputing10.1016/j.neucom.2013.06.003123(86-99)Online publication date: 1-Jan-2014

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media