Hierarchical learning of large-margin metrics for large-scale image classification

摘要

Large-scale image classification is a challenging task and has recently attracted active research interests. In this paper, a new algorithm is developed to achieve more effective implementation of large-scale image classification by hierarchical learning of large-margin metrics (HLMMs). A hierarchical visual tree is seamlessly integrated with metric learning to learn a set of node-specific/category-specific large margin metrics. First, a hierarchical visual tree is learned to characterize the inter-category visual correlations effectively and organize large numbers of image categories in a coarse-to-fine fashion. Second, a new algorithm is developed to support hierarchical learning of large-margin metrics by training nearest class mean (NCM) classifiers over our hierarchical visual tree. In addition, we also consider dimensionality reduction as a regularizer for high-dimensional data in our large-margin metric learning. Two top down approaches are developed for supporting hierarchical learning of large-margin metrics. We focus on learning more discriminative metrics for NCM node classifiers to identify the visually similar sub nodes (visually similar image categories) under the same parent node over our hierarchical visual tree. A mini-batch stochastic gradient descend method is used to optimize our HLMMs learning algorithm. The experimental results on ImageNet Large Scale Visual Recognition Challenge 2010 dataset (ILSVRC2010) have demonstrated that our HLMMs learning algorithm is very promising for supporting large-scale image classification. (C) 2016 Elsevier B.V. All rights reserved.