Accelerate Learning of Deep Hashing With Gradient Attention
Lists
Only you see this
Abstract
Recent years have witnessed the success of learning to hash in fast large-scale image retrieval. As deep learning has shown its superior performance on many computer vision applications, recent designs of learning-based hashing models have been moving from shallow ones to deep architectures. However, based on our analysis, we find that gradient descent based algorithms used in deep hashing models would potentially cause hash codes of a pair of training instances to be updated towards the directions of each other simultaneously during optimization. In the worst case, the paired hash codes switch their directions after update, and consequently, their corresponding distance in the Hamming space remain unchanged. This makes the overall learning process highly inefficient. To address this issue, we propose a new deep hashing model integrated with a novel gradient attention mechanism. Extensive experimental results on three benchmark datasets show that our proposed algorithm is able to accelerate the learning process and obtain competitive retrieval performance compared with state-of-the-art deep hashing models.
BibTeX
@inproceedings{huang2019accelerate,
author = {Long-Kai Huang and Jianda Chen and Sinno Jialin Pan},
title = {{Accelerate Learning of Deep Hashing With Gradient Attention}},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2019},
doi = {10.1109/iccv.2019.00537},
}Loading related content...