Detail-Preserving Mesh Unfolding for Nonrigid Shape Retrieval

Date

2016-06-01

Author

Sahillioğlu, Yusuf

Metadata

Show full item record

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

Item Usage Stats

179
views

0
downloads

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 from each other as possible subject to finite element regularization constraints. Intuitively this effort minimizes the bending over the shape while preserving the details. Avoiding geodesic distances in our computation renders the method robust to topological noise. Compared to state-of-the-art approaches, our method is simpler to implement, faster, more accurate in shape retrieval, and less sensitive to topological errors.

Subject Keywords

Nonrigid shape retrieval, detail preservation, Canonical pose, Shape Retrieval, Shape Representation

URI

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

Journal

ACM TRANSACTIONS ON GRAPHICS

DOI

https://doi.org/10.1145/2893477

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

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...
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 object representation using transform and scale invariant 3D features AKAGÜNDÜZ, Erdem; Ulusoy, İlkay (2007-10-21) An algorithm is proposed for 3D object representation using generic 3D features which are transformation and scale invariant. Descriptive 3D features and their relations are used to construct a graphical model for the object which is later trained and then used for detection purposes. Descriptive 3D features are the fundamental structures which are extracted from the surface of the 3D scanner output. This surface is described by mean and Gaussian curvature values at every data point at various scales and a ...
Part-based data-driven 3D shape interpolation Aydinlilar, Melike; Sahillioğlu, Yusuf (2021-07-01) An active problem in digital geometry processing is shape interpolation which aims to generate a continuous sequence of in-betweens for a given source and target shape. Unlike traditional approaches that interpolate source and target shapes in isolation, recent data-driven approaches utilize multiple interpolations through intermediate database shapes, and consequently perform better at the expense of a database requirement. In contrast to the existing data-driven approaches that consider intermediate shape...
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...

Citation Formats

Y. Sahillioğlu, “Detail-Preserving Mesh Unfolding for Nonrigid Shape Retrieval,” ACM TRANSACTIONS ON GRAPHICS, pp. 0–0, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42745.