Skip to main content
SpringerLink
Log in

A heuristic method for initial dominant point detection for polygonal approximations

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • 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–116

    Article  Google Scholar 

  • Backe André Ricardo, Bruno Odemir Martinez (2013) Polygonal approximation of digital planar curves through vertex betweenness. Inf Sci 222:795–804

    Article  MathSciNet  MATH  Google Scholar 

  • Bellman Richard (1961) On the approximation of curves by line segments using dynamic programming. Commun ACM 4(6):284

    Article  MATH  Google Scholar 

  • Carmona-Poyato A, Fernandez-Garcia NL, Medina-Carnicer R, Madrid-Cuevas FJ (2005) Dominant point detection: a new proposal. Image Vis Comput 23:1226–1236

    Article  Google Scholar 

  • 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–25

    Article  MATH  Google Scholar 

  • 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. https://doi.org/10.1016/j.patcog.2010.07.029

    Google Scholar 

  • Chau CP, Siu WC (2001) New nonparametric dominant point detection algorithm. Vis Image Signal Process IEE Proc 148(5):363–374

    Article  Google Scholar 

  • 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)

  • 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. https://doi.org/10.3138/FM57-6770-U75U-7727

    Google Scholar 

  • 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–168

    Article  Google Scholar 

  • Freeman H (1961) On the encoding of arbitrary geometric configurations. IEEE Trans Electron Comput 10:260–268

    Article  MathSciNet  Google Scholar 

  • 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–314

  • Jeannin S, Bober M (1999) Description of core experiments for MPEG-7 motion/shape, MPEG-7, ISO/IEC/JTC1/SC29/WG11/MPEG99/N2690, Seoul

  • Kolesnikov A (2012) ISE-bounded polygonal approximation of digital curves. Pattern Recognit Lett 33(10):1329–1337

    Article  Google Scholar 

  • Kolesnikov A, Kauranne T (2014) Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling. Pattern Recognit 47:623–633. https://doi.org/10.1016/j.patcog.2013.09.002

    Article  MATH  Google Scholar 

  • 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–163

    Article  Google Scholar 

  • Marji M, Siy P (2003) A new algorithm for dominant point detection and polygonization of digital curves. Pattern Recognit 36:2239–2251

    Article  MATH  Google Scholar 

  • Marji M, Siy P (2004) Polygonal representation of digital planar curves through dominant point detection—a nonparametric algorithm. Pattern Recognit 37(11):2113–2130

    Article  Google Scholar 

  • Masood A (2008) Optimized polygonal approximation by dominant point deletion. Pattern Recognit 41:227–239

    Article  MATH  Google Scholar 

  • Montanari U (1970) A note on minimal length polygonal approximation to a digitized contour. Commun ACM 13:41–47

    Article  MathSciNet  MATH  Google Scholar 

  • MPEG-7 Core Experiment CE-Shape-1 Test Set (Part B), benchmarking image database for shape recognition techniques. http://www.cis.temple.edu/~latecki/TestData/mpeg7shapeB.tar.gz

  • Nguyen TP, Debled-Rennesson I (2011) A discrete geometry approach for dominant point detection. Pattern Recognit 44(1):32–44

    Article  MATH  Google Scholar 

  • Parvez MT (2015) Optimized polygonal approximations through vertex relocations in contour neighborhoods. Image Vis Comput 34:1–10

    Article  Google Scholar 

  • Parvez MT, Mahmoud SA (2010) Polygonal approximation of digital planar curves through adaptive optimizations. Pattern Recogn Lett 31(13):1997–2005

    Article  Google Scholar 

  • Perez JC, Vidal E (1994) Optimum polygonal approximation of digitized curves. Pattern Recognit Lett 15:743–750

    Article  MATH  Google Scholar 

  • 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–859

    Article  Google Scholar 

  • Ramer U (1972) An iterative procedure for the polygonal approximation of plane curves. Comput Graph Image Process 1(3):244–256. https://doi.org/10.1016/S0146-664X(72)80017-0

    Article  Google Scholar 

  • Rosin PL (1997) Techniques for assessing polygonal approximations of curves. IEEE Trans Pattern Anal Mach Intell 19:659–666. https://doi.org/10.1109/34.601253

    Article  Google Scholar 

  • Stone Henry (1961) Approximation of curves by line segments. Math Comput 15:40–47

    Article  MathSciNet  MATH  Google Scholar 

  • Teh CH, Chin RT (1989) On the detection of dominant points on digital curves. IEEE Trans Pattern Anal Mach Intell 11:859–872

    Article  Google Scholar 

  • Wu W-Y (2003) An adaptive method for detecting dominant points. Pattern Recognit 36(10):2231–2237

    Article  MATH  Google Scholar 

  • Zhu Y, Seneviratne LD (1997) Optimal polygonal approximation of digitised curves. IEEE Proc Vis Image Signal Process 144(1):8–14

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology and Engineering, Vellore Institute of Technology, Vellore, 632014, India

    S. Kalaivani & Bimal Kumar Ray

Authors
  1. S. Kalaivani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bimal Kumar Ray
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Kalaivani.

Ethics declarations

Conflict of interest

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

Additional information

Communicated by Sahul Smys.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kalaivani, S., Ray, B.K. A heuristic method for initial dominant point detection for polygonal approximations. Soft Comput 23, 8435–8452 (2019). https://doi.org/10.1007/s00500-019-03936-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-03936-1

Keywords

Search

Navigation