Polygonal Approximation of Closed Contours

  • Alexander Kolesnikov
  • Pasi Fränti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2749)

Abstract

Optimal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding algorithm for open curve. We propose to approximate a cyclically extended contour of double size, and to select the best possible starting point by analyzing the state space. This takes only twice of the time required by the algorithm for open curve.

Keywords

State Space Open Curve Goal State Dynamic Programming Algorithm Closed Curf 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Chan, W.S., Chin, F.: On approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. on Comput. Geometry and Applications. 6 (1996) 59–77.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chen, D.Z., Daescu, O.: Space efficient algorithm for polygonal curves in two dimensional space, Proc. 4th Int. Conf. Computing and Combinatorics. (1998) 55–64.Google Scholar
  3. 3.
    Dunham, J.G.: Optimum uniform piecewise linear approximation of planar curves. IEEE Trans on Pattern Analysis and Machine Intelligence. 8(1) (1986) 67–75.CrossRefGoogle Scholar
  4. 4.
    Imai, H., Iri. M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vis. Image Processing. 36 (1986) 31–41.CrossRefGoogle Scholar
  5. 5.
    Horng, J.-H., Li, J.T.: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves. Pattern Recognition Letters. 23 (2002) 171–182.MATHCrossRefGoogle Scholar
  6. 6.
    Kolesnikov, A., Fränti, P.: A fast near-optimal algorithm for approximation of polygonal curves. Proc. Int. Conf. Pattern Recognition-ICPR’02. 4 (2002) 335–338.Google Scholar
  7. 7.
    Kolesnikov, A., Fränti, P.: Reduced search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters. 2003. (in press)Google Scholar
  8. 8.
    Papakonstantinou, G., Tsanakas, P., Manis, G.: Parallel approaches to piecewise linear approximation. Signal Processing. 37 (1994) 415–423.MATHCrossRefGoogle Scholar
  9. 9.
    Perez, J.C., Vidal, E.: Optimum polygonal approximation of digitized curves, Pattern Recognition Letters. 15 (1994) 743–750.MATHCrossRefGoogle Scholar
  10. 10.
    Pikaz, A., Dinstein, L.: Optimal polygonal approximation of digital curves. Pattern Recognition. 28(3) (1995) 373–379.CrossRefGoogle Scholar
  11. 11.
    Ray, B.K., Ray, K.S.: Determination of optimal polygon from digital curve using L 1 norm. Pattern Recognition. 26 (1993) 505–509.CrossRefGoogle Scholar
  12. 12.
    Rosin, P.L.: Techniques for assessing polygonal approximations of curves, IEEE Trans. Pattern Analysis and Machine Intelligence. 14 (1997) 659–666.CrossRefGoogle Scholar
  13. 13.
    Salotti, M.: An efficient algorithm for the optimal polygonal approximation of digitized curves, Pattern Recognition Letters. 22 (2001) 215–221.MATHCrossRefGoogle Scholar
  14. 14.
    Sato, Y.: Piecewise linear approximation of planar curves by perimeter optimization. Pattern Recognition. 25(12), (1992) 1535–1543.CrossRefGoogle Scholar
  15. 15.
    Schroeder, K., Laurent, P.: Efficient polygon approximations for shape signatures. Proc. Int. Conf. Image Processing-ICIP’99. 2 (1999) 811–814.Google Scholar
  16. 16.
    Zhu, Y, Seneviratne, L.D.: Optimal polygonal approximation of digitized curves. IEE Proc. — Vision, Image and Signal Processing. 144 (1997) 8–14.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexander Kolesnikov
    • 1
  • Pasi Fränti
    • 1
  1. 1.Department of Computer ScienceUniversity of JoensuuJoensuuFinland

Personalised recommendations