返回
Margin-based two-stage supervised hashing for image retrieval
DOI:10.1016/j.neucom.2016.07.024.png)
摘要
En 中文
Similarity-preserving hashing is a widely used method for nearest neighbor search in large-scale image retrieval. Recently, supervised hashing methods are appealing in that they learn compact hash codes with fewer bits by incorporating supervised information. In this paper, we propose a new two-stage supervised hashing methods which decomposes the hash learning process into a stage of learning approximate hash codes followed by a stage of learning hash functions. In the first stage, we propose a margin-based objective to find approximate hash codes such that a pair of hash codes associating to a pair of similar (dissimilar) images has sufficiently small (large) Hamming distance. This objective results in a challenging optimization problem. We develop a coordinate descent algorithm to efficiently solve this optimization problem. In the second stage, we use convolutional neural networks to learn hash functions. We conduct extensive evaluations on several benchmark datasets with different kinds of images. The results show that the proposed margin-based hashing method has substantial improvement upon the state-of-the-art supervised or unsupervised hashing methods. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Deep learning
Image retrieval
Image hashing
Neural network
Optimization algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Designed Short Peptides that Form Amyloid‐Like Fibrils in Coassembly with Amyloid β‐Peptide (Aβ) Decrease the Toxicity of Aβ to Neuronal PC12 Cells
ChemBioChem
IF0
没有更多内容

