Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

TMM13:QueryAdaptiveSearch

Yu-Gang Jiang, Jun Wang, Xiangyang Xue, Shih-Fu Chang. Query-Adaptive Image Search with Hash Codes. IEEE Transactions on Multimedia, 15(2):442-453, 2013.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Scalable image search based on visual similarity has been an active topic of research in recent years. State-of-the-art solutions often use hashing methods to embed high-dimensional image features into Hamming space, where search can be performed in real-time based on Hamming distance of compact hash codes. Unlike traditional metrics (e.g., Euclidean) that offer continuous distances, the Hamming distances are discrete integer values. As a consequence, there are often a large number of images sharing equal Hamming distances to a query, which largely hurts search results where fine-grained ranking is very important. This paper introduces an approach that enables query-adaptive ranking of the returned images with equal Hamming distances to the queries. This is achieved by firstly offline learning bitwise weights of the hash codes for a diverse set of predefined semantic concept classes. We formulate the weight learning process as a quadratic programming problem that minimizes intra-class distance while preserving inter-class relationship captured by original raw image features. Query-adaptive weights are then computed online by evaluating the proximity between a query and the semantic concept classes. With the query-adaptive bitwise weights, returned images can be easily ordered by weighted Hamming distance at a finer-grained hash code level rather than the original Hamming distance level. Experiments on a Flickr image dataset show clear improvements from our proposed approach

Contact

Yu-Gang Jiang
Jun Wang
Shih-Fu Chang

BibTex Reference

@article{TMM13:QueryAdaptiveSearch,
   Author = {Jiang, Yu-Gang and Wang, Jun and Xue, Xiangyang and Chang, Shih-Fu},
   Title = {Query-Adaptive Image Search with Hash Codes},
   Journal = {IEEE Transactions on Multimedia},
   Volume = {15},
   Number = {2},
   Pages = {442--453},
   Year = {2013}
}

EndNote Reference [help]

Get EndNote Reference (.ref)

 
bar

For problems or questions regarding this web site contact The Web Master.

This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).