Genetic algorithms for free-form surface matching

The free-form surface matching problem is important in several practical applications, such as reverse engineering. An accurate, robust and fast solution is, therefore, of great significance. Recently genetic algorithms have attracted great interest for their ability to robustly solve hard optimizat...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 13th International Conference on Pattern Recognition Vol. 4; pp. 689 - 693 vol.4
Main Authors Brunnstrom, K., Stoddart, A.J.
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 1996
Subjects
Biomedical equipment
Convergence
Genetic algorithms
Hamming distance
Image sensors
Iterative algorithms
Iterative closest point algorithm
Medical services
Reverse engineering
Robustness
Online AccessGet full text

Cover

More Information
Summary:The free-form surface matching problem is important in several practical applications, such as reverse engineering. An accurate, robust and fast solution is, therefore, of great significance. Recently genetic algorithms have attracted great interest for their ability to robustly solve hard optimization problems. In this work we investigate the performance of such an approach for finding the initial guess of the transformation, a translation and a rotation, between the object and the model surface. This is followed by a local gradient descent method, such as iterative closest point, to refine the estimate. Promising results are demonstrated on accurate real data.
ISBN:9780818672828
081867282X
ISSN:1051-4651
DOI:10.1109/ICPR.1996.547653