Abstract
Approximate nearest neighbor search within large scale image datasets strongly demands efficient and effective algorithms. One promising strategy is to compute compact bits string via the hashing scheme as representation of data examples, which can dramatically reduce query time and storage requirements. In this paper, we propose a novel Cauchy graph-based hashing algorithm for the first time, which can capture more local topology semantics than Laplacian embedding. In particular, greater similarities are achieved through Cauchy embedding mapped from the pairs of smaller distance over the original data space. Then regularized kernel least-squares, with its closed form solution, is applied to efficiently learn hash functions. The experimental evaluations over several noted image retrieval benchmarks, MNIST, CIFAR-10 and USPS, demonstrate that performance of the proposed hashing algorithm is quite comparable with the state-of-the-art hashing techniques in searching semantic similar neighbors, especially in quite short length hash codes, such as those of only 4, 6, and 8 bits.
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
Datta, R., Joshi, D., Li, J., Wang, J.Z.: Image retrieval: Ideas, influences, and trends of the new age. ACM Computing Surveys (April 2008)
Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, pp. 518–529 (1999)
Torralba, A., Fergus, R., Weiss, Y.: Small codes and large image databases for recognition. In: CVPR (2008)
Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: ICCV, pp. 2130–2137 (2009)
Kulis, B., Jain, P., Grauman, K.: Fast similarity search for learned metrics. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2143–2157 (2009)
Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for large scale search. IEEE Transactions on Pattern Analysis and Machine Intelligence (2012)
Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, pp. 1753–1760 (2008)
Liu, W., Wang, J., Kumar, S., Chang, S.F.: Hashing with graphs. In: Getoor, L., Scheffer, T. (eds.) Proceedings of the 28th International Conference on Machine Learning, ICML 2011. ACM, New York (2011)
Salakhutdinov, R., Hinton, G.E.: Semantic hashing. Int. J. Approx. Reasoning 50(7), 969–978 (2009)
Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon-eui, S.: Spherical hashing. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2012)
Liu, W., Wang, J., Ji, R., Jiang, Y.G., Chang, S.F.: Supervised hashing with kernels. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2012)
Liu, W., He, J., Chang, S.F.: Large graph construction for scalable semi-supervised learning. In: Proceedings of the 27th International Conference on Machine Learning, ICML 2010, pp. 679–686 (2010)
Stein, B.: Principles of hash-based text retrieval. In: SIGIR, pp. 527–534 (2007)
Yan, S., Xu, D., Zhang, B., Zhang, H., Yang, Q., Lin, S.: Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 40–51 (2007)
Luo, D., Ding, C.H.Q., Nie, F., Huang, H.: Cauchy graph embedding. In: ICML, pp. 553–560 (2011)
Zhang, D., Wang, J., Cai, D., Lu, J.: Self-taught hashing for fast similarity search. In: SIGIR, pp. 18–25 (2010)
Zhang, D., Wang, F., Si, L.: Composite hashing with multiple information sources. In: SIGIR, pp. 225–234 (2011)
Bengio, Y., Delalleau, O., Roux, N.L., Paiement, J.F., Vincent, P., Ouimet, M.: Learning eigenfunctions links spectral embedding and kernel pca. Neural Computation 16(10), 2197–2219 (2004)
Oliva, A., Torralba, A.: Modeling the shape of the scene: A holistic representation of the spatial envelope. International Journal of Computer Vision 42(3), 145–175 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, L., Ip, H.H.S. (2012). Hashing with Cauchy Graph. In: Lin, W., et al. Advances in Multimedia Information Processing – PCM 2012. PCM 2012. Lecture Notes in Computer Science, vol 7674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34778-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-34778-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34777-1
Online ISBN: 978-3-642-34778-8
eBook Packages: Computer ScienceComputer Science (R0)