Affordable Access

deepdyve-link
Publisher Website

Deep Heterogeneous Hashing for Face Video Retrieval.

Authors
  • Qiao, Shishi
  • Wang, Ruiping
  • Shan, Shiguang
  • Chen, Xilin
Type
Published Article
Journal
IEEE Transactions on Image Processing
Publisher
Institute of Electrical and Electronics Engineers
Publication Date
Sep 16, 2019
Identifiers
DOI: 10.1109/TIP.2019.2940683
PMID: 31535997
Source
Medline
Language
English
License
Unknown

Abstract

Retrieving videos of a particular person with face image as query via hashing technique has many important applications. While face images are typically represented as vectors in Euclidean space, characterizing face videos with some robust set modeling techniques (e.g. covariance matrices as exploited in this study, which reside on Riemannian manifold), has recently shown appealing advantages. This hence results in a thorny heterogeneous spaces matching problem. Moreover, hashing with handcrafted features as done in many existing works is clearly inadequate to achieve desirable performance for this task. To address such problems, we present an end-toend Deep Heterogeneous Hashing (DHH) method that integrates three stages including image feature learning, video modeling, and heterogeneous hashing in a single framework, to learn unified binary codes for both face images and videos. To tackle the key challenge of hashing on manifold, a well-studied Riemannian kernel mapping is employed to project data (i.e. covariance matrices) into Euclidean space and thus enables to embed the two heterogeneous representations into a common Hamming space, where both intra-space discriminability and inter-space compatibility are considered. To perform network optimization, the gradient of the kernel mapping is innovatively derived via structured matrix backpropagation in a theoretically principled way. Experiments on three challenging datasets show that our method achieves quite competitive performance compared with existing hashing methods.

Report this publication

Statistics

Seen <100 times