TY - JOUR
T1 - Unsupervised Deep Video Hashing via Balanced Code for Large-Scale Video Retrieval
AU - Wu, Gengshen
AU - Han, Jungong
AU - Guo, Yuchen
AU - Liu, Li
AU - Ding, Guiguang
AU - Ni, Qiang
AU - Shao, Ling
N1 - Funding Information:
Manuscript received February 16, 2018; revised July 15, 2018 and October 3, 2018; accepted November 2, 2018. Date of publication November 19, 2018; date of current version December 12, 2018. This work was supported in part by the Royal Society Newton Mobility Grant under Grant IE150997, in part by the Shenzhen Government under Grant GJHZ20180419190732022, and in part by the National Natural Science Foundation of China under Grant 61773301 and Grant 61571269. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Xudong Jiang. (Gengshen Wu and Jungong Han contributed equally to this work.) (Corresponding author: Guiguang Ding.) G. Wu, J. Han, and Q. Ni are with the School of Computing and Communication, Lancaster University, Lancaster LA1 4YW, U.K. (e-mail: [email protected]; [email protected]; q.ni@lancaster. ac.uk).
Publisher Copyright:
© 1992-2012 IEEE.
PY - 2019/4/30
Y1 - 2019/4/30
N2 - This paper proposes a deep hashing framework, namely Unsupervised Deep Video Hashing (UDVH), for largescale video similarity search with the aim to learn compact yet effective binary codes. Our UDVH produces the hash codes in a self-taught manner by jointly integrating discriminative video representation with optimal code learning, where an efficient alternating approach is adopted to optimize the objective function. The key differences from most existing video hashing methods lie in 1) UDVH is an unsupervised hashing method that generates hash codes by cooperatively utilizing feature clustering and a specifically-designed binarization with the original neighborhood structure preserved in the binary space; 2) a specific rotation is developed and applied onto video features such that the variance of each dimension can be balanced, thus facilitating the subsequent quantization step. Extensive experiments performed on three popular video datasets show that UDVH is overwhelmingly better than the state-of-the-arts in terms of various evaluation metrics, which makes it practical in real-world applications.
AB - This paper proposes a deep hashing framework, namely Unsupervised Deep Video Hashing (UDVH), for largescale video similarity search with the aim to learn compact yet effective binary codes. Our UDVH produces the hash codes in a self-taught manner by jointly integrating discriminative video representation with optimal code learning, where an efficient alternating approach is adopted to optimize the objective function. The key differences from most existing video hashing methods lie in 1) UDVH is an unsupervised hashing method that generates hash codes by cooperatively utilizing feature clustering and a specifically-designed binarization with the original neighborhood structure preserved in the binary space; 2) a specific rotation is developed and applied onto video features such that the variance of each dimension can be balanced, thus facilitating the subsequent quantization step. Extensive experiments performed on three popular video datasets show that UDVH is overwhelmingly better than the state-of-the-arts in terms of various evaluation metrics, which makes it practical in real-world applications.
KW - Video hashing
KW - balanced rotation
KW - deep learning
KW - feature representation
KW - similarity retrieval
UR - http://www.scopus.com/inward/record.url?scp=85056716190&partnerID=8YFLogxK
U2 - 10.1109/TIP.2018.2882155
DO - 10.1109/TIP.2018.2882155
M3 - Article
C2 - 30452370
SN - 1947-0042
VL - 28
SP - 1993
EP - 2007
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 4
M1 - 8540456
ER -