Cross-View Retrieval via Probability-Based Semantics-Preserving Hashing

Zijia Lin

doi:10.1109/TCYB.2016.2608906

2017-12-01

161

Zijia Lin

丁贵广 (Guiguang Ding) *

韩

韩军功 (Jungong Han)

王建民 (Jianmin Wang)

DOI：10.1109/TCYB.2016.2608906

原文链接

查看原文

摘要

En 中文

For efficiently retrieving nearest neighbors from large-scale multiview data, recently hashing methods are widely investigated, which can substantially improve query speeds. In this paper, we propose an effective probability-based semantics-preserving hashing (SePH) method to tackle the problem of cross-view retrieval. Considering the semantic consistency between views, SePH generates one unified hash code for all observed views of any instance. For training, SePH first transforms the given semantic affinities of training data into a probability distribution, and aims to approximate it with another one in Hamming space, via minimizing their Kullback-Leibler divergence. Specifically, the latter probability distribution is derived from all pair-wise Hamming distances between to-be-learnt hash codes of the training data. Then with learnt hash codes, any kind of predictive models like linear ridge regression, logistic regression, or kernel logistic regression, can be learnt as hash functions in each view for projecting the corresponding view-specific features into hash codes. As for out-of-sample extension, given any unseen instance, the learnt hash functions in its observed views can predict view-specific hash codes. Then by deriving or estimating the corresponding output probabilities with respect to the predicted view-specific hash codes, a novel probabilistic approach is further proposed to utilize them for determining a unified hash code. To evaluate the proposed SePH, we conduct extensive experiments on diverse benchmark datasets, and the experimental results demonstrate that SePH is reasonable and effective.

Keyword:

Approximate nearest neighbor (ANN) retrieval

cross-view retrieval

semantics-preserving hashing (SePH)