Journal of Computer Science

Error Free Iterative Morphological Decomposition Algorithm for Shape Representation

V. Vijaya Kumar, A. Srikrishna and G. Hemantha Kumar

DOI : 10.3844/jcssp.2009.71.78

Journal of Computer Science

Volume 5, Issue 1

Pages 71-78


Problem statement: A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One problem with several generalized Morphological skeleton transforms is that they generate noise after decomposition. The noise rate may not be effective for ordinary images; however this effect will be more when applied on printed or handwritten characters. Approach: The present study tackled this issue by applying a noise removal algorithm after morphological decomposition. Results: The algorithm was applied on various types of decomposition images. The Present method was compared with generalized skeleton algorithm and octagon-generating decomposition algorithm. Conclusion: The error rates with original image were evaluated using various error functions. The experimental results indicated that the present decomposition algorithm produces images with good clarity when compared with other algorithms.


© 2009 V. Vijaya Kumar, A. Srikrishna and G. Hemantha Kumar. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.