Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
From MaRDI portal
Publication:5419157
DOI10.1145/2517967zbMath1288.68240OpenAlexW2019115117MaRDI QIDQ5419157
Gary K. L. Tam, Ralph R. Martin, Yu-Kun Lai, Paul L. Rosin
Publication date: 5 June 2014
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa20809/Download/0020809-20042015231422.pdf
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Geodesics in global differential geometry (53C22) Approximation algorithms (68W25)
Related Items (2)
Non-rigid registration under anisotropic deformations ⋮ Consistent segment-wise matching with multi-layer graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear dimensionality reduction by topologically constrained isometric embedding
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
- Unsupervised learning for graph matching
- A spectral notion of Gromov-Wasserstein distance and related methods
- Numerical Geometry of Non-Rigid Shapes
- Sparse Models for Intrinsic Shape Correspondence
- Learning part-based templates from large collections of 3D shapes
- Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
This page was built for publication: Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry