Advertisement

A Demonstration on Initial Segmentation Step on Closed Digital Planar Curve

  • R. MangayarkarasiEmail author
  • M. Vanitha
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1057)

Abstract

Polygonal approximation technique is used to represent boundary of a digital image, where the boundary is approximated using piece line segments to present the shape of the original boundary of a digital image. This paper uses the value of the turn angle between two line segments multiplied with the length of those line segments as a measure to detect good curvature points. The boundary acquisition technique produces boundary with many duplicate points. To expedite the process of obtaining final polygon, an initial segmentation step is mandatory. This paper demonstrates the contribution of initial segmentation by freeman chain code on the digital planar curves. The experimental results too support the same.

Keywords

Digital image Boundary Segmented points Chain code Polygon 

References

  1. 1.
    Teh, C.H., Chin, R.T.: On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. Mach. Intell. 11(8), 859–872 (1989)CrossRefGoogle Scholar
  2. 2.
    Yin, P.Y.: Algorithms for straight line fitting using k-means. Pattern Recogn. Lett. 19(1), 31–41 (1998)CrossRefGoogle Scholar
  3. 3.
    Kolesnikov, A., Fränti, P.: Polygonal approximation of closed discrete curves. Pattern Recogn. 40(4), 1282–1293 (2007)CrossRefGoogle Scholar
  4. 4.
    Kumar, M.P., Goyal, S., Jawahar, C.V., Narayanan, P.J.: Polygonal approximation of closed curves across multiple views. In: ICVGIP (2002)Google Scholar
  5. 5.
    Semyonov, P.A.: Optimized unjoined linear approximation and its application for Eog-biosignal processing. In: Engineering in Medicine and Biology Society, 1990., Proceedings of the Twelfth Annual International Conference of the IEEE (pp. 779–780). IEEE (1990, November)Google Scholar
  6. 6.
    Zygmunt, M.: Circular arc approximation using polygons. J. Comput. Appl. Math. 322, 81–85 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Aguilera-Aguilera, E.J., Carmona-Poyato, A., Madrid-Cuevas, F.J., Medina-Carnicer, R.: The computation of polygonal approximations for 2D contours based on a concavity tree. J. Vis. Commun. Image Represent. 25(8), 1905–1917 (2014)CrossRefGoogle Scholar
  8. 8.
    Freeman, H.: On the encoding of arbitrary geometric configurations. IEEE Trans. Electron. Comput. 10(2), 264–268 (1961)MathSciNetGoogle Scholar
  9. 9.
    Carmona-Poyato, A., Madrid-Cuevas, F.J., Medina-Carnicer, R., Muñoz-Salinas, R.: Polygonal approximation of digital planar curves through break point suppression. Pattern Recogn. 43(1), 14–25 (2010)CrossRefGoogle Scholar
  10. 10.
    Madrid-Cuevas, F.J., Aguilera-Aguilera, E.J., Carmona-Poyato, A., Muñoz-Salinas, R., Medina-Carnicer, R., Fernández-García, N.L.: An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves. J. Vis. Commun. Image Represent. 39, 152–163 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.SITEVellore Institute of TechnologyVelloreIndia

Personalised recommendations