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.

Martin Bauer 0004

dblp:62/4807-4 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
6since 2021 · last 2025
0000-0001-7771-056XORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 6 · 4 first-author · 2 since 2021Artificial intelligence and machine learning · 5 · 2 first-author · 5 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.

Computer graphics and multimedia
3 papers
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
3D vision · 67% Face, body and person analysis · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
shape analysis
2.032025
Basis Restricted Elastic Shape Analysis on the Space of Unregistered Surfaces · Int. J. Comput. Vis. 2025
Elastic Shape Analysis of Surfaces with Second-Order Sobolev Metrics: A Comprehensive Numerical Framework · Int. J. Comput. Vis. 2023
A Numerical Framework for Elastic Surface Matching, Comparison, and Interpolation · Int. J. Comput. Vis. 2021
Geometric modeling and processing › shape analysis › non-rigid shape analysis
elastic shape analysis
1.522025
Basis Restricted Elastic Shape Analysis on the Space of Unregistered Surfaces · Int. J. Comput. Vis. 2025
Elastic Shape Analysis of Surfaces with Second-Order Sobolev Metrics: A Comprehensive Numerical Framework · Int. J. Comput. Vis. 2023
Mathematical optimization › optimal transport
gromov-wasserstein distance
0.912025
The Z-Gromov-Wasserstein Distance · J. Mach. Learn. Res. 2025
Mathematical optimization
optimal transport
0.912025
The Z-Gromov-Wasserstein Distance · J. Mach. Learn. Res. 2025
Geometric modeling and processing › shape matching
surface matching
0.722023
A Numerical Framework for Elastic Surface Matching, Comparison, and Interpolation · Int. J. Comput. Vis. 2021
Elastic Shape Analysis of Surfaces with Second-Order Sobolev Metrics: A Comprehensive Numerical Framework · Int. J. Comput. Vis. 2023
Computer vision › 3D vision
3d shape analysis
0.712023
BaRe-ESA: A Riemannian Framework for Unregistered Human Body Shapes · ICCV 2023
Computer vision › Face, body and person analysis › human body analysis
human body shape analysis
0.712023
BaRe-ESA: A Riemannian Framework for Unregistered Human Body Shapes · ICCV 2023
Computer vision › 3D vision › shape matching
shape registration
0.712023
BaRe-ESA: A Riemannian Framework for Unregistered Human Body Shapes · ICCV 2023
Geometric modeling and processing › shape deformation
shape interpolation
0.512021
A Numerical Framework for Elastic Surface Matching, Comparison, and Interpolation · Int. J. Comput. Vis. 2021
Geometric modeling and processing › shape registration
surface registration
0.312025
Basis Restricted Elastic Shape Analysis on the Space of Unregistered Surfaces · Int. J. Comput. Vis. 2025

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

riemannian geometry · 1.5elastic shape analysis · 1.2shape analysis · 0.9metric geometry · 0.9lower bound · 0.9varifold fidelity · 0.7tangent PCA · 0.7sobolev metrics · 0.7riemannian metric · 0.7latent space representation · 0.7diffeomorphic matching · 0.5
YearPublicationVenuePosition
2025 Basis Restricted Elastic Shape Analysis on the Space of Unregistered Surfaces
Emmanuel Hartman, Emery Pierson, Martin Bauer 0004, Mohamed Daoudi, Nicolas Charon
Int. J. Comput. Vis.3
2025 The Z-Gromov-Wasserstein Distance
abstract
The Gromov-Wasserstein (GW) distance is a powerful tool for comparing metric measure spaces which has found broad applications in data science and machine learning. Driven by the need to analyze data sets whose objects have increasingly complex structure (such as node and edge-attributed graphs), several variants of GW distance have been introduced in the recent literature. With a view toward establishing a general framework for the theory of GW-like distances, this paper considers a vast generalization of the notion of a metric measure space: for an arbitrary metric space $Z$, we define a $Z$-network to be a measure space endowed with a kernel valued in $Z$. We introduce a method for comparing $Z$-networks by defining a generalization of GW distance, which we refer to as $Z$-Gromov-Wasserstein ($Z$-GW) distance. This construction subsumes many previously known metrics and offers a unified approach to understanding their shared properties. This paper demonstrates that the $Z$-GW distance defines a metric on the space of $Z$-networks which retains desirable properties of $Z$, such as separability, completeness, and geodesicity. Many of these properties were unknown for existing variants of GW distance that fall under our framework. Our focus is on foundational theory, but our results also include computable lower bounds and approximations of the distance which will be useful for practical applications.
Martin Bauer 0004, Facundo Mémoli, Tom Needham, Mao Nishino
J. Mach. Learn. Res.1
2023 BaRe-ESA: A Riemannian Framework for Unregistered Human Body Shapes
abstract
We present Basis Restricted Elastic Shape Analysis (BaRe-ESA), a novel Riemannian framework for human body scan representation, interpolation and extrapolation. BaRe-ESA operates directly on unregistered meshes, i.e., without the need to establish prior point to point correspondences or to assume a consistent mesh structure. Our method relies on a latent space representation, which is equipped with a Riemannian (non-Euclidean) metric associated to an invariant higher-order metric on the space of surfaces. Experimental results on the FAUST and DFAUST datasets show that BaRe-ESA brings significant improvements with respect to previous solutions in terms of shape registration, interpolation and extrapolation. The efficiency and strength of our model is further demonstrated in applications such as motion transfer and random generation of body shape and pose.
Emmanuel Hartman, Emery Pierson, Martin Bauer 0004, Nicolas Charon, Mohamed Daoudi
ICCV3
2023 Elastic Shape Analysis of Surfaces with Second-Order Sobolev Metrics: A Comprehensive Numerical Framework
abstract
This paper introduces a set of numerical methods for Riemannian shape analysis of 3D surfaces within the setting of invariant (elastic) second-order Sobolev metrics. More specifically, we address the computation of geodesics and geodesic distances between parametrized or unparametrized immersed surfaces represented as 3D meshes. Building on this, we develop tools for the statistical shape analysis of sets of surfaces, including methods for estimating Karcher means and performing tangent PCA on shape populations, and for computing parallel transport along paths of surfaces. Our proposed approach fundamentally relies on a relaxed variational formulation for the geodesic matching problem via the use of varifold fidelity terms, which enable us to enforce reparametrization independence when computing geodesics between unparametrized surfaces, while also yielding versatile algorithms that allow us to compare surfaces with varying sampling or mesh structures. Importantly, we demonstrate how our relaxed variational framework can be extended to tackle partially observed data. The different benefits of our numerical pipeline are illustrated over various examples, synthetic and real. Supplementary Information: The online version contains supplementary material available at 10.1007/s11263-022-01743-0.
Emmanuel Hartman, Yashil Sukurdeep, Eric Klassen, Nicolas Charon, Martin Bauer 0004
Int. J. Comput. Vis.5
2022 A New Variational Model for Shape Graph Registration with Partial Matching Constraints
abstract
This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with partial matching constraints and topological inconsistencies. Weighted shape graphs are the union of an arbitrary number of component curves in Euclidean space with potential connectivity constraints between some of their boundary points, together with a weight function defined on each component curve. The framework of higher-order invariant Sobolev metrics is particularly well suited for constructing notions of distances and geodesics between unparametrized curves. The main difficulty in adapting this framework to the setting of shape graphs is the absence of topological consistency, which typically results in an inadequate search for an exact matching between two shape graphs. We overcome this hurdle by defining an inexact variational formulation of the matching problem between (weighted) shape graphs of any underlying topology, relying on the convenient measure representation given by varifolds to relax the exact matching constraint. We then prove the existence of minimizers to this variational problem when we choose Sobolev metrics of sufficient regularity and a total variation (TV) regularization on the weight function. We propose a numerical optimization approach which adapts the smoothed fast iterative shrinkage-thresholding algorithm (SFISTA) to deal with $TV$ norm minimization and allows us to reduce the matching problem to solving a sequence of smooth unconstrained minimization problems. We finally illustrate the capabilities of our new model through several examples showcasing its ability to tackle partially observed and topologically varying data.
Yashil Sukurdeep, Martin Bauer 0004, Nicolas Charon
SIAM J. Imaging Sci.2
2021 A Numerical Framework for Elastic Surface Matching, Comparison, and Interpolation
Martin Bauer 0004, Nicolas Charon, Philipp Harms, Hsi-Wei Hsieh
Int. J. Comput. Vis.1
2017 A Numerical Framework for Sobolev Metrics on the Space of Curves
abstract
Statistical shape analysis can be done in a Riemannian framework by endowing the set of shapes with a Riemannian metric. Sobolev metrics of order two and higher on shape spaces of parametrized or unparametrized curves have several desirable properties not present in lower order metrics, but their discretization is still largely missing. In this paper, we present algorithms to numerically solve the geodesic initial and boundary value problems for these metrics. The combination of these algorithms enables one to compute Karcher means in a Riemannian gradient-based optimization scheme and perform principal component analysis and clustering. Our framework is sufficiently general to be applicable to a wide class of metrics. We demonstrate the effectiveness of our approach by analyzing a collection of shapes representing HeLa cell nuclei.
Martin Bauer 0004, Martins Bruveris, Philipp Harms, Jakob Møller-Andersen
SIAM J. Imaging Sci.1
2015 Optical Flow on Moving Manifolds
abstract
Optical flow is a powerful tool for the study and analysis of motion in a sequence of images. In this paper we study a Horn--Schunck-type spatio-temporal regularization functional for image sequences that have a non-Euclidean, time varying image domain. To that end we construct a Riemannian metric that describes the deformation and structure of this evolving surface. The resulting functional can be seen as a natural geometric generalization of previous work by Weickert and Schnörr in 2001 and Lefèvre and Baillet in 2008 for static image domains. In this paper we show the existence and well-posedness of the corresponding optical flow problem and derive necessary and sufficient optimality conditions. We demonstrate the functionality of our approach in two experiments using both synthetic and real data.
Martin Bauer 0004, Markus Grasmair, Clemens Kirisits
SIAM J. Imaging Sci.1
2015 Diffeomorphic Density Matching by Optimal Information Transport
abstract
We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher--Rao information metric on the space of probability densities and right-invariant metrics on the infinite-dimensional manifold of diffeomorphisms. This optimal information transport, and modifications thereof, allow us to construct numerical algorithms for density matching. The algorithms are inherently more efficient than those based on optimal mass transport or diffeomorphic registration. Our methods have applications in medical image registration, texture mapping, image morphing, nonuniform random sampling, and mesh adaptivity. Some of these applications are illustrated in examples.
Martin Bauer 0004, Sarang C. Joshi, Klas Modin
SIAM J. Imaging Sci.1
2012 Almost Local Metrics on Shape Space of Hypersurfaces in n-Space
abstract
This paper extends parts of the results from [P. W. Michor and D. Mumford, Appl. Comput. Harmon. Anal., 23 (2007), pp. 74–113] for plane curves to the case of hypersurfaces in $\mathbb R^n$. Let M be a compact connected oriented $n-1$ dimensional manifold without boundary like the sphere or the torus. Then shape space is either the manifold of submanifolds of $\mathbb R^n$ of type M or the orbifold of immersions from M to $\mathbb R^n$ modulo the group of diffeomorphisms of M. We investigate almost local Riemannian metrics on shape space. These are induced by metrics of the following form on the space of immersions: $G_f(h,k) = \int_{M} \Phi(Vol(f),Tr(L))\bar{g}(h, k) vol(f^*\bar{g})$, where $\bar{g}$ is the Euclidean metric on $\mathbb R^n$, $f^*\bar{g}$ is the induced metric on M, $h,k\in C^\infty(M,\mathbb R^n)$ are tangent vectors at f to the space of embeddings or immersions, where $\Phi:\mathbb R^2\to \mathbb R_{>0}$ is a suitable smooth function, $Vol(f) = \int_M vol(f^*\bar{g})$ is the total hypersurface volume of $f(M)$, and the trace $Tr(L)$ of the Weingarten mapping is the mean curvature. For these metrics we compute the geodesic equations both on the space of immersions and on shape space, the conserved momenta arising from the obvious symmetries, and the sectional curvature. For special choices of $\Phi$ we give complete formulas for the sectional curvature. Numerical experiments illustrate the behavior of these metrics.
Martin Bauer 0004, Philipp Harms, Peter W. Michor
SIAM J. Imaging Sci.1