Simulated annealing and genetic algorithms for partial shape matching

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Jerzy W. Bala,et al.  Shape analysis using morphological processing and genetic algorithms , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  King-Sun Fu,et al.  Attributed Grammar-A Tool for Combining Syntactic and Statistical Approaches to Pattern Recognition , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Wen-Hsiang Tsai,et al.  Attributed String Matching with Merging for Shape Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Ender Özcan,et al.  Shape recognition using genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  William E. Hart,et al.  A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing , 1995, Evolutionary Programming.