Multiresolution polygonal approximation of digital curves

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 2004, Pages 855-858

  Kolesnikov, Alexander ^a   Fränti, Pasi ^a   Wu, Xiaolin ^b  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL CURVES; HEURISTIC MERGE ALGORITHM; MULTIRESOLUTION POLYGONAL APPROXIMATION; PROBLEM FORMULATION;

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; ERROR ANALYSIS; HEURISTIC METHODS; PROBLEM SOLVING;

IMAGE PROCESSING;

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

References (11)

1. C. Le Buhan Jordan, T. Ebrahimi, M. Kunt, Progressive content-based shape compression for retrieval of binary images, Computer Vision and Image Understanding, 71(2): 198-212, 1998.
2. B.P. Buttenfield, Transmitting vector geospatial data across the Internet, Proc. GIScience, Berlin, Lecture Notes in Computer Science, vol. 2478, pp. 51-64, 2002.
3. W.S. Chan, F. Chin, On approximation of polygonal curves with minimum number of line segments or minimum error, Int. J. Comput. Geom. Appl., 6: 59-77, 1996.
4. A. Kolesnikov, P. Fränti, Fast algorithm for multiple-objects min-ε problem, Proc. Int. Conf. on Image Processing-ICIP'2003, Barcelona, Spain, Vol. 1, pp. 221-224, September 2003.
5. A. Kolesnikov, P. Fränti, Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters, 24(14): 2243-2254, 2003.
6. L.J. Latecki, R. Lakämper, Convexity rule for shape decomposition based on discrete contour evolution, Computer Vision and Image Understanding, 73: 441-454, 1999.
7. J.C. Perez, E. Vidal, Optimum polygonal approximation of digitized curves, Pattern Recognition Letters, 15: 743-750, 1994.
8. A. Pikaz, I. Dinstein, An algorithm for polygonal approximation based on iterative point elimination, Pattern Recognition Letters, 16 (6): 557-563, 1995.
9. A.M.G. Pinheiro, M. Ghanbari, Scalable coding of shape contours in scale space, Proc. Int. Conf on Image Processing-ICIP'2002,1: 165-168, 2002.
10. Rosin P.L., Techniques for assessing polygonal approximations of curves, IEEE Trans. Pattern Analysis and Machine Intelligence, 14 (6): 659-666, 1997.
11. Visvalingam M., Whyatt J., Line generalization by repeated elimination of points, Cartographic Journal, 30(1): 46-51, 1993.