We present a novel representation of maps between pairs of shapes that allows for efficient
inference and manipulation. Key to our approach is a generalization of the notion of map …

Three-dimensional surface registration transforms multiple three-dimensional data sets into
the same coordinate system so as to align overlap** components of these sets. Recent …

We review methods designed to compute correspondences between geometric shapes
represented by triangle meshes, contours or point sets. This survey is motivated in part by …

Graph matching (GM) is a fundamental problem in computer science, and it plays a central
role to solve correspondence problems in computer vision. GM problems that incorporate …

The computer vision and pattern recognition communities have recently witnessed a surge
of feature-based methods in object recognition and image retrieval applications. These …

In previous work on point registration, the input point sets are often represented using
Gaussian mixture models and the registration is then addressed through a probabilistic …

We present a simple and efficient method for refining maps or correspondences by iterative
upsampling in the spectral domain that can be implemented in a few lines of code. Our main …

Coherent point drift is a well-known algorithm for solving point set registration problems, ie,
finding corresponding points between shapes represented as point sets. Despite its …

The field of discrete calculus, also known as" discrete exterior calculus", focuses on finding a
proper set of definitions and differential operators that make it possible to operate the …

In this paper, we propose a generalization of convolutional neural networks (CNN) to non‐
Euclidean domains for the analysis of deformable shapes. Our construction is based on …