9 papers
Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once
Moritz Piening, Richard Duong, Gabriele Steidl
Flow matching has recently emerged as a flexible and efficient framework for generative modelling by learning deterministic transport dynamics between probability measures. In this…
Paired Wasserstein Autoencoders for Conditional Sampling
Moritz Piening, Matthias Chung
Generative autoencoders learn compact latent representations of data distributions through jointly optimized encoder--decoder pairs. In particular, Wasserstein autoencoders (WAEs)…
Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport
Moritz Piening, Robert Beinert
Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wass…
HOT-POT: Optimal Transport for Sparse Stereo Matching
Antonin Clerc, Michael Quellmalz, Moritz Piening +3
Stereo vision between images faces a range of challenges, including occlusions, motion, and camera distortions, across applications in autonomous driving, robotics, and face analys…
A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening, Robert Beinert
The Gromov--Wasserstein (GW) distance and its fused extension (FGW) are powerful tools for comparing heterogeneous data. Their computation is, however, challenging since both dista…
Slicing the Gaussian Mixture Wasserstein Distance
Moritz Piening, Robert Beinert
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 w…