Speeding up simplification of polygonal curves using nested approximations

Pattern Analysis and Applications

Volumn 12, Issue 4, 2009, Pages 367-375

  Marteau, P F ^a   Menier G ^a  

^a UNIVERSITÉ BRETAGNE SUD   (France)

Author keywords

Dynamic programming; Multiresolution; Polygonal approximation

Indexed keywords

EID: 70350594711     PISSN: 14337541     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10044-008-0133-y     Document Type: Article

References (25)

1. Le Buhan J, Ebrahimi T, Kunt M (1998) Progressive content-based shape compression for retrieval of binary images. Computer Vision and Image Understanding 71:198-212.
2. Buttenfield BP (2002) Transmitting vector geospatial data across the internet. In: Proc GIScience, Lecture Notes in Computer Science, volume 2478, pp 51-64.
3. National Geophysical Data Center (2008) Noaa satellite and information services.
4. Chen DZ, Daescu O (1998) Space-efficient algorithms for approximating polygonal curves in two-dimensional space. In: Int Conf on Computing and Combinatorics, Lecture Notes in Computer Science, volume 1449, pp 4554.
5. Douglas DH, Peucker TK (1973) Algorithm for the reduction of the number of points required to represent a line or its caricature. The Canadian Cartographer 10:112-122.
6. Horng J-H (2002) Improving fitting quality of polygonal approximation by using the dynamic programming technique. Pattern Recognition Letters 23:1657-1673.
7. Remy J-L, Debled-Rennesson I, Rouyer J (2003) Segmentation of discrete curves into fuzzy segments. Electronic Notes in Discrete Mathematics 12:372-383.
8. Imai H, Iri M (1988) Polygonal approximations of a curve - formulations and algorithms. Computational Morphology, pp 71-86.
9. Katsaggelos AK, Kondi LP, Meier FW, Osterman J, Schuster GM (1998) Mpeg-4 and rate-distortion-based shape-coding techniques. In: Proceedings of the IEEE, volume 86, pp 1126-1154.
10. Kolesnikov A, Fränti P (2003) Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters 24:2243-2254.
11. Kolesnikov A, Fränti P, Wu X (2004) Multiresolution polygonal approximation of digital curves. In: Proceedings of the 17th International Conference on Pattern Recognition (ICPR'04), pp 855-858.
12. Marteau PF, Ménier G (2006) Adaptive multiresolution and dedicated elastic matching in linear time complexity for time series data mining. In: Sixth International Conference on Intelligent Systems Design and Applications, pp 700-706.
13. Marteau PF (2008) Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans. on Pattern Analysis and Machine Intelligence, pp 1-15. DOI:10.1109/TPAMI.2008.76.
14. Melkman A, O'Rourke J (1988) On polygonal chain approximation. Computational Morphology, Elsevier Science Publishers B.V., North Holland, pp. 87-95.
15. Perez JC, Vidal E (1994) Optimum polygonal approximation of digitized curves. Pattern Recognition Letters 15:743-750.
16. Pikaz A, Dinstein I (1995) An algorithm for polygonal approximation based on iterative point elimination. Pattern Recognition Letters 16:557-563.
17. Pratt KB, Fink E (2002) Search for patterns in compressed time series. International Journal of Image and Graphics 2:89-106.
18. Rosin RL (1997) Techniques for assessing polygonal approximations of curves. IEEE Trans. Pattern Analysis and Machine Intelligence 14:659-666.
19. Becq G, Charbonnier S, Biot L (2004) On-line segmentation algorithm for continuously monitored data in intensive care units. IEEE Trans. On Biomedical Engeneering 51:484-492.
20. Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoustics Speech Signal Process ASSP 26:4349.
21. Salotti M (2001) An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recognition Letters 22:215-221.
22. Visvalingam M, Whyatt J (1993) Line generalization by repeated elimination of points. Cartographic Journal 30:46-51.
23. Chin dF WS Chan a (1996) On approximation of polygonal curves with minimum number of line segments or minimum error. Int J Comput Geometry Appl 6:5977.
24. Wu J-S, Leou J-J (1993) New polygonal approximation schemes for object shape representation. Pattern Recognition 26(4):471-484.
25. Zhu Y, Seneviratne LD (1997) Optimal polygonal approximation of digitized curves. In: IEEE Proc-Vis Image Signal Process, volume 144, p 814.