{"title":"自由曲面匹配的遗传算法","authors":"K. Brunnström, A. J. Stoddart","doi":"10.1109/ICPR.1996.547653","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":290297,"journal":{"name":"Proceedings of 13th International Conference on Pattern Recognition","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"116","resultStr":"{\"title\":\"Genetic algorithms for free-form surface matching\",\"authors\":\"K. Brunnström, A. J. Stoddart\",\"doi\":\"10.1109/ICPR.1996.547653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":290297,\"journal\":{\"name\":\"Proceedings of 13th International Conference on Pattern Recognition\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"116\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 13th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1996.547653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 13th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1996.547653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.