Geodesic methods in computer vision and graphics
This monograph reviews both the theory and practice of the numerical computation of
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …
geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows …
Gromov–Wasserstein distances and the metric approach to object matching
F Mémoli - Foundations of computational mathematics, 2011 - Springer
This paper discusses certain modifications of the ideas concerning the Gromov–Hausdorff
distance which have the goal of modeling and tackling the practical problems of object …
distance which have the goal of modeling and tackling the practical problems of object …
Scale-invariant heat kernel signatures for non-rigid shape recognition
MM Bronstein, I Kokkinos - 2010 IEEE computer society …, 2010 - ieeexplore.ieee.org
One of the biggest challenges in non-rigid shape retrieval and comparison is the design of a
shape descriptor that would maintain invariance under a wide class of transformations the …
shape descriptor that would maintain invariance under a wide class of transformations the …
Shape google: Geometric words and expressions for invariant shape retrieval
The computer vision and pattern recognition communities have recently witnessed a surge
of feature-based methods in object recognition and image retrieval applications. These …
of feature-based methods in object recognition and image retrieval applications. These …
Laplace–Beltrami spectra as 'Shape-DNA'of surfaces and solids
This paper introduces a method to extract 'Shape-DNA', a numerical fingerprint or signature,
of any 2d or 3d manifold (surface or solid) by taking the eigenvalues (ie the spectrum) of its …
of any 2d or 3d manifold (surface or solid) by taking the eigenvalues (ie the spectrum) of its …
Laplace-Beltrami eigenfunctions for deformation invariant shape representation
RM Rustamov - Symposium on geometry processing, 2007 - scholar.archive.org
Proof: Suppose two distinct points have equal GPS values. Then their eigenfunctions have
equal value at these points. Thus given any function f, the eigenfunction expansion of f will …
equal value at these points. Thus given any function f, the eigenfunction expansion of f will …
Meshwalker: Deep mesh understanding by random walks
A Lahav, A Tal - ACM Transactions on Graphics (TOG), 2020 - dl.acm.org
Most attempts to represent 3D shapes for deep learning have focused on volumetric grids,
multi-view images and point clouds. In this paper we look at the most popular representation …
multi-view images and point clouds. In this paper we look at the most popular representation …
Spectral geometry processing with manifold harmonics
We present an explicit method to compute a generalization of the Fourier Transform on a
mesh. It is well known that the eigenfunctions of the Laplace Beltrami operator (Manifold …
mesh. It is well known that the eigenfunctions of the Laplace Beltrami operator (Manifold …
Local probabilistic models for link prediction
C Wang, V Satuluri… - … conference on data …, 2007 - ieeexplore.ieee.org
One of the core tasks in social network analysis is to predict the formation of links (ie various
types of relationships) over time. Previous research has generally represented the social …
types of relationships) over time. Previous research has generally represented the social …
Gromov‐Hausdorff stable signatures for shapes using persistence
We introduce a family of signatures for finite metric spaces, possibly endowed with real
valued functions, based on the persistence diagrams of suitable filtrations built on top of …
valued functions, based on the persistence diagrams of suitable filtrations built on top of …