Fast polygonal approximation of digital curves

Proceedings - International Conference on Pattern Recognition

Volumn 1, Issue , 2004, Pages 465-468

  Debled Rennesson, I ^a   Tabbone, S ^a   Wendling, L ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL CURVES; ERROR PROCESS; POLYGONAL APPROXIMATION;

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; FUZZY SETS; THEOREM PROVING; VECTORS;

IMAGE SEGMENTATION;

EID: 10044249136     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2004.1334165     Document Type: Conference Paper

References (18)

1. N. Ansari and E. J. Delp. On Detecting Dominant Points. PR, 24(5):441-451, 1991.
2. T. Davis. Fast Decomposition of Digital Curves into Polygons Using the Haar Transform. IEEE PAMI, 21(8), 1999.
3. I. Debled-Rennesson. Estimation of Tangents to a Noisy Discrete Curve. In Vision Geometry XII, San José, Jan 2004.
4. I. Debled-Rennesson, J.-L. Rémy, and J. Rouyer-Degli. Segmentation of Discrete Curves into Fuzzy Segments. In A. Del Lungo et al., Editors, 9th Int. Work, on Combinatorial Image Analysis, ENDM, vol 12, may 2003.
5. I. Debled-Rennesson, J.-L. Rémy, and J. Rouyer-Degli. Segmentation of Discrete Curves into Fuzzy Segments, extented version. In INRIA Report RR-4989 (http://www.inria.fr/rrrt/rr-4989.html), november 2003.
6. A. Kolesnikov and P. Fränti. Reduced-search dynamic programming for approximation of polygonal curves. PRL, 24(14):2243-2254, 2003.
7. J. Perez and E. Vidal Optimum polygonal approximation of digitized curves. PRL, 15:743-750, 1994.
8. U. Ramer. An Iterative Procedure for the Polygonal Approximation of Plane Curves. CGIP, 1:244-256, 1972.
9. B. Ray and K. Ray. A new split-and-merge technique for polygonal approximation of chain coded curves. PRL, 16:161-169, 1995.
10. J.-P. Reveillès. Géométrie discrète, calculs en nombre entiers et algorithmique. Thèse d'état. Université Louis Pasteur, Strasbourg, 1991.
11. P. L. Rosin. Techniques for Assessing Polygonal Approximations of Curves. IEEE PAMI, 19(6):659-666, 1997.
12. P. L. Rosin and G. A. West. Segmentation of Edges into Lines and Arcs. IVC, 7(2):109-114, May 1989.
13. M. Salotti. An efficient algorithm for the optimal polygonal approximation of digitized curves. PRL, 22:215-221, 2001.
14. J. Sklansky and V. Gonzalez. Fast Polygonal Approximation of Digitized Curves. PR, 12:327-331, 1980.
15. K. Wall and P. Danielsson. A Fast Sequential Method for Polygonal Approximation of Digitized Curves. CVGIP, 28:220-227, 1984.
16. A. Witkin. Scale space filtering. In In Proc. IJCAI, 1983.
17. W. Wu and M. Wang. Detecting the Dominant Points by the Curvature-Based Polygonal Approximation. GMIP, 55(2):79-88, 1993.
18. P. Yin. A Tabu Search Approach to Polygonal Approximation of Digital Curves. IJPRAI, 14(2):243-255, 2000.