返回
Sequential Compact Code Learning for Unsupervised Image Hashing
DOI:10.1109/TNNLS.2015.2495345.png)
摘要
En 中文
Effective hashing for large-scale image databases is a popular research area, attracting much attention in computer vision and visual information retrieval. Several recent methods attempt to learn either graph embedding or semantic coding for fast and accurate applications. In this paper, a novel unsupervised framework, termed evolutionary compact embedding (ECE), is introduced to automatically learn the task-specific binary hash codes. It can be regarded as an optimization algorithm that combines the genetic programming (GP) and a boosting trick. In our architecture, each bit of ECE is iteratively computed using a weak binary classification function, which is generated through GP evolving by jointly minimizing its empirical risk with the AdaBoost strategy on a training set. We address this as greedy optimization by embedding high-dimensional data points into a similarity-preserved Hamming space with a low dimension. We systematically evaluate ECE on two data sets, SIFT 1M and GIST 1M, showing the effectiveness and the accuracy of our method for a large-scale similarity search.
Keyword:
AdaBoost
binary hash codes
genetic programming (GP)
large-scale similarity search
unsupervised
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
Erratum: “A Two-Dimensional Model for Steel Corrosion Under a Disbonded Coating Due to Oxygen With or Without Cathodic Protection—Part 1: Full Numerical Solution” (Vol. 62, No. 8, p. 676–686)
Corrosion
IF0

