Improvement of Perez and Vidal algorithm for the decomposition of digitized curves into line segments

Proceedings - International Conference on Pattern Recognition

Volumn 15, Issue 2, 2000, Pages 878-882

  Salotti, Marc ^a  

^a Universite de Caen Basse Normandie   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS;

DIGITIZED CURVES; ERROR CRITERION; EUCLIDEAN DISTANCE; LINE SEGMENT; OPTIMAL ALGORITHM; OPTIMALITY; ORTHOGONAL PROJECTION;

PATTERN RECOGNITION;

EID: 27244433490     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (8)

1. P.C. Chung, C.T. Tsai, E.L. Chen, Y.N. Sun, "Polygonal approximation using a competitive Hopfield neural network", Pattern Recognition, vol. 27, no. 11, pp. 1505-1512, 1994.
2. J.G. Dunham, "Optimum Uniform Piecewise Linear Approximation of Digitized Curves", IEEE PAMI, vol. 8, no.1, pp. 67-75, 1986.
3. A.K. Gupta, S. Chaudhury and G. Parthasarathy, "A new approach for aggregating edge points into line segments", Pattern Recognition, vol. 26, no.7, pp. 1069-1086, 1993.
4. H. Imai and M. Iri, "Computational-Geometric Methods for Polygonal Approximations of a Curve", Computer Vision, Graphics, and Image Processing, vol. 36, pp. 31-41, 1986.
5. A. Martelli, "An application of heuristic search methods to edge and contour detection", Comm. of the ACM, vol. 19, pp. 73-83, 1976.
6. T. Pavlidis, Structural Pattern Recognition, Springer Verlag, 1977.
7. J.C. Perez and E. Vidal, "Optimum polygonal approximation of digitized curves", Pattern Recognition Letters, vol. 15, pp. 743-750, 1994.
8. P.L. Rosin, "Techniques for Assessing Polygonal Approximations of Curves", IEEE PAMI, vol. 19, no.6, pp. 659-666, 1997.