{"title":"遗传优化在医学图像分割中的应用","authors":"R. Cornely, W. Kuklinski","doi":"10.1109/NEBC.1994.305171","DOIUrl":null,"url":null,"abstract":"A number of important problems in medical imaging can be classified as segmentation problems. These segmentation problems can be formulated as configurational optimization problems by representing the configurations of interest in an image as unique subsets of the complete image. An effective segmentation optimization algorithm must determine the specific image subset that best exhibits an a priori set of quantitative characteristics. Here, a genetic optimization algorithm was used to produce a population of individual sub-images that were tested via a quantitative objective function, ranked using a linear fitness and decrement scheme, and modified using a genetic cross-over operator. The algorithm was found to converge within 25 to 50 generations to a good fit to the targeted configuration in a robust and efficient manner.<<ETX>>","PeriodicalId":117140,"journal":{"name":"Proceedings of 1994 20th Annual Northeast Bioengineering Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Application of genetic optimization to medical image segmentation\",\"authors\":\"R. Cornely, W. Kuklinski\",\"doi\":\"10.1109/NEBC.1994.305171\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of important problems in medical imaging can be classified as segmentation problems. These segmentation problems can be formulated as configurational optimization problems by representing the configurations of interest in an image as unique subsets of the complete image. An effective segmentation optimization algorithm must determine the specific image subset that best exhibits an a priori set of quantitative characteristics. Here, a genetic optimization algorithm was used to produce a population of individual sub-images that were tested via a quantitative objective function, ranked using a linear fitness and decrement scheme, and modified using a genetic cross-over operator. The algorithm was found to converge within 25 to 50 generations to a good fit to the targeted configuration in a robust and efficient manner.<<ETX>>\",\"PeriodicalId\":117140,\"journal\":{\"name\":\"Proceedings of 1994 20th Annual Northeast Bioengineering Conference\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 20th Annual Northeast Bioengineering Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NEBC.1994.305171\",\"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 1994 20th Annual Northeast Bioengineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEBC.1994.305171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of genetic optimization to medical image segmentation
A number of important problems in medical imaging can be classified as segmentation problems. These segmentation problems can be formulated as configurational optimization problems by representing the configurations of interest in an image as unique subsets of the complete image. An effective segmentation optimization algorithm must determine the specific image subset that best exhibits an a priori set of quantitative characteristics. Here, a genetic optimization algorithm was used to produce a population of individual sub-images that were tested via a quantitative objective function, ranked using a linear fitness and decrement scheme, and modified using a genetic cross-over operator. The algorithm was found to converge within 25 to 50 generations to a good fit to the targeted configuration in a robust and efficient manner.<>