Parallel syntactic thinning by recoding of binary pictures

Abstract In recoding with three bits the pixels of objects in binary images according to some measure of distance to the background, parallel thinning is achieved using syntactic rules. The codes in a 3 × 2 window are searched for interrelations which determine the new code of the central pixel. The local structure of the codes is determined through a binary cascade of tables. To each structure corresponds a rewriting rule. The new code is the output of the cascade. A two-scan postprocessing is needed to obtain a skeleton with linear structure.

[1]  Stefano Levialdi,et al.  Parallel thinning of binary pictures , 1975 .

[2]  Azriel Rosenfeld,et al.  Some Parallel Thinning Algorithms for Digital Pictures , 1971, JACM.

[3]  Luigi P. Cordella,et al.  From Local Maxima to Connected Skeletons , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Azriel Rosenfeld,et al.  A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..

[5]  Gabriella Sanniti di Baja,et al.  A thinning algorithm based on prominence detection , 1981, Pattern Recognit..