Abstract
Given a family of probability measures in P(χ), the space of probability measures on a Hilbert space χ, our goal in this paper is to highlight one ore more curves in P(χ) that summarize efficiently that family. We propose to study this problem under the optimal transport (Wasserstein) geometry, using curves that are restricted to be geodesic segments under that metric. We show that concepts that play a key role in Euclidean PCA, such as data centering or orthogonality of principal directions, find a natural equivalent in the optimal transport geometry, using Wasserstein means and differential geometry. The implementation of these ideas is, however, computationally challenging. To achieve scalable algorithms that can handle thousands of measures, we propose to use a relaxed definition for geodesics and regularized optimal transport distances. The interest of our approach is demonstrated on images seen either as shapes or color histograms.
| Original language | English |
|---|---|
| Pages (from-to) | 3312-3320 |
| Number of pages | 9 |
| Journal | Advances in Neural Information Processing Systems |
| Volume | 2015-January |
| Publication status | Published - 1 Jan 2015 |
| Externally published | Yes |
| Event | 29th Annual Conference on Neural Information Processing Systems, NIPS 2015 - Montreal, Canada Duration: 7 Dec 2015 → 12 Dec 2015 |
Fingerprint
Dive into the research topics of 'Principal geodesic analysis for probability measures under the optimal transport metric'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver