An efficient Exact-PGA algorithm for constant curvature manifolds

03/13/2016
by   Rudrasis Chakraborty, et al.
0

Manifold-valued datasets are widely encountered in many computer vision tasks. A non-linear analog of the PCA, called the Principal Geodesic Analysis (PGA) suited for data lying on Riemannian manifolds was reported in literature a decade ago. Since the objective function in PGA is highly non-linear and hard to solve efficiently in general, researchers have proposed a linear approximation. Though this linear approximation is easy to compute, it lacks accuracy especially when the data exhibits a large variance. Recently, an alternative called exact PGA was proposed which tries to solve the optimization without any linearization. For general Riemannian manifolds, though it gives better accuracy than the original (linearized) PGA, for data that exhibit large variance, the optimization is not computationally efficient. In this paper, we propose an efficient exact PGA for constant curvature Riemannian manifolds (CCM-EPGA). CCM-EPGA differs significantly from existing PGA algorithms in two aspects, (i) the distance between a given manifold-valued data point and the principal submanifold is computed analytically and thus no optimization is required as in existing methods. (ii) Unlike the existing PGA algorithms, the descent into codimension-1 submanifolds does not require any optimization but is accomplished through the use of the Rimeannian inverse Exponential map and the parallel transport operations. We present theoretical and experimental results for constant curvature Riemannian manifolds depicting favorable performance of CCM-EPGA compared to existing PGA algorithms. We also present data reconstruction from principal components and directions which has not been presented in literature in this setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2020

Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold

Riemannian optimization has drawn a lot of attention due to its wide app...
research
08/06/2020

Curvature-Dependant Global Convergence Rates for Optimization on Manifolds of Bounded Geometry

We give curvature-dependant convergence rates for the optimization of we...
research
12/24/2019

Constant index expectation curvature for graphs or Riemannian manifolds

An integral geometric curvature is defined as the index expectation K(x)...
research
06/01/2023

Curvature corrected tangent space-based approximation of manifold-valued data

When generalizing schemes for real-valued data approximation or decompos...
research
11/23/2017

Parallel transport in shape analysis: a scalable numerical scheme

The analysis of manifold-valued data requires efficient tools from Riema...
research
11/10/2018

R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent Rate

We study smooth stochastic optimization problems on Riemannian manifolds...
research
05/14/2021

Efficient Quasi-Geodesics on the Stiefel Manifold

Solving the so-called geodesic endpoint problem, i.e., finding a geodesi...

Please sign up or login with your details

Forgot password? Click here to reset