During recent years, large-scale data has become more and more present in our daily life, requiring better, faster, and more effective ways to discriminate between unrelated content and what we are truly interested in. In particular, retrieving similar images is a fundamental problem in both image processing and computer vision. Since finding similar images high-dimensional image features is not feasible in practice, approximate hashing techniques have been proved very effective due to their great efficiency and reasonably accuracy. Current hashing methods focus on image as a whole. However, sometimes the relevant content might be just bounded to a region of interest while the background part seems to be needless for users. In this paper, we propose to exploit region-level annotations, whenever they are available, for both training supervised hashing methods and also in the query image. Our objective is to evaluate whether region-level features can be helpful in a supervised hashing scenario. Experimental results confirm that region-level annotations in both the query and training images increase the accuracy.
[1]
Kristen Grauman,et al.
Learning Binary Hash Codes for Large-Scale Image Search
,
2013,
Machine Learning for Computer Vision.
[2]
Shih-Fu Chang,et al.
Hash Bit Selection: A Unified Solution for Selection Problems in Hashing
,
2013,
2013 IEEE Conference on Computer Vision and Pattern Recognition.
[3]
Moses Charikar,et al.
Similarity estimation techniques from rounding algorithms
,
2002,
STOC '02.
[4]
Rongrong Ji,et al.
Supervised hashing with kernels
,
2012,
2012 IEEE Conference on Computer Vision and Pattern Recognition.
[5]
Kristen Grauman,et al.
Efficiently searching for similar images
,
2010,
Commun. ACM.
[6]
Yihong Gong,et al.
Linear spatial pyramid matching using sparse coding for image classification
,
2009,
CVPR.
[7]
Michael A. Casey,et al.
Locality-Sensitive Hashing for Finding Nearest Neighbors
,
2008
.