2019
DOI: 10.1007/978-3-030-30645-8_14
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs

Abstract: In this paper we propose a strategy to optimize the performance of thinning algorithms. This solution is obtained by combining three proven strategies for binary images neighborhood exploration, namely modeling the problem with an optimal decision tree, reusing pixels from the previous step of the algorithm, and reducing the code footprint by means of Directed Rooted Acyclic Graphs. A complete and open-source benchmarking suite is also provided. Experimental results confirm that the proposed algorithms clearly… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 28 publications
0
3
0
Order By: Relevance
“…In order to easily compare multiple algorithms, we modified an open source benchmarking framework for thinning algorithms, THeBE [35], and we adapted it to chain-code algorithms. The reference algorithm is the contours extraction algorithm implemented in OpenCV 3.4.7 (Suzuki85) [36], which uses an extremely optimized contour following approach, while the algorithm proposed by Cederberg [13] has been implemented in multiple variants, with increasing optimization of the status retrieval:…”
Section: Resultsmentioning
confidence: 99%
“…In order to easily compare multiple algorithms, we modified an open source benchmarking framework for thinning algorithms, THeBE [35], and we adapted it to chain-code algorithms. The reference algorithm is the contours extraction algorithm implemented in OpenCV 3.4.7 (Suzuki85) [36], which uses an extremely optimized contour following approach, while the algorithm proposed by Cederberg [13] has been implemented in multiple variants, with increasing optimization of the status retrieval:…”
Section: Resultsmentioning
confidence: 99%
“…Obviously, all the classic operations for image manipulation such as rotation, resizing, mirroring and colour space change are available. Extremely optimized processing functions, like noising, blurring, contour finding [26], image skeletonization [27] and connected components labelling [28] are implemented as well. ECVL image-processing operations can be applied on-the-fly during deep neural networks training to implement data augmentation.…”
Section: The European Computer Vision Librarymentioning
confidence: 99%
“…Of course, all the classic operations for image manipulation such as rotation, resizing, mirroring, and color space change are available. Processing functions, like noising, blurring, contour finding [8], image skeletonization [9], and connected components labeling [10], [11], [12] are implemented as well. A cross-platform GUI based on ECVL and wxWidgets [13] is also provided to allow simple exploration and test of ECVL functionalities.…”
Section: A Ecvl Image and Functionsmentioning
confidence: 99%