A heuristic method for initial dominant point detection for polygonal approximations

  • S. KalaivaniEmail author
  • Bimal Kumar Ray


This paper presents a novel initial dominant point detection technique for polygonal approximation in digital planar curves. This technique concentrates on the local and global deviation of the curve and detects the dominant point of the polygon. An iterative split and merge strategy is used effectively to insert and/or delete vertex during the approximation of the polygon. Since the internal steps are automated, a symmetric and better approximation is achieved. The technique is robust to rotation and noise of the shape and produces better results compared to the results obtained by recent work. The performance of the proposed system is evaluated using the benchmark data set and the same is compared in terms of the quantitative and qualitative measures. The experimental results show that proposed technique has outperformed an existing similar method with respect to visual perception and numeric metrics.


Polygonal approximation Digital planar curve Dominant points Local deviation Global deviation Break points Split and merge 


Compliance with ethical standards

Conflict of interest

The authors do not have any conflicts of interest to declare.


  1. Aguilera-Aguilera EJ, Carmona-Poyato A, Madrid-Cuevas FJ, Muñoz-Salinas R (2015) Novel method to obtain the optimal polygonal approximation of digital planar curves based on mixed integer programming. J Vis Commun Image Represent 30:106–116CrossRefGoogle Scholar
  2. Backe André Ricardo, Bruno Odemir Martinez (2013) Polygonal approximation of digital planar curves through vertex betweenness. Inf Sci 222:795–804MathSciNetCrossRefzbMATHGoogle Scholar
  3. Bellman Richard (1961) On the approximation of curves by line segments using dynamic programming. Commun ACM 4(6):284CrossRefzbMATHGoogle Scholar
  4. Carmona-Poyato A, Fernandez-Garcia NL, Medina-Carnicer R, Madrid-Cuevas FJ (2005) Dominant point detection: a new proposal. Image Vis Comput 23:1226–1236CrossRefGoogle Scholar
  5. Carmona-Poyato A, Madrid-Cuevas F, Medina-Carnicer R, Muñoz Salinas R (2010) Polygonal approximation of digital planar curves through break point suppression. Pattern Recognit 43(1):14–25CrossRefzbMATHGoogle Scholar
  6. Carmona-Poyato A, Medina-Carnicer R, Madrid-Cuevas FJ, Muñoz-Salinas R, Fernández-García NL (2011) A new measurement for assessing polygonal approximation of curves. Pattern Recognit 4:44–54. Google Scholar
  7. Chau CP, Siu WC (2001) New nonparametric dominant point detection algorithm. Vis Image Signal Process IEE Proc 148(5):363–374CrossRefGoogle Scholar
  8. Cherkassky BV, Goldberg AV, Radzik T (1994) Shortest paths algorithms: theory and experimental evaluation. In: SODA: ACM-SIAM symposium on discrete algorithms (a conference on theoretical and experimental analysis of discrete algorithms)Google Scholar
  9. Douglas DH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartogr Int J Geogr Inf Geovisual 10(2):112–122. Google Scholar
  10. Fernández-García NL, Del-Moral Martínez L, Carmona-Poyato A, Madrid-Cuevas FJ, Medina-Carnicer R (2016) A new thresholding approach for automatic generation of polygonal approximations. J Vis Commun Image Represent 35:155–168CrossRefGoogle Scholar
  11. Freeman H (1961) On the encoding of arbitrary geometric configurations. IEEE Trans Electron Comput 10:260–268MathSciNetCrossRefGoogle Scholar
  12. Hosur PI, Kai-Kuang M (1999) A novel scheme for progressive polygon approximation of shape contours. In: IEEE 3rd workshop on multimedia, signal process, pp 309–314Google Scholar
  13. Jeannin S, Bober M (1999) Description of core experiments for MPEG-7 motion/shape, MPEG-7, ISO/IEC/JTC1/SC29/WG11/MPEG99/N2690, SeoulGoogle Scholar
  14. Kolesnikov A (2012) ISE-bounded polygonal approximation of digital curves. Pattern Recognit Lett 33(10):1329–1337CrossRefGoogle Scholar
  15. Kolesnikov A, Kauranne T (2014) Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling. Pattern Recognit 47:623–633. CrossRefzbMATHGoogle Scholar
  16. Madrid-Cuevas FJ, Aguilera-Aguilera EJ, Carmona-Poyato A, Muñoz-Salinas R, Medina-Carnicer R, Fernández-García NL (2016) An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves. J Vis Commun Image Represent 39:152–163CrossRefGoogle Scholar
  17. Marji M, Siy P (2003) A new algorithm for dominant point detection and polygonization of digital curves. Pattern Recognit 36:2239–2251CrossRefzbMATHGoogle Scholar
  18. Marji M, Siy P (2004) Polygonal representation of digital planar curves through dominant point detection—a nonparametric algorithm. Pattern Recognit 37(11):2113–2130CrossRefGoogle Scholar
  19. Masood A (2008) Optimized polygonal approximation by dominant point deletion. Pattern Recognit 41:227–239CrossRefzbMATHGoogle Scholar
  20. Montanari U (1970) A note on minimal length polygonal approximation to a digitized contour. Commun ACM 13:41–47MathSciNetCrossRefzbMATHGoogle Scholar
  21. MPEG-7 Core Experiment CE-Shape-1 Test Set (Part B), benchmarking image database for shape recognition techniques.
  22. Nguyen TP, Debled-Rennesson I (2011) A discrete geometry approach for dominant point detection. Pattern Recognit 44(1):32–44CrossRefzbMATHGoogle Scholar
  23. Parvez MT (2015) Optimized polygonal approximations through vertex relocations in contour neighborhoods. Image Vis Comput 34:1–10CrossRefGoogle Scholar
  24. Parvez MT, Mahmoud SA (2010) Polygonal approximation of digital planar curves through adaptive optimizations. Pattern Recogn Lett 31(13):1997–2005CrossRefGoogle Scholar
  25. Perez JC, Vidal E (1994) Optimum polygonal approximation of digitized curves. Pattern Recognit Lett 15:743–750CrossRefzbMATHGoogle Scholar
  26. Prasad DK, Leung MK, Quek C, Cho S-Y (2012) A novel framework for making dominant point detection methods non-parametric. Image Vis Comput 30(11):843–859CrossRefGoogle Scholar
  27. Ramer U (1972) An iterative procedure for the polygonal approximation of plane curves. Comput Graph Image Process 1(3):244–256. CrossRefGoogle Scholar
  28. Rosin PL (1997) Techniques for assessing polygonal approximations of curves. IEEE Trans Pattern Anal Mach Intell 19:659–666. CrossRefGoogle Scholar
  29. Stone Henry (1961) Approximation of curves by line segments. Math Comput 15:40–47MathSciNetCrossRefzbMATHGoogle Scholar
  30. Teh CH, Chin RT (1989) On the detection of dominant points on digital curves. IEEE Trans Pattern Anal Mach Intell 11:859–872CrossRefGoogle Scholar
  31. Wu W-Y (2003) An adaptive method for detecting dominant points. Pattern Recognit 36(10):2231–2237CrossRefzbMATHGoogle Scholar
  32. Zhu Y, Seneviratne LD (1997) Optimal polygonal approximation of digitised curves. IEEE Proc Vis Image Signal Process 144(1):8–14CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Information Technology and EngineeringVellore Institute of TechnologyVelloreIndia

Personalised recommendations