Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Moritz Piening

dblp:365/9570 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0003-3877-4511ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 83% Computational geometry · 17%
Artificial intelligence
2 papers
Representation and self-supervised learning · 30% Face, body and person analysis · 23% Generative modeling · 23%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

Topics — the 10 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › optimal transport
gromov-wasserstein distance
1.922026
A Novel Sliced Fused Gromov-Wasserstein Distance · AAAI 2026
Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization · ICML 2025
Mathematical optimization
optimal transport
1.922026
A Novel Sliced Fused Gromov-Wasserstein Distance · AAAI 2026
Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization · ICML 2025
Computational geometry
distance computation
1.012026
A Novel Sliced Fused Gromov-Wasserstein Distance · AAAI 2026
Mathematical optimization › optimal transport
sliced optimal transport
1.012026
A Novel Sliced Fused Gromov-Wasserstein Distance · AAAI 2026
Machine learning › Transfer learning and domain adaptation
domain alignment
0.912025
Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization · ICML 2025
Computer vision › Face, body and person analysis
face alignment
0.912025
T-FAKE: Synthesizing Thermal Images for Facial Landmarking · CVPR 2025
Machine learning › Generative modeling
image generation
0.912025
T-FAKE: Synthesizing Thermal Images for Facial Landmarking · CVPR 2025
Machine learning › Representation and self-supervised learning
metric embedding
0.912025
Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization · ICML 2025
Multimedia analysis and retrieval › multimedia retrieval › content-based retrieval
shape retrieval
0.312026
A Novel Sliced Fused Gromov-Wasserstein Distance · AAAI 2026
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
multidimensional scaling
0.312025
Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization · ICML 2025

Methods — techniques the papers use, named apart from their topics

slicing technique · 2.0quadrature rules · 2.0hierarchical optimal transport · 2.0unbalanced optimal transport · 1.7block coordinate descent · 1.7bi-convex relaxation · 1.7wasserstein distance · 0.9style transfer · 0.9probabilistic landmark prediction · 0.9label adaptation · 0.9RGB2Thermal loss · 0.9
YearPublicationVenuePosition
2026 A Novel Sliced Fused Gromov-Wasserstein Distance
abstract
The Gromov–Wasserstein (GW) distance and its fused extension (FGW) are powerful tools for comparing heterogeneous data. Their computation is, however, challenging since both distances are based on non-convex, quadratic optimal transport (OT) problems. Leveraging 1D OT, a sliced version of GW has been proposed to lower the computational burden. Unfortunately, this sliced version is restricted to Euclidean geometry and loses invariance to isometries, strongly limiting its application in practice. To overcome these issues, we propose a novel slicing technique for GW as well as for FGW that is based on an appropriate lower bound, hierarchical OT, and suitable quadrature rules for the underlying 1D OT problems. Our novel sliced FGW significantly reduces the numerical effort while remaining invariant to isometric transformations and allowing the comparison of arbitrary geometries. We show that our new distance actually defines a pseudo-metric for structured spaces that bounds FGW from below and study its interpolation properties between sliced Wasserstein and GW. Since we avoid the underlying quadratic program, our sliced distance is numerically more robust and reliable than the original GW and FGW distance; especially in the context of shape retrieval and graph isomorphism testing.
Moritz Piening, Robert Beinert
AAAI1
2025 T-FAKE: Synthesizing Thermal Images for Facial Landmarking
abstract
Facial analysis is a key component in a wide range of applications such as healthcare, autonomous driving, and entertainment. Despite the availability of various facial RGB datasets, the thermal modality, which plays a crucial role in life sciences, medicine, and biometrics, has been largely overlooked. To address this gap, we introduce the T-FAKE dataset, a new large-scale synthetic thermal dataset with sparse and dense landmarks. To facilitate the creation of the dataset, we propose a novel RGB2Thermal loss function, which enables the domain-adaptive transfer of RGB faces to thermal style. By utilizing the Wasserstein distance between thermal and RGB patches and the statistical analysis of clinical temperature distributions on faces, we ensure that the generated thermal images closely resemble real samples. Using RGB2Thermal style transfer based on our RGB2Thermal loss function, we create the large-scale synthetic thermal T-FAKE dataset†with landmark and segmentation annotations. Leveraging our novel T-FAKE dataset, probabilistic landmark prediction, and label adaptation networks, we demonstrate significant improvements in landmark detection methods on thermal images across different landmark conventions. Our models show excellent performance with both sparse 70-point landmarks and dense 478-point landmark annotations. Moreover, our RGB2Thermal loss leads to notable results in terms of perceptual evaluation and temperature prediction.
Philipp Flotho, Moritz Piening, Anna Kukleva, Gabriele Steidl
CVPR2
2025 Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov-Wasserstein Marginal Penalization
abstract
We propose a new approach for unsupervised alignment of heterogeneous datasets, which maps data from two different domains without any known correspondences to a common metric space. Our method is based on an unbalanced optimal transport problem with Gromov-Wasserstein marginal penalization. It can be seen as a counterpart to the recently introduced joint multidimensional scaling method. We prove that there exists a minimizer of our functional and that for penalization parameters going to infinity, the corresponding sequence of minimizers converges to a minimizer of the so-called embedded Wasserstein distance. Our model can be reformulated as a quadratic, multi-marginal, unbalanced optimal transport problem, for which a bi-convex relaxation admits a numerical solver via block-coordinate descent. We provide numerical examples for joint embeddings in Euclidean as well as non-Euclidean spaces.
Florian Beier, Moritz Piening, Robert Beinert, Gabriele Steidl
ICML2