Journal
INFORMATION SCIENCES
Volume 316, Issue -, Pages 567-581Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2014.06.030
Keywords
Dimensionality reduction; Large-scale image classification; Evolutionary compact embedding; Genetic programming; AdaBoost
Categories
Funding
- University of Sheffield
- National Natural Science Foundation of China [61125106]
- Key Research Program of the Chinese Academy of Sciences [KGZD-EW-T03]
Ask authors/readers for more resources
Effective dimensionality reduction is a classical research area for many large-scale analysis tasks in computer vision. Several recent methods attempt to learn either graph embedding or binary hashing for fast and accurate applications. In this paper, we propose a novel framework to automatically learn the task-specific compact coding, called evolutionary compact embedding (ECE), which can be regarded as an optimization algorithm combining genetic programming (GP) and a boosting trick. As an evolutionary computation methodology, GP can solve problems inspired by natural evolution without any prior knowledge of the solutions. In our evolutionary architecture, each bit of ECE is iteratively computed using a 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 leading to small Hamming distances for similar samples and large distances for dissimilar samples. We then evaluate ECE on four image datasets: USPS digital hand-writing, CMU PIE face, CIFAR-10 tiny image and SUN397 scene, showing the accurate and robust performance of our method for large-scale image classification. (C) 2014 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available