A Split-Based Method for Polygonal Approximation of Shape Curves

  • R. Dinesh
  • Santhosh S. Damle
  • D. S. Guru
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)

Abstract

A new split-approach based method for approximating a boundary curve by a polygon is proposed in this paper. The proposed method recursively splits boundary curve into smaller segment with the help of small eigenvalue of covariance matrix of the boundary curve. Set of boundary points at which boundary curve is split into smaller segments are considered as vertices of the approximating polygon. Experimental results show that the proposed method is robust and efficient.

Keywords

Polygonal approximation Split approach Eigenvalue Integral square error Compression ratio 

References

  1. 1.
    Kolesnikov, A., Franti, P.: Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters 24, 2243–2254 (2003)MATHCrossRefGoogle Scholar
  2. 2.
    Guru, D.S., Dinesh, R.: Non-parametric adaptive region of support useful for corner detection: a novel approach. Pattern Recognition 37, 165–168 (2004)MATHCrossRefGoogle Scholar
  3. 3.
    Perez, J.-C., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letters 15, 743–750 (1994)MATHCrossRefGoogle Scholar
  4. 4.
    Marji, M., Siy, P.: A new algorithm for dominant points detection and polygonization of digital curves. Pattern Recognition 36, 2239–2251 (2003)MATHCrossRefGoogle Scholar
  5. 5.
    Salotti, M.: Optimal polygonal approximation of digitized curves using the sum of square deviation criterion. Pattern Recognition 35, 435–443 (2002)MATHCrossRefGoogle Scholar
  6. 6.
    Pikaz, A., Dinstein, I.: An algorithm for polygonal approximation based on iterative point elimination. Pattern Recognition Letter 16, 557–564 (1995)CrossRefGoogle Scholar
  7. 7.
    Ray, B.K., Ray, K.S.: An algorithm for detection of dominant and polygonal approximation of digitized curves. Pattern Recognition Letters 13, 849–856 (1992)CrossRefGoogle Scholar
  8. 8.
    Ray, B.K., Ray, K.S.: A new split-and-merge technique for polygonal approximation of chain coded curves. Pattern Recognition Letters 16, 161–169 (1995)CrossRefGoogle Scholar
  9. 9.
    Rosin, P.L.: Techniques for Assessing Polygonal Approximation of curves. IEEE Transaction on Pattern Analysis and Machine Intelligence 19(6) (June 1997)Google Scholar
  10. 10.
    Tsai, D.M., Hou, H.T., Su, H.J.: Boundary-based corner detection using eigenvalue of covariance matrices. Pattern Recognition Letters 20, 31–40 (1999)MATHCrossRefGoogle Scholar
  11. 11.
    Wang, M.J.J., Wu, W.Y., Huang, L.K., Wang, D.M.: Corner detection using bending value. Pattern Recognition Letters 16, 575–583 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • R. Dinesh
    • 1
  • Santhosh S. Damle
    • 1
  • D. S. Guru
    • 1
  1. 1.Department of Studies in Computer ScienceUniversity of MysoreManasagangotri, MysoreIndia

Personalised recommendations