Riemannian Manifold Learning for Nonlinear Dimensionality Reduction

Author(s):  
Tony Lin ◽  
Hongbin Zha ◽  
Sang Uk Lee
Author(s):  
Olga Mendoza-Schrock ◽  
Mateen M. Rizki ◽  
Vincent J. Velten

This article describes how transfer subspace learning has recently gained popularity for its ability to perform cross-dataset and cross-domain object recognition. The ability to leverage existing data without the need for additional data collections is attractive for monitoring and surveillance technology, specifically for aided target recognition applications. Transfer subspace learning enables the incorporation of sparse and dynamically collected data into existing systems that utilize large databases. Manifold learning has also gained popularity for its success at dimensionality reduction. In this contribution, Manifold learning and transfer subspace learning are combined to create a new system capable of achieving high target recognition rates. The manifold learning technique used in this contribution is diffusion maps, a nonlinear dimensionality reduction technique based on a heat diffusion analogy. The transfer subspace learning technique used is Transfer Fisher's Linear Discriminative Analysis. The new system, manifold transfer subspace learning, sequentially integrates manifold learning and transfer subspace learning. In this article, the ability of the new techniques to achieve high target recognition rates for cross-dataset and cross-domain applications is illustrated using a variety of diverse datasets.


Author(s):  
Juliana Valencia-Aguirre ◽  
Andrés Álvarez-Meza ◽  
Genaro Daza-Santacoloma ◽  
Carlos Acosta-Medina ◽  
César Germán Castellanos-Domínguez

2011 ◽  
Vol 403-408 ◽  
pp. 2679-2682
Author(s):  
Quan Sheng Jiang ◽  
Su Ping Li

Manifold learning algorithms are nonlinear dimensionality reduction algorithms rising in recent years. Laplacian Eigenmaps is a typical manifold learning algorithms. Aim to the difficulty of selecting neighborhood parameter on the algorithm, a neighborhood parameter optimization method based on classification criterion is proposed in the paper. From the point of the classification performance, the classification criterion function is constructed to reflect the distance of within-class and between-class. The optimization of the neighborhood is obtained according to the minimum of the criterion function. The experimental results on IRIS validate the optimization of the neighborhood and the effectiveness of feature classification.


Sign in / Sign up

Export Citation Format

Share Document