Deep Ordinal Hashing With Spatial Attention
2018 Β· Lu Jin, Xiangbo Shu, Kai Li, et al.
Abstract
Hashing has attracted increasing research attentions in recent years due to its high efficiency of computation and storage in image retrieval. Recent works have demonstrated the superiority of simultaneous feature representations and hash functions learning with deep neural networks. However, most existing deep hashing methods directly learn the hash functions by encoding the global semantic information, while ignoring the local spatial information of images. The loss of local spatial structure makes the performance bottleneck of hash functions, therefore limiting its application for accurate similarity retrieval. In this work, we propose a novel Deep Ordinal Hashing (DOH) method, which learns ordinal representations by leveraging the ranking structure of feature space from both local and global views. In particular, to effectively build the ranking structure, we propose to learn the rank correlation space by exploiting the local spatial information from Fully Convolutional Network (FC
Authors
(none)
Tags
Stats
Related papers
- Attribute-aware Deep Hashing With Self-consistency For Large-scale Fine-grained Image Retrieval (2023)11.76
- Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
- Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval (2019)0.00
- Attention-based Saliency Hashing For Ophthalmic Image Retrieval (2020)8.09
- Supervised Deep Hashing For Hierarchical Labeled Data (2017)8.09
- Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Deep Collaborative Discrete Hashing With Semantic-invariant Structure (2019)8.09