Data reduction of large vector graphics

Pattern Recognition

Volumn 38, Issue 3, 2005, Pages 381-394

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

^a INSTITUTE OF AUTOMATION AND ELECTROMETRY   (Russian Federation)

^b UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Data reduction; Dynamic programming; Min problem; Multiple object; Polygonal approximation; Vector data compression

Indexed keywords

APPROXIMATION THEORY; DATA REDUCTION; DYNAMIC PROGRAMMING; ERROR ANALYSIS; GENETIC ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; VECTOR QUANTIZATION;

MIN-Ε PROBLEM; MULTIPLE OBJECT; POLYGONAL APPROXIMATION; VECTOR DATA COMPRESSION;

COMPUTER GRAPHICS;

EID: 10044273895     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2004.07.005     Document Type: Article

References (50)

1. H. Imai, M. Iri, Computational-geometric methods for polygonal approximations of a curve, Comput. Vision Image Process. 36 (1986) 31-41.
2. A. Pikaz, I. Dinstein, Optimal polygonal approximation of digital curves, Pattern Recogn. 28 (3) (1995) 371-379.
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 (1996) 59-77.
4. D.Z. Chen, O. Daescu, Space-efficient algorithms for approximating polygonal curves in two-dimensional space, Int. J. Comput. Geom. Appl. 13 (2) (2003) 95-111.
5. G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, J. Snoeyink, Efficiently approximating polygonal paths in three and higher dimensions, Algorithmica 33 (2) (2002) 150-167.
6. G. Papakonstantinou, Optimal polygonal approximation of digital curves, Signal Process. 8 (1985) 131-135.
7. J.G. Dunham, Optimum uniform piecewise linear approximation of planar curves, IEEE Trans. Pattern Anal. Mach. Intell. 8 (1) (1986) 67-75.
8. J.C. Perez, E. Vidai, Optimum polygonal approximation of digitized curves, Pattern Recogn. Lett. 15 (1994) 743-750.
9. Y. Zhu, L.D. Seneviratne, Optimal polygonal approximation of digitized curves, IEE Proc.-Vis. Image Signal Process. 144 (1) (1997) 8-14.
10. C.-C. Tseng, C.-J. Juan, H.-C. Chang, J.-F. Lin, An optimal line segment extraction algorithm for online Chinese character recognition using dynamic programming, Pattern Recogn. Lett. 19 (1998) 953-961.
11. R. Nygaard, J. Husøy, D. Haugland, Compression of image contours using combinatorial optimization, Proceedings of the International Conference on Image Processing-ICIP'98, vol. 1, 1998, pp. 266-270.
12. ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle-RFIA'2002, Angers, France, vol. 1, 2002, pp. 11-18.
13. M. Salotti, An efficient algorithm for the optimal polygonal approximation of digitized curves, Pattern Recogn. Lett. 22 (2001) 215-221.
14. M. Salotti, Optimal polygonal approximation of digitized curves using the sum of square deviations criterion, Pattern Recogn. 35 (2) (2002) 435-443.
15. P.L. Rosin, Techniques for assessing polygonal approximations of curves, IEEE Trans. Pattern Anal. Mach. Intell. 14 (6) (1997) 659-666.
16. P.L. Rosin, Techniques for assessing of behaviour of polygonal approximations of curves, Pattern Recogn. 36 (6) (2003) 505-518.
17. U. Ramer, An iterative procedure for polygonal approximation of plane curves, Comput. Graph. Image Process. 1 (1972) 244-256.
18. D.H. Douglas, T.K. Peucker, Algorithm for the reduction of the number of points required to represent a line or its caricature, The Can. Cartograph. 10 (2) (1973) 112-122.
19. J. Hershberger, J. Snoeyink, Cartografic line simplification and polygon CSG formulæin O (nlog*n) time, Comput. Geom. Theory Appl. 11 (3-4) (1998) 175-185.
20. J.-S. Wu, J.-J. Leou, New polygonal approximation schemes for object shape representation, Pattern Recogn. 26 (1993) 471-484.
21. M. Visvalingam, J. Whyatt, Line generalization by repeated elimination of points, Cartograph. J. 30 (1) (1993) 46-51.
22. L. Boxer, C.-S. Chang, R. Miller, A. Rau-Chaplin, Polygonal approximation by boundary reduction, Pattern Recogn. Lett. 14(1993) 111-119.
23. A. Pikaz, I. Dinstein, An algorithm for polygonal approximation based on iterative point elimination, Pattern Recogn. Lett. 16 (6) (1995) 557-563.
24. K.M. Ku, P.K. Chiu, Polygonal approximation of digital curve by graduate iterative merging, Electron. Lett. 31 (1995) 444-446.
25. L.J. Latecki, R. Lakämper, Convexity rule for shape decomposition based on discrete contour evolution, Comput. Vision Image Understand. 73 (1999) 441-454.
26. H.Z. Shu, L.M. Luo, J.D. Zhou, X.D. Bao, Moment-based methods for polygonal approximation of digitized curves, Pattern Recogn. 32 (2002) 421-434.
27. T. Pavlidis, S.L. Horovitz, Segmentation of plane curves, IEEE Trans. Comput. 23 (8) (1974) 860-870.
28. Y. Xiao, J.J. Zou, H. Yan, An adaptive split-and-merge method for binary image contour data compression, Pattern Recogn. Lett. 22 (2001) 299-307.
29. C.-H. Teh, R.T. Chin, On the detection of dominant points on digital curves, IEEE Trans. Pattern Anal. Mach. Intell. 11 (8) (1989) 859-872.
30. P. Zhu, P.M. Chirlian, On critical point detection of digital shapes, IEEE Trans. Pattern Anal. Mach. Intell. 17 (1995) 737-748.
31. J.M. Iñesta, M. Buendia, M.A. Sarti, Reliable polygonal approximations of imaged real objects through dominant point detection, Pattern Recogn. 31 (1998) 685-697.
32. A. Garrido, N.P. de la Bianca, M. Garcia-Silvente, Boundary simplification using a multiscale dominant-point detection algorithm, Pattern Recogn. 31 (1998) 791-804.
33. J. Sklansky, V. Gonzalez, Fast polygonal approximation of digitized curves, Pattern Recogn. 12 (1980) 327-331.
34. Y. Kurozumi, W.A. Davis, Polygonal approximation by the minimax method, Computer Vision, Graph. Image Process. 19 (1982) 248-264.
35. B.K. Ray, K.S. Ray, A non-parametric sequential method for polygonal approximation of digital curves, Pattern Recogn. Lett. 15 (1994) 161-167.
36. P.-Y. Yin, A new method for polygonal approximation using genetic algorithms, Pattern Recogn. Lett. 19 (1998) 1017-1026.
37. S.-C. Huang, Y.-N. Sun, Polygonal approximation using genetic algorithms, Pattern Recogn. 32 (1999) 1017-1026.
38. S.-Y. Ho, Y.-C. Chen, An efficient evolutionary algorithm for accurate polygonal approximation, Pattern Recogn. 34 (2001) 2305-2317.
39. H. Zhang, J. Guo, Optimal polygonal approximation of digital planar curves using meta-heuristics, Pattern Recogn. 34 (2001) 1429-1436.
40. P.-Y. Yin, A tabu search approach to the approximation of digital curves, Int. J. Pattern Recogn. Artif. Intell. 14 (2000) 243-255.
41. U. Vallone, Bidimensional shapes polygonalization by ACO, in: Proceedings of the 3rd International Workshop on Ants Algorithms, Brussels, Belgium, 2002, pp. 296-297.
42. P.-Y. Yin, Ant colony search algorithms for optimal approximation of plane curve, Pattern Recogn. 36 (2003) 1783-1797.
43. K. Schroeder, P. Laurent, Efficient polygon approximations for shape signatures, Proceedings of the International Conference on Image Processing-ICIP'99, vol. 2, 1999, pp. 811-814.
44. J.-H. Horng, J.T. Li, An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves, Pattern Recogn. Lett. 23 (2002) 171-182.
45. A. Kolesnikov, P. Fränti, Polygonal approximation of closed curves, Lecture Notes in Computer Science, vol. 2749, pp. 778-785, Proceedings of the 12th Scandinavian Conference on Image Analysis-SCIA'2003, 2003, Göteborg, Sweden.
46. G.M. Schuster, A.K. Katsaggelos, An optimal polygonal boundary encoding scheme in the rate-distortion sense, IEEE Trans. Image Process. 7 (1) (1998) 13-26.
47. A.K. Katsaggelos, L.P. Kondi, F.W. Meier, J. Osterman, G.M. Schuster, MPEG-4 and rate-distortion-based shape-coding techniques, Proc. IEEE 86 (6) (1998) 1126-1154.
48. A. Kolesnikov, P. Fränti, Reduced search dynamic programming for approximation of polygonal curves, Pattern Recogn. Lett. 24 (2003) 2243-2254.
49. R. Bellman, Dynamic Programming, Princeton University Press, NJ, 1957.
50. National Land Survey of Finland, Opastinsilta 12 C, P.O. Box 84,00521 Helsinki, Finland, http://www.maanmittauslaitos.fi/.