Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence

Date

2011-08-01

Author

Sahillioğlu, Yusuf
Yemez, Y.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

87
views

0
downloads

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.

Subject Keywords

3D shape correspondence-coarse-to-fine sampling, Categories and subject descriptors (according to ACM CCS), Combinatorial matching, I.3.5 [Computer graphics], Isometric dense shape correspondence

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85014435751&origin=inward
https://hdl.handle.net/11511/97071

Journal

COMPUTER GRAPHICS FORUM

DOI

https://doi.org/10.1111/j.1467-8659.2011.02020.x

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01) We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Coarse-to-fine surface reconstruction from silhouettes and range data using mesh deformation Sahillioğlu, Yusuf; Yemez, Y. (2010-03-01) We present a coarse-to-fine surface reconstruction method based on mesh deformation to build watertight surface models of complex objects from their silhouettes and range data. The deformable mesh, which initially represents the object visual hull, is iteratively displaced towards the triangulated range surface using the line-of-sight information. Each iteration of the deformation algorithm involves smoothing and restructuring operations to regularize the surface evolution process. We define a non-shrinking...
3D Correspondence by Breadth First Search Frontiers Sahillioğlu, Yusuf (null; 2009-06-01) This paper presents a novel, robust, and fast 3D shape correspondence algorithm applicable to the two snapshots of the same object in arbitrary deformation. Given two such frames as triangle meshes with fixed connectivity, our algorithm first classifies vertices into Breadth-First Search (BFS) frontiers according to their unweighted shortest path distance from a source vertex. This is followed by the rigid or non-rigid alignment of the corresponding frontiers of two meshes as the second and final step. This...
3D Shape Correspondence by Isometry Driven Greedy Optimization Sahillioğlu, Yusuf (null; 2010-06-01) 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...
Efficient Surface Integral Equation Methods for the Analysis of Complex Metamaterial Structures Yla-Oijala, Pasi; Ergül, Özgür Salih; Gurel, Levent; Taskinen, Matti (2009-03-27) Two approaches, the multilevel fast multipole algorithm with sparse approximate inverse preconditioner and the surface equivalence principle algorithm, are applied to analyze complex three-dimensional metamaterial structures. The efficiency and performance of these methods are studied and discussed.

Citation Formats

Y. Sahillioğlu and Y. Yemez, “Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence,” COMPUTER GRAPHICS FORUM, vol. 30, no. 5, pp. 1461–1470, 2011, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85014435751&origin=inward.