GRASSMANNIAN DIFFUSION MAPS-BASED DIMENSION REDUCTION AND CLASSIFICATION FOR HIGH-DIMENSIONAL DATA

Ketson R.M. dos Santos

doi:10.1137/20M137001X

GRASSMANNIAN DIFFUSION MAPS-BASED DIMENSION REDUCTION AND CLASSIFICATION FOR HIGH-DIMENSIONAL DATA

2022-03-15

9

OA

AI

K

Ketson R.M. dos Santos *

DOI：10.1137/20M137001X

Original

Original request for help

Save

Abstract

En 中文

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. The method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a toy example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last example, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

Keywords:

Grassmann manifold

diffusion maps

dimension reduction

data classification

face recognition

GRASSMANNIAN DIFFUSION MAPS-BASED DIMENSION REDUCTION AND CLASSIFICATION FOR HIGH-DIMENSIONAL DATA

Abstract

Journal

Organization

Cited Papers