Back to Search
Start Over
Sequential Compact Code Learning for Unsupervised Image Hashing.
- Source :
- IEEE Transactions on Neural Networks & Learning Systems; Dec2016, Vol. 27 Issue 12, p2526-2536, 11p
- Publication Year :
- 2016
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
- Subjects :
- HASHING
GENETIC programming
IMAGE retrieval
Subjects
Details
- Language :
- English
- ISSN :
- 2162237X
- Volume :
- 27
- Issue :
- 12
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Neural Networks & Learning Systems
- Publication Type :
- Periodical
- Accession number :
- 119593047
- Full Text :
- https://doi.org/10.1109/TNNLS.2015.2495345