Genetic algorithms for error-bounded polygonal approximation

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 14, Issue 3, 2000, Pages 297-314

  Sun, Yung Nien ^a   Huang, Shu Chien ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION;

ERROR-BOUNDED POLYGONAL APPROXIMATION; EVOLUTIONARY COMPUTATION;

COMPUTATIONAL GEOMETRY;

EID: 0033747739     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0218-0014(00)00020-9     Document Type: Article

References (24)

1. C. Barillot, B. Gibaud, J. Scarabin and J. Coatrieux, "3D reconstruction of cerebral blood vessels," IEEE Trans. Comput. Graph. Appl. 5 (1985) 13-19.
2. B. B. Chai, T. Huang, X. Zhuang, Y. Zhao and J. Sklansky, "Piecewise linear classifiers using binary tree structures and genetic algorithm," Patt. Recogn. 29 (1996) 1905-1917.
3. J. G. Dunham, "Optimum uniform piecewise linear approximation of planar curves," IEEE Trans. Patt. Anal. Mach. Intell. 8 (1986) 67-75.
4. D. B. Fogel, "An introduction to simulated evolutionary optimization," IEEE Trans. Neural Network 5 (1994) 3-12.
5. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
6. D. Goldberg and R. Lingle, "Alleles loci, and the traveling salesman problem," Proc. First Int. Conf. Genetic Algorithms and Their Applications, Lawrence Erlbaum, 1985, pp. 154-159.
7. J. J. Grefenstette, "Optimization of control parameters for genetic algorithms," IEEE Trans. Syst. Man Cybern. 16 (1986) 122-128.
8. J. H. Holland, Adaptation in Natural and Artificial Systems, Ann Arbor, MI, 1975.
9. Y. Kurozumi and W. A. Davis, "Polygonal approximation by the minimax method," Comput. Graph. Imag. Process. 19 (1982) 248-264.
10. S. Loncaric and A. P. Dhawan, "Near-optimal mst-based shape description using genetic algorithm," Patt. Recogn. 28 (1995) 571-579.
11. W. E. Lorensen and H. E. Cline, "Marching cubes: a high resolution 3D surface construction algorithm," Comput. Graph. 21 (1987) 163-169.
12. Z. Michalewics, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin, 1992.
13. I. Oliver, D. Smith and J. H. Holland, "A study of permutation crossover operators on the traveling salesman problem," Proc. Second Int. Conf. Genetic Algorithms and Their Applications, Cambridge, MA, 1987, pp. 224-230.
14. T. Pavlids, Structural Pattern Recognition, Springer, NY, 1977.
15. T. Pavlidis and S. Horowitz, "Segmentation of planar curves," IEEE Trans. Comput. C-23 (1974) 860-870.
16. 1 norm," Patt. Recogn. 26 (1993) 505-509.
17. M. Singh, A. Chatterjee and S. Chaudhury, "Matching structural shape descriptions using genetic algorithms," Patt. Recogn. 30 (1997) 1451-1462.
18. J. Sklansky and V. Gonzalez, "Fast polygonal approximation of digitized curves," Patt. Recogn. 12 (1980) 327-331.
19. G. Syswerda, "Scheduling optimization using genetic algorithms," Handbook of Genetic Algorithms, Van Nostrand, Reinhold, NY, 1991.
20. P. E. Undrill, K. Delibasis and G. G. Gameron, "An application of genetic algorithms to geometric model-guided interpretation of brain anatomy," Patt. Recogn. 30 (1997) 217-227.
21. K. Wall and P. E. Danielsson, "A fast sequential method for polygonal approximation of digitized curves," Comput. Vis. Graph. Imag. Process. 55 (1984) 220-227.
22. C. M. Williams, "An efficient algorithm for the piecewise linear approximation of planar curves," Comput. Graph. Imag. Process. 8 (1978) 286-293.
23. C. M. Williams, "Bounded straight-line approximation of digitized planar curves and lines," Comput. Graph. Imag. Process. 16 (1981) 370-381.
24. Y. Zhu and L. D. Seneviratne, "Optimal polygonal approximation of digitised curves," IEE Proc. Vis. Imag. Sign. Process. 144 (1997) 8-14.