The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems
We investigate properties of some extensions of a class of Fourier-based probability metrics, originally introduced to study convergence to equilibrium for the solution to the spatially homogeneous Boltzmann equation. At difference with the original one, the new Fourier-based metrics are well-defined also for probability distributions with different centers of mass, and for discrete probability measures supported over a regular grid. Among other properties, it is shown that, in the discrete setting, these new Fourier-based metrics are equivalent either to the Euclidean-Wasserstein distance $W_2$, or to the Kantorovich-Wasserstein distance $W_1$, with explicit constants of equivalence. Numerical results then show that in benchmark problems of image processing, Fourier metrics provide a better runtime with respect to Wasserstein ones.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Generalization and Regularization via Wasserstein Distributionally Robust Optimization
Wasserstein distributionally robust optimization (DRO) has gained prominence in operations research and machine learning as a powerful method for achieving solutions with favorable out-of-sample performance. Two compelli…
Generalization BoundsSlicing the Gaussian Mixture Wasserstein Distance
Gaussian mixture models (GMMs) are widely used in machine learning for tasks such as clustering, classification, image reconstruction, and generative modeling. A key challenge in working with GMMs is defining a computati…
ClusteringComputational EfficiencyDomain AdaptationImage ReconstructionAll You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs
The fields of effective resistance and optimal transport on graphs are filled with rich connections to combinatorics, geometry, machine learning, and beyond. In this article we put forth a bold claim: that the two fields…
AllFast alignment of heterogeneous images in sliced Wasserstein distance
Many applications of computer vision rely on the alignment of similar but non-identical images. We present a fast algorithm for aligning heterogeneous images based on optimal transport. Our approach combines the speed of…
The Wasserstein-Fourier Distance for Stationary Time Series
We propose the Wasserstein-Fourier (WF) distance to measure the (dis)similarity between time series by quantifying the displacement of their energy across frequencies. The WF distance operates by calculating the Wasserst…
Data AugmentationDimensionality ReductionTime SeriesTime Series Analysis+1