Bregman Divergences for Infinite Dimensional Covariance Matrices
Not on the map. Why?
Abstract (arXiv)
We introduce an approach to computing and comparing Covariance Descriptors (CovDs) in infinite-dimensional spaces. CovDs have become increasingly popular to address classification problems in computer vision. While CovDs offer some robustness to measurement variations, they also throw away part of the information contained in the original data by only retaining the second-order statistics over the measurements. Here, we propose to overcome this limitation by first mapping the original data to a high-dimensional Hilbert space, and only then compute the CovDs. We show that several Bregman divergences can be computed between the resulting CovDs in Hilbert space via the use of kernels. We then exploit these divergences for classification purposes. Our experiments demonstrate the benefits of our approach on several tasks, such as material and texture recognition, person re-identification, and action recognition from motion capture data.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Mar 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 1; 2023: 1; 2024: 0; 2025: 2; 2026: 3.
12 papers.
- 2021Anticipating human actions by correlating past with the future with Jaccard similarity measurescited by 36
- 2022Domain Adaptation for Time-Series Classification to Mitigate Covariate Shiftcited by 24
- 2021Distribution Knowledge Embedding for Graph Poolingcited by 19
- 2023The Representation Jensen-Shannon Divergencecited by 9
- 2025Evaluation of (Un-)Supervised Machine Learning Methods for GNSS Interference Classification with Real-World Data Discrepanciescited by 5
- 2021Estimation of Riemannian distances between covariance operators and Gaussian processescited by 3
- 2021Learning Log-Determinant Divergences for Positive Definite Matricescited by 2
- 2021Estimating 2-Sinkhorn Divergence between Gaussian Processes from Finite-Dimensional Marginalscited by 1
- 2025Conditionally Whitened Generative Models for Probabilistic Time Series Forecastingcited by 0
- 2026Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Whycited by 0
- 2026Generalising maximum mean discrepancy: kernelised functional Bregman divergencescited by 0
- 2026CPDA: Class-Conditional Path Distribution Alignment for Unsupervised Time-Series Domain Adaptationcited by 0
- 2026CPDA: Class-Conditional Path Distribution Alignment for Unsupervised Time-Series Domain Adaptation10 Aug 2026
- 2026Generalising maximum mean discrepancy: kernelised functional Bregman divergences27 Apr 2026
- 2026Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why30 Mar 2026
- 2025Conditionally Whitened Generative Models for Probabilistic Time Series Forecasting25 Sep 2025
- 2025Evaluation of (Un-)Supervised Machine Learning Methods for GNSS Interference Classification with Real-World Data Discrepancies31 Mar 2025
- 2023The Representation Jensen-Shannon Divergence25 May 2023
- 2022Domain Adaptation for Time-Series Classification to Mitigate Covariate Shift7 Apr 2022
- 2021Distribution Knowledge Embedding for Graph Pooling29 Sep 2021
- 2021Estimation of Riemannian distances between covariance operators and Gaussian processes26 Aug 2021
- 2021Anticipating human actions by correlating past with the future with Jaccard similarity measures26 May 2021
- 2021Learning Log-Determinant Divergences for Positive Definite Matrices13 Apr 2021
- 2021Estimating 2-Sinkhorn Divergence between Gaussian Processes from Finite-Dimensional Marginals5 Feb 2021