Premium
Width‐independent fast skeletonization algorithm for binary pictures
Author(s) -
Kiyko V. M.,
Schlesinger M. I.
Publication year - 1991
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.1850030307
Subject(s) - skeletonization , tracing , computer science , binary number , pixel , binary image , algorithm , simple (philosophy) , image (mathematics) , artificial intelligence , simple algorithm , binary tree , image processing , computer vision , pattern recognition (psychology) , mathematics , arithmetic , philosophy , physics , epistemology , thermodynamics , operating system
An effective algorithm of skeletonization for digital binary pictures based on input‐time‐tracing principle and sequential decomposition of input picture into simple parts is described. The proposed algorithm is fast and requires no image memory. Its computing complexity does not depend on the thickness of picture patterns and is determined not by the number of picture pixels but by the essentially small number of horizontal and vertical lines constituting the contour of the picture.