Locality preserving projection on SPD matrix Lie group: algorithm and analysis

by   Yangyang Li, et al.

Symmetric positive definite (SPD) matrices used as feature descriptors in image recognition are usually high dimensional. Traditional manifold learning is only applicable for reducing the dimension of high-dimensional vector-form data. For high-dimensional SPD matrices, directly using manifold learning algorithms to reduce the dimension of matrix-form data is impossible. The SPD matrix must first be transformed into a long vector, and then the dimension of this vector must be reduced. However, this approach breaks the spatial structure of the SPD matrix space. To overcome this limitation, we propose a new dimension reduction algorithm on SPD matrix space to transform high-dimensional SPD matrices into low-dimensional SPD matrices. Our work is based on the fact that the set of all SPD matrices with the same size has a Lie group structure, and we aim to transform the manifold learning to the SPD matrix Lie group. We use the basic idea of the manifold learning algorithm called locality preserving projection (LPP) to construct the corresponding Laplacian matrix on the SPD matrix Lie group. Thus, we call our approach Lie-LPP to emphasize its Lie group character. We present a detailed algorithm analysis and show through experiments that Lie-LPP achieves effective results on human action recognition and human face recognition.


page 1

page 2

page 3

page 4


Deep Learning on Lie Groups for Skeleton-based Action Recognition

In recent years, skeleton-based action recognition has become a popular ...

Structure and approximation properties of Laplacian-like matrices

Many of today's problems require techniques that involve the solution of...

Unrolling Swiss Cheese: Metric repair on manifolds with holes

For many machine learning tasks, the input data lie on a low-dimensional...

Learning Locality-Constrained Collaborative Representation for Face Recognition

The model of low-dimensional manifold and sparse representation are two ...

Parametrization of Neural Networks with Connected Abelian Lie Groups as Data Manifold

Neural nets have been used in an elusive number of scientific discipline...

Data-Driven Projection for Reducing Dimensionality of Linear Programs: Generalization Bound and Learning Methods

This paper studies a simple data-driven approach to high-dimensional lin...

Learning a Lie Algebra from Unlabeled Data Pairs

Deep convolutional networks (convnets) show a remarkable ability to lear...

Please sign up or login with your details

Forgot password? Click here to reset