Abstract
Skeletonization is a crucial step in many digital image processing applications like medical imaging, pattern recognition, fingerprint classification etc. The skeleton expresses the structural connectivities of the main component of an object and is one pixel in width. Present paper covers the aspects of pixel deletion criteria in the skeletonization algorithms needed to preserve the connectivity, topology, sensitivity of the binary images. Performance of different skeletonization algorithms can be measured in terms of different parameters such as thinning rate, number of connected components, execution time etc. Present paper focuses on Peak Signal to Noise Ratio, number of connected components, execution time and Mean Square error on Zhang and Suen algorithm and Guo and Hall algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Signal Processing, Image Processing and Pattern Recognition
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
