Rapid Grassmannian Averaging with Chebyshev Polynomials
Rapid Grassmannian Averaging with Chebyshev Polynomials
We propose new algorithms to efficiently average a collection of points on a Grassmannian manifold in both the centralized and decentralized settings. Grassmannian points are used ubiquitously in machine learning, computer vision, and signal processing to represent data through (often low-dimensional) subspaces. While averaging these points is crucial to many …