Scalable Supervised Asymmetric Hashing With Semantic and Latent Factor Embedding

• Published in: IEEE transactions on image processing 2019-10, Vol.28 (10), p.4803-4818
• Main Authors: Zhang, Zheng, Lai, Zhihui, Huang, Zi, Wong, Wai Keung, Xie, Guo-Sen, Liu, Li, Shao, Ling
• Format: Article
• Language: English
• Subjects: asymmetric hashing; Asymmetry; Binary code; Binary codes; Correlation; Degeneration; Embedding; Hash based algorithms; Image coding; Image retrieval; Optimization; Semantics; Similarity; supervised hashing; Task analysis
• ISSN: 1057-7149; 1941-0042
• DOI: 10.1109/TIP.2019.2912290

Compact hash code learning has been widely applied to fast similarity search owing to its significantly reduced storage and highly efficient query speed. However, it is still a challenging task to learn discriminative binary codes for perfectly preserving the full pairwise similarities embedded in the high-dimensional real-valued features, such that the promising performance can be guaranteed. To overcome this difficulty, in this paper, we propose a novel scalable supervised asymmetric hashing (SSAH) method, which can skillfully approximate the full-pairwise similarity matrix based on maximum asymmetric inner product of two different non-binary embeddings. In particular, to comprehensively explore the semantic information of data, the supervised label information and the refined latent feature embedding are simultaneously considered to construct the high-quality hashing function and boost the discriminant of the learned binary codes. Specifically, SSAH learns two distinctive hashing functions in conjunction of minimizing the regression loss on the semantic label alignment and the encoding loss on the refined latent features. More importantly, instead of using only part of similarity correlations of data, the full-pairwise similarity matrix is directly utilized to avoid information loss and performance degeneration, and its cumbersome computation complexity on n × n matrix can be dexterously manipulated during the optimization phase. Furthermore, an efficient alternating optimization scheme with guaranteed convergence is designed to address the resulting discrete optimization problem. The encouraging experimental results on diverse benchmark datasets demonstrate the superiority of the proposed SSAH method in comparison with many recently proposed hashing algorithms.