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 outperform classical implementations.

Citation:

Bolelli, Federico; Grana, Costantino "Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs" Image Analysis and Processing – ICIAP 2019, vol. 11752, Trento, Italy, pp. 148 -158 , Sep 9-13, 2019 DOI: 10.1007/978-3-030-30645-8_14

 not available

Paper download:

• Author version:
• DOI: 10.1007/978-3-030-30645-8_14