Research Article Open Access

Error Free Iterative Morphological Decomposition Algorithm for Shape Representation

V. Vijaya Kumar1, A. Srikrishna2 and G. Hemantha Kumar1
  • 1 , Afganistan
  • 2 ,
Journal of Computer Science
Volume 5 No. 1, 2009, 71-78

DOI: https://doi.org/10.3844/jcssp.2009.71.78

Submitted On: 5 March 2009 Published On: 31 January 2009

How to Cite: Kumar, V. V., Srikrishna, A. & Kumar, G. H. (2009). Error Free Iterative Morphological Decomposition Algorithm for Shape Representation. Journal of Computer Science, 5(1), 71-78. https://doi.org/10.3844/jcssp.2009.71.78

Abstract

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.

  • 1,176 Views
  • 1,702 Downloads
  • 2 Citations

Download

Keywords

  • Shape
  • noise
  • printed hand written characters
  • error-rate
  • error functions