Study of Some Thinning Algorithms and Their Analysis.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Electronics and Communication Sciences Unit (ECSU-Kolkata)


Pal, Srimanta (ECSU-Kolkata; ISI)

Abstract (Summary of the Work)

Thinning is one of the important low level segmentation procedures. On the other hand, numerous thinning algorithms have been proposed so far, but the main bottleneck is given below:a) Existing thinning algorithms are not generalised in the sense that a particular method may be suitable to a particular class of images but not to all kinds of images.b) A generalised model for measuring time complexity of thinning algorithms is absent. As a result, their performance can be compared in order to select with minimum time complexity with better skeletons.c) Most of the thinning algorithms are iterative approximation methods, when in most of the cases the shape of the skeletons are not preserved by the approximation method. As a result, inaccurate results are submitted to the next stage, thus error propagation has occurred. One model of analysis, based on Markov process method for conducting average care analysis of thinning algorithms in order to measure their performance have been proposed.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.