Premium
Coarse‐to‐Fine Combinatorial Matching for Dense Isometric Shape Correspondence
Author(s) -
Sahillioǧlu Y.,
Yemez Y.
Publication year - 2011
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2011.02020.x
Subject(s) - isometric exercise , initialization , isometry (riemannian geometry) , distortion (music) , matching (statistics) , computer science , mathematics , algorithm , euclidean geometry , euclidean space , geometry , combinatorics , mathematical analysis , medicine , amplifier , computer network , statistics , bandwidth (computing) , programming language , physical therapy
We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse‐to‐fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum‐distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes.