Abstract
Image hashing based Approximate Nearest Neighbor (ANN) searching has drawn much attention in large-scale image dataset application, where balance the precision and high recall rate is difficulty task. In this paper, we propose a weakly principal component hash method with multiple tables to encode binary codes. Analyzing the distribution of projected data on different principal component directions, we find that neighbors which are far in some principal component directions maybe near in the other directions. Therefore, we construct multiple-table hashing to search the missed positive samples by previous tables, which can improve the recall. For each table, we project data to different principal component directions to learn hashing functions. In order to improve the precision rate, neighborhood points in Euclidean space should also be neighborhoods in Hamming space. So we optimize the projected data using orthogonal matrix to preserve the structure of the data in the Hamming space. Experimental and compared with six hashing results on public datasets show that the proposed method is more effective and outperforms the state-of-the-art.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Xu, H., Wang, J., Li, Z., Zeng, G., Li, S., Yu, N.: Complementary Hashing for Approximate Nearest Neighbor Search. In: 24th IEEE International Conference on Computer Vision, pp. 1631–1638 (2011)
Andoni, A., Indyk, P.: Near-optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. Commun. ACM. 51, 117–122 (2008)
Kulis, B., Grauman, K.: KernelizedLocality-sensitive Hashing for Scalable Image Search. In: 12nd IEEE International Conference on Computer Vision, pp. 2130–2137 (2009)
Raginsky, M., Lazebnik, S.: Locality-sensitive Binary Codes from Shift-invariant Kernels. In: 23rd Annual Conference on Neural Information Processing Systems, pp. 1509–1517 (2009)
Torralba, A., Fergus, R., Weiss, Y.: Small Codes and Large Image Databases for Recognition. In: 21st IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2008)
Weiss, Y., Torralba, A., Fergus, R.: Spectral Hashing. In: 22nd Annual Conference on Neural Information Processing Systems, pp. 1753–1760 (2008)
Wang, J., Kumar, S., Chang, S.: Semi-Supervised Hashing for Scalable Image Retrieval. In: 23th IEEE Conference on Computer Vision and Pattern Recognition, pp. 3424–3431 (2010)
Wang, J., Kumar, S., Chang, S.: Sequential Projection Learning for Hashing with Compact Codes. In: 27th International Conference on Machine Learning, pp. 1127–1134 (2010)
Gong, Y., Lazebnik, S.: Iterative Quantization: A Procrustean Approach to Learning Binary Codes. In: 24th IEEE Conference on Computer Vision and Pattern Recognition, pp. 817–824 (2011)
Mu, Y., Chen, X., Chua, T., Yan, S.: Learning Reconfigurable Hashing for Diverse Semantics. In: 1st ACM International Conference on Multimedia Retrieval, pp. 1–8 (2011)
Shao, J., Wu, F., Ouyang, C., Zhang, X.: Sparse Spectral Hashing. Pattern Recogn. Lett. 33, 271–277 (2011)
Chen, C., Horng, S., Huang, C.: Locality Sensitive Hashing for Sampling-based Algorithms in Association Rule Mining. Expert Syst. Appl. 38, 12388–12397 (2011)
Strecha, C., Bronstein, A.M., Bronstein, M.M., Fua, P.: LDAHash: Improved Matching with Smaller Descriptors. IEEE T. Pattern Anal 34, 66–78 (2012)
Jagadish, H.V., Ooi, B., Tan, K., Yu, C., Zhang, R.: iDistance: An Adaptive B+-tree Based Indexing Method for Nearest Neighbor Search. ACM T. Database Syst. 30, 364–397 (2005)
Yang, K., Shahabi, C.: An efficient k nearest neighbor search for multivariate time series. Inform Comput. 205, 65–98 (2007)
Giannella, C.: New instability results for high-dimensional nearest neighbor search. Inform Process. Lett. 109, 1109–1113 (2009)
Brandt, J.: Transform coding for fast approximate nearest neighbor search in high dimensions. In: 23th IEEE Conference on Computer Vision and Pattern Recognition, pp. 1815–1822 (2010)
Liu, D.: A strong lower bound for approximate nearest neighbor searching. Inform Process. Lett. 92, 23–29 (2004)
Cha, G., Zhu, X., Petkovic, D., Chung, C.: An efficient indexing method for nearest neighbor searches in high-dirnensional image databases. IEEE T. Multimedia 4, 76–87 (2002)
Indyk, P.: Nearest-neighbor-preserving embeddings. ACM Transactions on Algorithms 3, 1549–6325 (2007)
Yu, D., Zhang, A.: ClusterTree: integration of cluster representation and nearest-neighbor search for large data sets with high dimensions. IEEE T Knowl. Data En. 15, 1316–1337 (2003)
Jégou, H., Douze, M., Schmid, C.: Improving Bag-of-Features for Large Scale Image Search. Int. J. Comput Vision 87, 316–336 (2010)
Wang, J.: Semi-Supervised Learning for Scalable and Robust Visual Search. PhD. Thesis, Columbia University, USA (2011)
Zhou, J., Fu, H., Kong, X.: A balanced semi-supervised hashing method for CBIR. In: 18th IEEE International Conference on Image Processing, pp. 2481–2484. IEEE Press, New York (2011)
Chua, T., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: NUS-WIDE: A Real-World Web Image Database from National University of Singapore. In: 8th ACM International Conference on Image and Video Retrieval. ACM Press (2009)
Jégou, H., Douze, M., Schmid, C.: Product Quantization for Nearest Neighbor Search. IEEE T. Pattern Anal. 33(1), 117–128 (2011)
Liu, W., Wang, J., Kumar, S., Chang, S.: Hashing with Graphs. In: 28th International Conference on Machine Learning (2011)
Wang, M., Yang, K., Hua, X., Zhang, H.: Towards a Relevant and Diverse Search of Social Images. IEEE T. Multimedia 12(8), 829–842 (2010)
Wang, M., Hua, X., Tang, J., Hong, R.: Beyond Distance Measurement: Constructing Neighborhood Similarity for Video Annotation. IEEE T. Multimedia 11(3), 465–476 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, H., Kong, X., Guo, Y., Lu, J. (2013). Weakly Principal Component Hashing with Multiple Tables. In: Li, S., et al. Advances in Multimedia Modeling. Lecture Notes in Computer Science, vol 7733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35728-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-35728-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35727-5
Online ISBN: 978-3-642-35728-2
eBook Packages: Computer ScienceComputer Science (R0)