Manifold Based Local Classifiers: Linear and Nonlinear Approaches

Creative Commons License

ÇEVİKALP H., Larlus D., Neamtu M., Triggs B., Jurie F.

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, vol.61, no.1, pp.61-73, 2010 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 61 Issue: 1
  • Publication Date: 2010
  • Doi Number: 10.1007/s11265-008-0313-4
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.61-73
  • Keywords: Affine hull, Common vector, Convex hull, Distance learning, Image categorization, Local classifier, Manifold learning, Object recognition, DIMENSIONALITY, RECOGNITION
  • Eskisehir Osmangazi University Affiliated: Yes


In case of insufficient data samples in high-dimensional classification problems, sparse scatters of samples tend to have many 'holes'-regions that have few or no nearby training samples from the class. When such regions lie close to inter-class boundaries, the nearest neighbors of a query may lie in the wrong class, thus leading to errors in the Nearest Neighbor classification rule. The K-local hyperplane distance nearest neighbor (HKNN) algorithm tackles this problem by approximating each class with a smooth nonlinear manifold, which is considered to be locally linear. The method takes advantage of the local linearity assumption by using the distances from a query sample to the affine hulls of query's nearest neighbors for decision making. However, HKNN is limited to using the Euclidean distance metric, which is a significant limitation in practice. In this paper we reformulate HKNN in terms of subspaces, and propose a variant, the Local Discriminative Common Vector (LDCV) method, that is more suitable for classification tasks where the classes have similar intra-class variations. We then extend both methods to the nonlinear case by mapping the nearest neighbors into a higher-dimensional space where the linear manifolds are constructed. This procedure allows us to use a wide variety of distance functions in the process, while computing distances between the query sample and the nonlinear manifolds remains straightforward owing to the linear nature of the manifolds in the mapped space. We tested the proposed methods on several classification tasks, obtaining better results than both the Support Vector Machines (SVMs) and their local counterpart SVM-KNN on the USPS and Image segmentation databases, and outperforming the local SVM-KNN on the Caltech visual recognition database.