Abstract
In recent years, approximate nearest neighbor search methods based on hashing have received considerable attention in large-scale data. There are plenty of new algorithms have been created and applied to different applications successfully. However, Due to the coming of big-data era, the data increasing rapidly and constantly. The batch-mode methods cannot process data efficiently. To solve the problem, online hashing has attracted more attention. Online methods can reduce storage and increase speed of computing. But existing online hashing algorithms also have some problems. The first one is the label information often cannot be got. Because of that, supervised approaches are not practicable. Another problem is online hashing methods process data as a stream, so the relations between old data and new arriving data is taken into account. It is the reason why a novel approach is proposed in this paper which combines matrix factorization with the idea of online hashing. This method considers the relationship between the previous data and newly arriving data. In addition, it updates the hashing learning model by the matrix factorization when the new data is arrived. The experimental results demonstrate superiority of the proposed approach. It outperforms most state-of-the-art online hashing methods and batch-mode methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of ACM Symposium on Theory of Computing, pp. 604–613 (1998)
Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. IEEE Trans. Pattern Anal. Mach. Intell. 35(12), 2916–2929 (2013)
Liu, W.: Hashing with graphs. In: Proceedings of International Conference on Machine Learning, pp. 1–8, June 2011
Huang, L.K., Yang, Q., Zheng, W.S.: Online hashing. In: International Joint Conference on Artificial Intelligence. AAAI Press, pp. 1422–1428 (2013)
Leng, C., et al.: Online sketching hashing. In: IEEE Conference on Computer Vision and Pattern Recognition. IEEE Computer Society, pp. 2503–2511 (2015)
Cakir, F., Sclaroff, S.: Online supervised hashing. In: IEEE International Conference on Image Processing. IEEE, pp. 162–173 (2015)
Lu, X., Zheng, X., Li, X.: Latent semantic minimal hashing for image retrieval. IEEE Trans. Image Process. 26(1), 355–368 (2016)
Cakir, F., Sclaroff, S.: Adaptive hashing for fast similarity search. In: IEEE International Conference on Computer Vision. IEEE Computer Society, pp. 1044–1052 (2015)
Ding, G., et al.: Large-scale cross-modality search via collective matrix factorization hashing. IEEE Trans. Image Process. 25(11), 5427–5440 (2016)
Acknowledgments
This paper was supported in part by the Fundamental Research Funds for the Central Universities under Grant JBX170313 and Grant XJS17063, in part by the National Natural Science Foundation of China under Grant 61572385, Grant 61702394, and Grant 61711530248, in part by the Postdoctoral Science Foundation of China under Grant 2018T111021 and Grant 2017M613082, and in part by the Aeronautical Science Foundation of China under Grant 20171981008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, L., Wang, Q., Wang, D., Wan, B., Shang, B. (2018). Online Matrix Factorization Hashing for Large-Scale Image Retrieval. In: Xu, Z., Gao, X., Miao, Q., Zhang, Y., Bu, J. (eds) Big Data. Big Data 2018. Communications in Computer and Information Science, vol 945. Springer, Singapore. https://doi.org/10.1007/978-981-13-2922-7_8
Download citation
DOI: https://doi.org/10.1007/978-981-13-2922-7_8
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2921-0
Online ISBN: 978-981-13-2922-7
eBook Packages: Computer ScienceComputer Science (R0)