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
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 Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Deformations
Date
2009-05-28
Author
Erdem, Aykut
Tarı, Zehra Sibel
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
116
views
0
downloads
Cite This
Disconnected skeleton [1] is a very coarse yet a very stable skeleton-based representation scheme for generic shape recognition in which recognition is performed mainly based on the structure of disconnection points of extracted branches, without explicitly using information about boundary details [2,3]. However, sometimes sensitivity to boundary details may be required in order to achieve the goal of recognition. In this study, we first present a simple way to enrich disconnected skeletons with radius functions. Next, we attempt to resolve the conflicting goals of stability and sensitivity by proposing a coarse-to-fine shape matching algorithm. As the first step, two shapes are matched based oil the structure of their disconnected skeletons. and following to that the computed matching cost is re-evaluated by taking into account the similarity of boundary details in the light of class-specific boundary deformations which are learned from a given set of examples.
URI
https://hdl.handle.net/11511/53285
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Scale invariant representation of 2 5D data
AKAGUNDUZ, Erdem; ULUSOY PARNAS, İLKAY; BOZKURT, Nesli; Halıcı, Uğur (2007-06-13)
In this paper, a scale and orientation invariant feature representation for 2.5D objects is introduced, which may be used to classify, detect and recognize objects even under the cases of cluttering and/or occlusion. With this representation a 2.5D object is defined by an attributed graph structure, in which the nodes are the pit and peak regions on the surface. The attributes of the graph are the scales, positions and the normals of these pits and peaks. In order to detect these regions a "peakness" (or pi...
Improvement in non-linearity of carlet-feng infinite class of boolean functions
Khan, Mansoor Ahmed; Özbudak, Ferruh (2012-12-01)
In this paper we present a Walsh spectrum based method derived from the genetic hill climbing algorithm to improve the non-linearity of functions belonging to Carlet-Feng infinite class of Boolean functions, without degrading other cryptographic properties they possess. We implement our modified algorithms to verify the results and also present a comparison of the resultant cryptographic properties with the original functions.
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...
Incomplete-Leaf Multilevel Fast Multipole Algorithm for Multiscale Penetrable Objects Formulated With Volume Integral Equations
Takrimi, Manouchehr; Ergül, Özgür Salih; ERTÜRK, VAKUR BEHÇET (2017-09-01)
Recently introduced incomplete-leaf (IL) tree structures for multilevel fast multipole algorithm (referred to as IL-MLFMA) is proposed for the analysis of multiscale inhomogeneous penetrable objects, in which there are multiple orders of magnitude differences among the mesh sizes. Considering a maximum Schaubert-Wilton-Glisson function population threshold per box, only overcrowded boxes are recursively divided into proper smaller boxes, leading to IL tree structures consisting of variable box sizes. Such a...
Coloring 3D symmetry set: perceptual meaning and significance in 3D
Tarı, Zehra Sibel (1999-12-01)
A computational implementation for assigning perceptual meaning and significance to the points in the symmetry is presented. The coloring scheme allows recovery of the features of interest such as the shape skeletons from the complicated symmetry representation. The method is applicable to arbitrary data including color and multi-modality images. On the computational side, for a 256 × 256 binary image, two minutes on a low-end Pentium machine is enough to compute both the distance function and the colored n...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Erdem and Z. S. Tarı, “Coarse-to-Fine Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Deformations,” 2009, vol. 5534, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53285.
