Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
Date
2013-02-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
147
views
0
downloads
Cite This
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 dense correspondence algorithm with state-of-the-art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance-wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta-approach that can be applied to other multi-resolution shape matching algorithms, as we also demonstrate by experiments.
Subject Keywords
combinatorial matching
,
isometric dense shape correspondence
,
symmetric flips
URI
https://hdl.handle.net/11511/97195
Journal
COMPUTER GRAPHICS FORUM
DOI
https://doi.org/10.1111/cgf.12007
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
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...
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.
Shape recognition with generalized beam angle statistics
Tola, OO; Arica, N; Yarman Vural, Fatoş Tunay (2004-04-30)
In this study, we develop a new shape descriptor and matching algorithm in order to find a given template shape in an edge detected image without performing boundary extraction. The shape descriptor based on Generalized Beam Angle Statistics (GBAS) defines the angles between the lines connecting each boundary point with the rest of the points, as random variable. Then, it assigns a feature vector to each point using the moments of beam angles. The proposed matching algorithm performs shape recognition by ma...
Shape recognition with generalized beam angle statistics
Tola, OO; Arica, N; Yarman-Vural, F (2004-01-01)
In this study, we develop a new shape descriptor and a matching algorithm in order to find a given template shape in an edge detected image without extracting the boundary. The shape descriptor based on Generalized Beam Angle Statistics (GBAS) defines the angles between the lines connecting each boundary point with the rest of the points, as random variable. Then, it assigns a feature vector to each point using the moments of beam angles. The proposed matching algorithm performs shape recognition by matchin...
Dense depth map estimation for multiple view coding
Ozkalayci, Burak; Alatan, Abdullah Aydın (2006-01-01)
In this paper the basics of a proposed method that handles the stereo and especially multiple view coding problem in a geometrical way, are explained. For this purpose, estimation of the depth maps of the multiple views, captured by fully calibrated cameras, are done. In depth map estimation problem Markov Random Field modelling is used to have a depth map in a desired smoothness and in an efficient coding fashion. The geometric structure which is acquired by the depth map estimation, is used to reconstruct...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Y. Sahillioğlu and Y. Yemez, “Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips,”
COMPUTER GRAPHICS FORUM
, vol. 32, no. 1, pp. 177–189, 2013, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/97195.