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.

}, isbn = {978-1-4673-8032-4}, doi = {10.1109/ISPA.2015.7306077}, author = {K{\'a}lm{\'a}n Pal{\'a}gyi and G{\'a}bor N{\'e}meth and P{\'e}ter Kardos}, editor = {S Loncaric and D Lerski and H Eskola and R Bregovic} }