3D Shape Correspondence by Isometry-Driven Greedy Optimization

We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric shapes, that minimizes the amount of deviation from isometry. We cast the problem as a complete surface correspondence problem. Our method first divides the given shapes to be matched into surface patches of equal area and then seeks for a mapping between the patch centers which we refer to as base vertices. Hence the correspondence is established in a fast and robust manner at a relatively coarse level as imposed by the patch radius. We optimize the isometry cost in two steps. In the first step, the base vertices are transformed into spectral domain based on geodesic affinity, where the isometry errors are minimized in polynomial time by complete bipartite graph matching. The resulting correspondence serves as a good initialization for the second step of optimization in which we explicitly minimize the isome...

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Yusuf Sahillioglu, Yucel Yemez
• Keywords: Base Vertices, Computer Vision, CVPR 2010, Isometric Shapes, Isometry Cost