Title
Multiview Discrete Hashing for Scalable Multimedia Search.
Abstract
Hashing techniques have recently gained increasing research interest in multimedia studies. Most existing hashing methods only employ single features for hash code learning. Multiview data with each view corresponding to a type of feature generally provides more comprehensive information. How to efficiently integrate multiple views for learning compact hash codes still remains challenging. In this article, we propose a novel unsupervised hashing method, dubbed multiview discrete hashing (MvDH), by effectively exploring multiview data. Specifically, MvDH performs matrix factorization to generate the hash codes as the latent representations shared by multiple views, during which spectral clustering is performed simultaneously. The joint learning of hash codes and cluster labels enables that MvDH can generate more discriminative hash codes, which are optimal for classification. An efficient alternating algorithm is developed to solve the proposed optimization problem with guaranteed convergence and low computational complexity. The binary codes are optimized via the discrete cyclic coordinate descent (DCC) method to reduce the quantization errors. Extensive experimental results on three large-scale benchmark datasets demonstrate the superiority of the proposed method over several state-of-the-art methods in terms of both accuracy and scalability.
Year
DOI
Venue
2018
10.1145/3178119
ACM TIST
Keywords
Field
DocType
Hashing, multi-view, multimedia search
Spectral clustering,Data mining,Multimedia search,Computer science,Binary code,Hash function,Coordinate descent,Discriminative model,Optimization problem,Computational complexity theory
Journal
Volume
Issue
ISSN
9
5
2157-6904
Citations 
PageRank 
References 
18
0.56
40
Authors
6
Name
Order
Citations
PageRank
Xiao-Bo Shen120921.35
Fumin Shen2186891.49
Li Liu3126461.72
Yun-Hao Yuan423522.18
Weiwei Liu513515.52
Quansen Sun6122283.09