Abstract
Although distance between binary codes can be computed fast in hamming space, linear search is not practical for large scale dataset. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which Hierarchical Clustering Trees (HCT) is the state-of-the-art method. However, HCT builds index with the whole binary codes, which degrades search performance. In this paper, we first propose an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Then, a new index is proposed using com-pressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, W., Gao, K., Zhang, Y., Li, J.: Efficient Approximate Nearest Neighbor Search with Integrated Binary Codes. In: ACM MM, pp. 1189–1192 (2011)
Chu, W.-T., Li, C.-J., Tseng, S.-C.: Travelmedia: an intelligent management system for media captured in travel. JVCI 22, 93–104 (2011)
Torralba, A., Fergus, R., Weiss, Y.: Small codes and large image databases for recognition. In: IEEE CVPR (2008)
Zhang, L., Zhang, Y., Tang, J., Gu, X., Li, J., Tian, Q.: Topology Preserving Hashing for Similarity Search. In: ACM MM (2013)
Xie, H., Zhang, Y., Tan, J., Guo, L., Li, J.: Contextual Query Expansion for Image Retrieval. IEEE Trans. on Multimedia 16(4) (2014)
Salakhutdinov, R., Hinton, G.: Semantic Hashing. International Journal of Approximate Reasoning (2009)
Strecha, C., Bronstein, A., Bronstein, M., Fua, P.: LDAHash: improved matching with smaller descriptors. IEEE Transactions on PAMI 34(1), 66–78 (2012)
Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to SIFT or SURF. In: IEEE ICCV, pp. 2564–2571 (2011)
Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multi-index hashing. In: IEEE CVPR (2012)
Muja, M., Lowe, D.G.: Fast matching of binary features. In: CRV (2012)
Muja, M., Lowe, D.G.: http://people.cs.ubc.ca/~mariusm/index.php/FLANN/FLANN
Zitnick, C.L.: Binary coherent edge descriptors. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part II. LNCS, vol. 6312, pp. 170–182. Springer, Heidelberg (2010)
Weiss, Y., Torralba, A., Fergus, R.: Spectral Hashing. In: Advances in Neural Information Processing Systems (2008)
Jegou, H., Douze, M., et al.: Product Quantization for Nearest Neighbor Search. IEEE Transactions on PAMI 33(1), 117–128 (2011)
Aly, M., Munich, M., Perona, P.: Distributed kd-trees for retrieval from very large image collections. In: BMVC (2011)
Babenko, A., Lempitsky, V.: The inverted multi-index. In: IEEE CVPR (2012)
SilpaAnan, C., Hartley, R.: Optimized KD-trees for fast image descriptor matching. In: CVPR (2008)
Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the International Conference on Very Large Data Bases (1999)
Broder, A.Z.: On the resemblance and containment of documents. In: IEEE Compression and Complexity of Sequences, pp. 21–29 (1997)
Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications 36(2), 3336–3341 (2009)
Zhang, L., Zhang, Y., Tang, J., Lu, K., Tian, Q.: Binary Code Ranking with Weighted Hamming Distance. In: IEEE CVPR (2013)
Bland, J.M., Altman, D.G.: Statistics notes: measurement error (1996)
Jegou, H., Douze, M., Schmid, C.: Improving bag-of-features for large scale image search. Int. J. Comput. Vis. 87(3), 316–336 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ma, Y., Xie, H., Chen, Z., Dai, Q., Huang, Y., Ji, G. (2014). Fast Search of Binary Codes with Distinctive Bits. In: Ooi, W.T., Snoek, C.G.M., Tan, H.K., Ho, CK., Huet, B., Ngo, CW. (eds) Advances in Multimedia Information Processing – PCM 2014. PCM 2014. Lecture Notes in Computer Science, vol 8879. Springer, Cham. https://doi.org/10.1007/978-3-319-13168-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-13168-9_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13167-2
Online ISBN: 978-3-319-13168-9
eBook Packages: Computer ScienceComputer Science (R0)