2015
DOI: 10.1007/978-3-319-20801-5_46
|View full text |Cite
|
Sign up to set email alerts
|

Graph Structuring of Skeleton Object for Its High-Level Exploitation

Abstract: Abstract. Skeletonization is a morphological operation that summarizes an object by its median lines while preserving the initial image topology. It provides features used in biometric for the matching process, as well as medical imaging for quantification of the bone microarchitecture. We develop a solution for the extraction of structural and morphometric features useful in biometric, character recognition and medical imaging. It aims at storing object descriptors in a re-usable and hierarchical format. We p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…To address this, we incorporate an additional step that refines and thins the seam detection predictions. We use a relatively straightforward adaptation of the idea of skeletonization of graphs and images [Abu-Ain et al 2013;Youssef et al 2015]. This first requires the estimated edge probabilities to be converted to a probability value per vertex, which is simply the maximum probability of any edge incident on the vertex.…”
Section: Distortion Minimizing Steiner Treementioning
confidence: 99%
See 1 more Smart Citation
“…To address this, we incorporate an additional step that refines and thins the seam detection predictions. We use a relatively straightforward adaptation of the idea of skeletonization of graphs and images [Abu-Ain et al 2013;Youssef et al 2015]. This first requires the estimated edge probabilities to be converted to a probability value per vertex, which is simply the maximum probability of any edge incident on the vertex.…”
Section: Distortion Minimizing Steiner Treementioning
confidence: 99%
“…Moreover, the supervised nature of these algorithms enables the proposed method to reproduce similar styles on test objects, a feature that artists are always looking for. In addition, the translation of the distortion minimization task to the graph learning context allows us to propose a post-processing algorithm based on the Steiner tree problem [Sheffer and Hart 2002] and skeletonization [Abu-Ain et al 2013;Youssef et al 2015]. The post-processing step helps to produce seams that align with semantic boundaries and reduces the number of shells.…”
Section: Introductionmentioning
confidence: 99%
“…However, their approach is only motivated by the visually similar skeleton graphs, without considering the topological graph structure. Youssef R et al [17] found that the graph representation algorithm is widely investigated regarding matching issues, due to the correspondence between skeleton branches with graph edges and nodes is natural and intuitive. However, the solutions in the literature are based on shock graphs [18] or attributed relational graphs [19] which are only used in certain application domains and usually with higher time complexity.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we match scratches without distinction based on skeletonization and KNN algorithm. In general, scratch maps are usually irregular pixels that do not have meaningful mathematical and geometrical interpretation, which could be extracted skeleton by [19,20]. And similar scratch segments are matched using the KNN algorithm.…”
Section: Introductionmentioning
confidence: 99%