We propose a new efficient approach for neighborhood exploration, optimized with decision tables and decision trees, suitable for local algorithms in image processing. In this work, it is employed to speed up two widely used thinning techniques. The performance gain is shown over a large freely available dataset of scanned document images.
Decision Trees for Fast Thinning Algorithms / Grana, Costantino; Borghesani, Daniele; Cucchiara, Rita. - STAMPA. - (2010), pp. 2836-2839. (Intervento presentato al convegno 2010 20th International Conference on Pattern Recognition, ICPR 2010 tenutosi a Istanbul, tur nel Aug 23-27) [10.1109/ICPR.2010.695].
Decision Trees for Fast Thinning Algorithms
GRANA, Costantino;BORGHESANI, Daniele;CUCCHIARA, Rita
2010
Abstract
We propose a new efficient approach for neighborhood exploration, optimized with decision tables and decision trees, suitable for local algorithms in image processing. In this work, it is employed to speed up two widely used thinning techniques. The performance gain is shown over a large freely available dataset of scanned document images.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
