2003
DOI: 10.1016/s1077-2014(03)00016-0
|View full text |Cite
|
Sign up to set email alerts
|

Parallel implementation of exact dilations and multi-scale skeletonization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
4
0
1

Year Published

2005
2005
2019
2019

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 27 publications
1
4
0
1
Order By: Relevance
“…As expected, the thinning algorithm for the roots shown in Fig. 2b often displays the medial axis of the roots (Luppe et al, 2003), which is equivalent to the root length (Lebowitz, 1988;Kimura et al, 1999).…”
Section: Application Of Software In Image Samplessupporting
confidence: 61%
See 1 more Smart Citation
“…As expected, the thinning algorithm for the roots shown in Fig. 2b often displays the medial axis of the roots (Luppe et al, 2003), which is equivalent to the root length (Lebowitz, 1988;Kimura et al, 1999).…”
Section: Application Of Software In Image Samplessupporting
confidence: 61%
“…With the roots located in image, the edge detection method from the OpenCV library was applied to distinguish and label the objects (root segments). Then, each of labelled objects was skeletonized with a multi-scale thinning algorithm (Luppe et al, 2003). This method thins the objects in images by successive deletions of the edge of each object.…”
Section: Methodsmentioning
confidence: 99%
“…It is large potential to reduce the area of the PE if reducing some performance is acceptable for specified applications. In contrast with other works [ 13 , 25 21 ], our vision chip gets more efficient performance and programmability. That is benefit from the flexibility of gray-scale mathematical morphology.…”
Section: Discussion Of Performancementioning
confidence: 83%
“…Some application-specific vision chips performing low- and mid-level image processing were developed [ 9 – 12 ], but these chips were designed for specified applications and with a specified architecture. Another vision chip performing exact dilations was presented in [ 13 ], but this one focused on several specific algorithms, such as morphological dilation, multi-scale skeleton and Distance Transform [ 14 ]. They were not programmable or feasible for general purpose applications.…”
Section: Introductionmentioning
confidence: 99%
“…The program which computes this look-up table is very simple (see Annex). Notice that the same look-up table was used by Fontoura-Costa et al to compute an exact Euclidean dilation [17]. Once all decompositions are known, one must take into account the different symmetries of the space (their number is 8 for Z 2 , 48 for Z 3 ) and check those positions y which satisfy the second condition of prop.…”
Section: The Bisector Function: New Definition and Exact Algorithmmentioning
confidence: 99%