3D Shape Correspondence by Isometry Driven Greedy Optimization

Date

2010-06-01

Author

Sahillioğlu, Yusuf

Metadata

Show full item record

Item Usage Stats

206
views

0
downloads

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 isometry cost via an iterative greedy algorithm in the original 3D Euclidean space. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes for some of which the ground-truth correspondence is available.

Subject Keywords

3D model retrieval, 3D Shape, 3D-Cad

URI

https://hdl.handle.net/11511/78613

DOI

https://doi.org/10.1109/CVPR.2010.5540178

Conference Name

IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

3B Izometrik Şekil Eşleme Sahillioğlu, Yusuf (2010-06-01) 3B izometrik şekiller arasındaki eşleme problemini ele alıyoruz. Önerdiğimiz yöntem, verilen iki izometrik şekil arasındaki izometrik sapmayı enküçülten optimal eşlemeyi otomatik olarak bulabilmektedir.İzometri hatasını iki adımda eniyiliyoruz. İlk adımda, şekil yüzeylerinden örneklenmiş bir örnek 3B noktalar kesel ilginlik bilgisine dayanarak spektral uzaya aktarılır.İlk eşleme spektral uzayda tam iki kısımlı bir çizge eşleştirme yöntemi kullanarak izometri hatasının polinom zamanda enküçültülmesiyle eld...
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 Under Topological Noise Genctav, Ash; Sahillioğlu, Yusuf; Tarı, Zehra Sibel (2016-05-19) In this work, we present a new approach for the problem of 3D shape correspondence under topological noise. Topological noise can be easily encountered in 3D models acquired by various ways such as motion capture technology. In our proposed approach, the pair of 3D shapes is brought to comparable topology before doing matching. We remove the connections leading to topological changes by moving the shape surface inward along the surface normal with a velocity relative to the curvature at each point. We emplo...
Detail-Preserving Mesh Unfolding for Nonrigid Shape Retrieval Sahillioğlu, Yusuf (2016-06-01) We present a shape deformation algorithm that unfolds any given 3D shape into a canonical pose that is invariant to nonrigid transformations. Unlike classical approaches, such as least-squares multidimensional scaling, we preserve the geometric details of the input shape in the resulting shape, which in turn leads to a content-based nonrigid shape retrieval application with higher accuracy. Our optimization framework, fed with a triangular or a tetrahedral mesh in 3D, tries to move each vertex as far away f...
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Sahillioğlu, Yusuf; Yemez, Y. (2011-08-01) 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...

Citation Formats

Y. Sahillioğlu, “3D Shape Correspondence by Isometry Driven Greedy Optimization,” San Francisco, CA; United States, 2010, p. 453, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/78613.