TY - CONF T1 - Topology-Preserving Equivalent Parallel and Sequential 4-Subiteration 2D Thinning Algorithms T2 - Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on Y1 - 2015 A1 - Kálmán Palágyi A1 - Gábor Németh A1 - Péter Kardos ED - S Loncaric ED - D Lerski ED - H Eskola ED - R Bregovic AB -

Thinning is a frequently applied technique for extracting centerlines from 2D binary objects. Parallel thinning algorithms can remove a set of object points simultaneously, while sequential algorithms traverse the boundary of objects, and consider the actually visited single point for possible removal. Two thinning algorithms are called equivalent if they produce the same result for each input picture. This paper presents the very first pair of equivalent 2D sequential and parallel subiteration-based thinning algorithms. These algorithms can be implemented directly on a conventional sequential computer or on a parallel computing device. Both of them preserve topology for (8, 4) pictures sampled on the square grid.

JF - Image and Signal Processing and Analysis (ISPA), 2015 9th International Symposium on PB - IEEE CY - Zagreb, Croatia SN - 978-1-4673-8032-4 ER -