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.
Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs / Bolelli, Federico; Grana, Costantino. - 11752(2019), pp. 148-158. ((Intervento presentato al convegno 20th International Conference on Image Analysis and Processing, ICIAP 2019 tenutosi a Trento, Italy nel Sep 9-13.
Data di pubblicazione: | 2019 |
Data di prima pubblicazione: | 2-set-2019 |
Titolo: | Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs |
Autore/i: | Bolelli, Federico; Grana, Costantino |
Autore/i UNIMORE: | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/978-3-030-30645-8_14 |
Codice identificativo Scopus: | 2-s2.0-85072897317 |
Codice identificativo ISI: | WOS:000562008400014 |
Nome del convegno: | 20th International Conference on Image Analysis and Processing, ICIAP 2019 |
Luogo del convegno: | Trento, Italy |
Data del convegno: | Sep 9-13 |
Serie: | LECTURE NOTES IN COMPUTER SCIENCE |
Volume: | 11752 |
Pagina iniziale: | 148 |
Pagina finale: | 158 |
Citazione: | Improving the Performance of Thinning Algorithms with Directed Rooted Acyclic Graphs / Bolelli, Federico; Grana, Costantino. - 11752(2019), pp. 148-158. ((Intervento presentato al convegno 20th International Conference on Image Analysis and Processing, ICIAP 2019 tenutosi a Trento, Italy nel Sep 9-13. |
Tipologia | Relazione in Atti di Convegno |
File in questo prodotto:
File | Descrizione | Tipologia | |
---|---|---|---|
2019_ICIAP_Improving_the_Performance_of_Thinning_Algorithms_with_Directed_Rooted_Acyclic_Graphs.pdf | Post-print dell'autore (bozza post referaggio) | Open Access Visualizza/Apri |

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris