Abstract
Semantic hashing enables computation and memory-efficient image retrieval through learning similarity-preserving binary representations. Most existing hashing methods mainly focus on preserving the piecewise class information or pairwise correlations of samples into the learned binary codes while failing to capture the mutual triplet-level ordinal structure in similarity preservation. In this article, we propose a novel Probability Ordinal-preserving Semantic Hashing (POSH) framework, which for the first time defines the ordinal-preserving hashing concept under a non-parametric Bayesian theory. Specifically, we derive the whole learning framework of the ordinal similarity-preserving hashing based on the maximum posteriori estimation, where the probabilistic ordinal similarity preservation, probabilistic quantization function, and probabilistic semantic-preserving function are jointly considered into one unified learning framework. In particular, the proposed triplet-ordering correlation preservation scheme can effectively improve the interpretation of the learned hash codes under an economical anchor-induced asymmetric graph learning model. Moreover, the sparsity-guided selective quantization function is designed to minimize the loss of space transformation, and the regressive semantic function is explored to promote the flexibility of the formulated semantics in hash code learning. The final joint learning objective is formulated to concurrently preserve the ordinal locality of original data and explore potentials of semantics for producing discriminative hash codes. Importantly, an efficient alternating optimization algorithm with the strictly proof convergence guarantee is developed to solve the resulting objective problem. Extensive experiments on several large-scale datasets validate the superiority of the proposed method against state-of-the-art hashing-based retrieval methods.
- Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, and Ludwig Schmidt. 2015. Practical and optimal LSH for angular distance. In Proceedings of the Neural Information Processing Systems. 1225–1233.Google Scholar
- Yue Cao, Mingsheng Long, Jianmin Wang, Han Zhu, and Qingfu Wen. 2016. Deep quantization network for efficient image retrieval. In Proceedings of the 13th AAAI Conference on Artificial Intelligence. 3457–3463.Google Scholar
- Yaxiong Chen and Xiaoqiang Lu. 2020. Deep category-level and regularized hashing with global semantic similarity learning. IEEE Transactions on Cybernetics. DOI:10.1109/TCYB.2020.2964993Google Scholar
- Tat-Seng Chua, Jinhui Tang, Richang Hong, Haojie Li, Zhiping Luo, and Yantao Zheng. 2009. NUS-WIDE: A real-world web image database from National University of Singapore. In Proceedings of the ACM International Conference on Image and Video Retrieval. ACM, 48.Google ScholarDigital Library
- Aristides Gionis, Piotr Indyk, Rajeev Motwani. 1999. Similarity search in high dimensions via hashing. In Proceedings of the 25th International Conference on Very Large Data Bases, Vol. 99. 518–529.Google Scholar
- Yunchao Gong, Svetlana Lazebnik, Albert Gordo, and Florent Perronnin. 2013. Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 35, 12 (2013), 2916–2929.Google ScholarDigital Library
- Jie Gui and Ping Li. 2018. RSDH: Robust rotated supervised discrete hashing. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining. ACM, 1485–1493.Google Scholar
- Jie Gui, Tongliang Liu, Zhenan Sun, and Tieniu Tan. 2018. Fast supervised discrete hashing. IEEE Transactions on Pattern Analysis and Machine Intelligence 40, 2 (2018), 490–496.Google ScholarDigital Library
- Jie Gui, Tongliang Liu, Zhenan Sun, Dacheng Tao, and Tieniu Tan. 2018. Supervised discrete hashing with relaxation. IEEE Transactions on Neural Networks and Learning Systems 29, 3 (2018), 608–617.Google ScholarCross Ref
- J. Guo, H. Chang, and W. Zhu. 2020. Preserving ordinal consensus: Towards feature selection for unlabeled data. In Proceedings of the AAAI Conference on Artificial Intelligence. 1–8.Google Scholar
- Ran He, Wei-Shi Zheng, Tieniu Tan, and Zhenan Sun. 2013. Half-quadratic-based iterative minimization for robust sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 36, 2 (2013), 261–275.Google Scholar
- Zihao Hu, Junxuan Chen, Hongtao Lu, and Tongzhen Zhang. 2017. Bayesian supervised hashing. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 6348–6355.Google ScholarCross Ref
- Qing-Yuan Jiang and Wu-Jun Li. 2015. Scalable graph hashing with feature transformation. In Proceedings of the International Joint Conference on Artificial Intelligence. 2248–2254.Google Scholar
- Zhongming Jin, Cheng Li, Yue Lin, and Deng Cai. 2014. Density sensitive hashing. IEEE Transactions on Cybernetics 44, 8 (2014), 1362–1371.Google ScholarCross Ref
- Wang-Cheng Kang, Wu-Jun Li, and Zhi-Hua Zhou. 2016. Column sampling based discrete supervised hashing. In Proceedings of the 13th AAAI Conference on Artificial Intelligence. 1230–1236.Google ScholarCross Ref
- Svebor Karaman, Xudong Lin, Xuefeng Hu, and Shih-Fu Chang. 2019. Unsupervised rank-preserving hashing for large-scale image retrieval. In Proceedings of the 2019 International Conference on Multimedia Retrieval. 192–196.Google ScholarDigital Library
- Benjamin Klein and Lior Wolf. 2019. End-to-end supervised product quantization for image search and retrieval. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 5041–5050.Google ScholarCross Ref
- Alex Krizhevsky and Geoffrey Hinton. 2009. Learning Multiple Layers of Features from Tiny Images. Technical Report. University of Toronto.Google Scholar
- Zhihui Lai, Yudong Chen, Jian Wu, Wai Keung Wong, and Fumin Shen. 2018. Jointly sparse hashing for image retrieval. IEEE Transactions on Image Processing 27, 12 (2018), 6147–6158.Google ScholarCross Ref
- Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. 1998. Gradient-based learning applied to document recognition. Proceedings of IEEE 86, 11 (1998), 2278–2324.Google ScholarCross Ref
- Qi Li, Zhenan Sun, Ran He, and Tieniu Tan. 2017. Deep supervised discrete hashing. In Proceedings of the 31st Conference on Neural Information Processing Systems. 2482–2491.Google Scholar
- Wu-Jun Li, Sheng Wang, and Wang-Cheng Kang. 2016. Feature learning based deep supervised hashing with pairwise labels. In Proceedings of the International Joint Conference on Artificial Intelligence. 1711–1717.Google Scholar
- Guosheng Lin, Chunhua Shen, Qinfeng Shi, Anton Van den Hengel, and David Suter. 2014. Fast supervised hashing with decision trees for high-dimensional data. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 1963–1970.Google ScholarDigital Library
- Bin Liu, Yue Cao, Mingsheng Long, Jianmin Wang, and Jingdong Wang. 2018. Deep triplet quantization. In Proceedings of the 26th ACM International Conference on Multimedia. 755–763.Google ScholarDigital Library
- Hong Liu, Rongrong Ji, Jingdong Wang, and Chunhua Shen. 2017. Ordinal constraint binary coding for approximate nearest neighbor search. In Proceedings of the 31st AAAI Conference on Artificial Intelligence. ACM, 2238–2244.Google Scholar
- Tie-Yan Liu. 2009. Learning to rank for information retrieval. Foundations and Trends® in Information Retrieval 3, 3 (2009), 225–331.Google Scholar
- Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, and Shih-Fu Chang. 2012. Supervised hashing with kernels. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE, 2074–2081.Google Scholar
- Wei Liu, Jun Wang, Sanjiv Kumar, and Shih-Fu Chang. 2011. Hashing with graphs. In Proceedings of the 28th International Conference on Machine Learning. 1–8.Google Scholar
- Xingbo Liu, Xiushan Nie, Haoliang Sun, Chaoran Cui, and Yilong Yin. 2019. Supervised short-length hashing. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. 3031–3037.Google ScholarCross Ref
- Xu Lu, Lei Zhu, Jingjing Li, Huaxiang Zhang, and Heng Tao Shen. 2019. Efficient supervised discrete multi-view hashing for large-scale multimedia search. IEEE Transactions on Multimedia 22, 8 (2020), 2048–2060. DOI:10.1109/TMM.2019.2947358Google ScholarCross Ref
- Zhi Lu, Yang Hu, Yunchao Jiang, Yan Chen, and Bing Zeng. 2019. Learning binary code for personalized fashion recommendation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 10562–10570.Google ScholarCross Ref
- Xin Luo, Liqiang Nie, Xiangnan He, Ye Wu, Zhen-Duo Chen, and Xin-Shun Xu. 2018. Fast scalable supervised hashing. In Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. 735–744.Google ScholarDigital Library
- Xin Luo, Peng-Fei Zhang, Zi Huang, Liqiang Nie, and Xin-Shun Xu. 2019. Discrete hashing with multiple supervision. IEEE Transactions on Image Processing 28, 6 (2019), 2962–2975.Google ScholarCross Ref
- Chao Ma, Chen Gong, Xiang Li, Xiaolin Huang, Wei Liu, and Jie Yang. 2020. Toward making unsupervised graph hashing discriminative. IEEE Transactions on Cybernetics 22, 3 (2020), 760–774.Google Scholar
- Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research 9, Nov (2008), 2579–2605.Google Scholar
- Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. 2008. Introduction to Information Retrieval. Cambridge University Press.Google Scholar
- Feiping Nie, Heng Huang, Xiao Cai, and Chris H Ding. 2010. Efficient and robust feature selection via joint -norms minimization. In Proceedings of the 23rd International Conference on Neural Information Processing Systems. 1813–1821.Google Scholar
- Mila Nikolova and Raymond H. Chan. 2007. The equivalence of half-quadratic minimization and the gradient linearization iteration. IEEE Transactions on Image Processing 16, 6 (2007), 1623–1627.Google ScholarDigital Library
- Fumin Shen, Yadong Mu, Yang Yang, Wei Liu, Li Liu, Jingkuan Song, and Heng Tao Shen Shen. 2017. Classification by retrieval: Binarizing data and classifier. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval. 595–604.Google ScholarDigital Library
- Fumin Shen, Chunhua Shen, Wei Liu, and Heng Tao Shen. 2015. Supervised discrete hashing. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 37–45.Google ScholarCross Ref
- Fumin Shen, Chunhua Shen, Qinfeng Shi, Anton van den Hengel, Zhenmin Tang, and Heng Tao Shen. 2015. Hashing on nonlinear manifolds. IEEE Transactions on Image Processing 24, 6 (2015), 1839–1851.Google ScholarDigital Library
- Dan Shi, Lei Zhu, Yikun Li, Jingjing Li, and Xiushan Nie. 2020. Robust structured graph clustering. IEEE Transactions on Neural Networks and Learning Systems 31, 11 (2020), 4424–4436.Google ScholarCross Ref
- Jingkuan Song, Tao He, Lianli Gao, Xing Xu, Alan Hanjalic, and Heng Tao Shen. 2020. Unified binary generative adversarial network for image retrieval and compression. International Journal of Computer Vision 128 (2020), 2243–2264.Google ScholarDigital Library
- Jingdong Wang, Ting Zhang, Nicu Sebe, and Heng Tao Shen. 2018. A survey on learning to hash. IEEE Transactions on Pattern Analysis and Machine Intelligence 40, 4 (2018), 769–790.Google ScholarCross Ref
- Ke Wang and Xin Geng. 2019. Discrete binary coding based label distribution learning. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. 3733–3739.Google ScholarCross Ref
- Yair Weiss, Antonio Torralba, and Rob Fergus. 2009. Spectral hashing. In Proceedings of the Neural Information Processing Systems. 1753–1760.Google Scholar
- Peichao Zhang, Wei Zhang, Wu-Jun Li, and Minyi Guo. 2014. Supervised hashing with latent factor models. In Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 173–182.Google ScholarDigital Library
- Zheng Zhang, Zhihui Lai, Zi Huang, Wai Keung Wong, Guo-Sen Xie, Li Liu, and Ling Shao. 2019. Scalable supervised asymmetric hashing with semantic and latent factor embedding. IEEE Transactions on Image Processing 28, 10 (2019), 4803–4818.Google ScholarCross Ref
- Zheng Zhang, Luyao Liu, Yadan Luo, Zi Huang, Fumin Shen, Heng Tao Shen, and Guangming Lu. 2020. Inductive structure consistent hashing via flexible semantic calibration. IEEE Transactions on Neural Networks and Learning Systems. DOI:10.1109/TNNLS.2020.3018790Google Scholar
- Zheng Zhang, Li Liu, Fumin Shen, Heng Tao Shen, and Ling Shao. 2019. Binary multi-view clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 41, 7 (2019), 1774–1782.Google ScholarCross Ref
- Zheng Zhang, Guo-sen Xie, Yang Li, Sheng Li, and Zi Huang. 2019. SADIH: Semantic-aware discrete hashing. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 5853–5860.Google ScholarCross Ref
- Han Zhu, Mingsheng Long, Jianmin Wang, and Yue Cao. 2016. Deep hashing network for efficient similarity retrieval. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 2415–2421.Google Scholar
- Xiatian Zhu, Botong Wu, Dongcheng Huang, and Wei-Shi Zheng. 2018. Fast open-world person re-identification. IEEE Transactions on Image Processing 27, 5 (2018), 2286–2300.Google ScholarDigital Library
Index Terms
- Probability Ordinal-Preserving Semantic Hashing for Large-Scale Image Retrieval
Recommendations
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrievalSimilarity search is a key challenge for multimedia retrieval applications where data are usually represented in high-dimensional space. Among various algorithms proposed for similarity search in high-dimensional space, Locality-Sensitive Hashing (LSH) ...
Image retrieval with query-adaptive hashing
Hashing-based approximate nearest-neighbor search may well realize scalable content-based image retrieval. The existing semantic-preserving hashing methods leverage the labeled data to learn a fixed set of semantic-aware hash functions. However, a fixed ...
Manhattan hashing for large-scale image retrieval
SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrievalHashing is used to learn binary-code representation for data with expectation of preserving the neighborhood structure in the original feature space. Due to its fast query speed and reduced storage cost, hashing has been widely used for efficient ...
Comments