利用遗传算法提取几何原语

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Pub Date : 1992-06-15 DOI:10.1109/CVPR.1992.223120

G. Roth, M. Levine

{"title":"利用遗传算法提取几何原语","authors":"G. Roth, M. Levine","doi":"10.1109/CVPR.1992.223120","DOIUrl":null,"url":null,"abstract":"A genetic algorithm based on a minimal subset representation of a geometric primitive is used to perform primitive extraction. A genetic algorithm is an optimization method that uses the metaphor of evolution, and a minimal subset is the smallest number of points necessary to define a unique instance of a geometric primitive. The approach is capable of extracting more complex primitives than the Hough transform. While similar to a hierarchical merging algorithm, it does not suffer from the problem of premature commitment.<<ETX>>","PeriodicalId":325476,"journal":{"name":"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","volume":"24 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"228","resultStr":"{\"title\":\"Geometric primitive extraction using a genetic algorithm\",\"authors\":\"G. Roth, M. Levine\",\"doi\":\"10.1109/CVPR.1992.223120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A genetic algorithm based on a minimal subset representation of a geometric primitive is used to perform primitive extraction. A genetic algorithm is an optimization method that uses the metaphor of evolution, and a minimal subset is the smallest number of points necessary to define a unique instance of a geometric primitive. The approach is capable of extracting more complex primitives than the Hough transform. While similar to a hierarchical merging algorithm, it does not suffer from the problem of premature commitment.<<ETX>>\",\"PeriodicalId\":325476,\"journal\":{\"name\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"volume\":\"24 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"228\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPR.1992.223120\",\"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 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPR.1992.223120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 228

摘要

采用基于几何原语最小子集表示的遗传算法进行原语提取。遗传算法是一种使用进化比喻的优化方法，最小子集是定义几何原语的唯一实例所需的最小个数的点。该方法能够提取比霍夫变换更复杂的原语。虽然类似于分层合并算法，但它没有过早承诺的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Geometric primitive extraction using a genetic algorithm

A genetic algorithm based on a minimal subset representation of a geometric primitive is used to perform primitive extraction. A genetic algorithm is an optimization method that uses the metaphor of evolution, and a minimal subset is the smallest number of points necessary to define a unique instance of a geometric primitive. The approach is capable of extracting more complex primitives than the Hough transform. While similar to a hierarchical merging algorithm, it does not suffer from the problem of premature commitment.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition

自引率

0.00%

发文量