Deep asymmetric pairwise hashing
- Publication Type:
- Conference Proceeding
- Citation:
- MM 2017 - Proceedings of the 2017 ACM Multimedia Conference, 2017, pp. 1522 - 1530
- Issue Date:
- 2017-10-23
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| p1522-shen.pdf | Published version | 1.78 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017 ACM. Recently, deep neural networks based hashing methods have greatly improved the multimedia retrieval performance by simultaneously learning feature representations and binary hash functions. Inspired by the latest advance in the asymmetric hashing scheme, in this work, we propose a novel Deep Asymmetric Pairwise Hashing approach (DAPH) for supervised hashing. The core idea is that two deep convolutional models are jointly trained such that their output codes for a pair of images can well reveal the similarity indicated by their semantic labels. A pairwise loss is elaborately designed to preserve the pairwise similarities between images as well as incorporating the independence and balance hash code learning criteria. By taking advantage of the flexibility of asymmetric hash functions, we devise an efficient alternating algorithm to optimize the asymmetric deep hash functions and high-quality binary code jointly. Experiments on three image benchmarks show that DAPH achieves the state-of-the-art performance on large-scale image retrieval.
Please use this identifier to cite or link to this item: