Thomas Dagès

dblp:245/9167 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0002-0803-9300ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 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%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Databases, data mining, and information retrieval
1 paper
Graph data management · 50% Knowledge graphs · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.912025
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding · CVPR 2025
Algorithms and data structures › numerical linear algebra › dimensionality reduction › nonlinear dimensionality reduction
manifold learning
0.912025
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding · CVPR 2025
Algorithms and data structures › numerical linear algebra › dimensionality reduction
multidimensional scaling
0.912025
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding · CVPR 2025
Geometric modeling and processing › discrete geometry › discrete differential geometry
differential geometry
0.812024
Finsler-Laplace-Beltrami Operators with Application to Shape Analysis · CVPR 2024
Geometric modeling and processing › collision detection › distance computation
geodesic distance
0.812024
Wormhole Loss for Partial Shape Matching · NeurIPS 2024
Geometric modeling and processing › shape matching
partial shape matching
0.812024
Wormhole Loss for Partial Shape Matching · NeurIPS 2024
Geometric modeling and processing
shape analysis
0.812024
Finsler-Laplace-Beltrami Operators with Application to Shape Analysis · CVPR 2024
Geometric modeling and processing
shape correspondence
0.812024
Finsler-Laplace-Beltrami Operators with Application to Shape Analysis · CVPR 2024
Geometric modeling and processing
shape descriptor
0.812024
Finsler-Laplace-Beltrami Operators with Application to Shape Analysis · CVPR 2024
Geometric modeling and processing
shape matching
0.812024
Wormhole Loss for Partial Shape Matching · NeurIPS 2024
Graph data management
graph embedding
0.312025
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding · CVPR 2025
Knowledge graphs
link prediction
0.312025
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding · CVPR 2025

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

riemannian manifold optimization · 1.7finsler geometry · 1.7metric convolutions · 0.9neural network training · 0.8loss function · 0.8isometry · 0.8finsler heat kernel · 0.8anisotropic laplace-beltrami operator · 0.8
YearPublicationVenuePosition
2025 Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding
abstract
Dimensionality reduction is a fundamental task that aims to simplify complex data by reducing its feature dimensionality while preserving essential patterns, with core applications in data analysis and visualisation. To preserve the underlying data structure, multi-dimensional scaling (MDS) methods focus on preserving pairwise dissimilarities, such as distances. They optimise the embedding to have pairwise distances as close as possible to the data dissimilarities. However, the current standard is limited to embedding data in Riemannian manifolds. Motivated by the lack of asymmetry in the Riemannian metric of the embedding space, this paper extends the MDS problem to a natural asymmetric generalisation of Riemannian manifolds called Finsler manifolds. Inspired by Euclidean space, we define a canonical Finsler space for embedding asymmetric data. Due to its simplicity with respect to geodesics, data representation in this space is both intuitive and simple to analyse. We demonstrate that our generalisation benefits from the same theoretical convergence guarantees. We reveal the effectiveness of our Finsler embedding across various types of non-symmetric data, highlighting its value in applications such as data visualisation, dimensionality reduction, directed graph embedding, and link prediction.
Thomas Dagès, Simon Weber 0002, Ya-Wei Eileen Lin, Ronen Talmon, Daniel Cremers, Michael Lindenbaum, Alfred M. Bruckstein, Ron Kimmel
CVPR1
2025 Metric Convolutions: A Unifying Theory to Adaptive Image Convolutions
Thomas Dagès, Michael Lindenbaum, Alfred M. Bruckstein
ICCV1
2025 A model is worth tens of thousands of examples for estimation and thousands for classification
Thomas Dagès, Laurent D. Cohen, Alfred M. Bruckstein
Pattern Recognit.1
2024 On Unsupervised Partial Shape Correspondence
Amit Bracha, Thomas Dagès, Ron Kimmel
ACCV (9)2
2024 Finsler-Laplace-Beltrami Operators with Application to Shape Analysis
abstract
The Laplace-Beltrami operator (LBO) emerges from studying manifolds equipped with a Riemannian metric. It is often called the swiss army knife of geometry processing as it allows to capture intrinsic shape information and gives rise to heat diffusion, geodesic distances, and a mul-titude of shape descriptors. It also plays a central role in geometric deep learning. In this work, we explore Finsler manifolds as a generalization of Riemannian manifolds. We revisit the Finsler heat equation and derive a Finsler heat kernel and a Finsler-Laplace-Beltrami Operator (FLBO): a novel theoretically justified anisotropic Laplace-Beltrami operator (ALBO). In experimental evaluations we demon-strate that the proposed FLBO is a valuable alternative to the traditional Riemannian-based LBO and ALBOs for spa-tialfiltering and shape correspondence estimation. We hope that the proposed Finsler heat kernel and the FLBO will inspire further exploration of Finsler geometry in the Computer vision community.
Simon Weber 0002, Thomas Dagès, Maolin Gao, Daniel Cremers
CVPR2
2024 Wormhole Loss for Partial Shape Matching
abstract
When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of whether distances measured between pairs of surface points should influence the matching process. The approach we propose treats surfaces as manifolds equipped with geodesic distances, and addresses the partial shape matching challenge by introducing a novel criterion to meticulously search for consistent distances between pairs of points. The new criterion explores the relation between intrinsic geodesic distances between the points, geodesic distances between the points and surface boundaries, and extrinsic distances between boundary points measured in the embedding space. It is shown to be less restrictive compared to previous measures and achieves state-of-the-art results when used as a loss function in training networks for partial shape matching.
Amit Bracha, Thomas Dagès, Ron Kimmel
NeurIPS2