{"title":"基于嵌入式遗传规划的演化有限状态机自动目标检测","authors":"K. Benson","doi":"10.1109/CEC.2000.870838","DOIUrl":null,"url":null,"abstract":"This paper presents a model comprising Finite State Machines (FSMs) with embedded Genetic Programs (GPs) which co-evolve to perform the task of Automatic Target Detection (ATD). The fusion of an FSM and GPs allows for a control structure (main program), the FSM, and sub-programs, the GPs, to co-evolve in a symbiotic relationship. The GP outputs along with the FSM state transition levels are used to construct confidence intervals that enable each pixel within the image to be classified as either target or non-target, or to cause a state transition to take place and further analysis of the pixel to be performed. The algorithms produced using this method consist of nominally four GPs, with a typical node cardinality of less than ten, that are executed in an order dictated by the FSM. The results of the experimentation performed are compared to those obtained in two independent studies of the same problem using Kohonen neural networks and a two stage genetic programming strategy.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Evolving finite state machines with embedded genetic programming for automatic target detection\",\"authors\":\"K. Benson\",\"doi\":\"10.1109/CEC.2000.870838\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a model comprising Finite State Machines (FSMs) with embedded Genetic Programs (GPs) which co-evolve to perform the task of Automatic Target Detection (ATD). The fusion of an FSM and GPs allows for a control structure (main program), the FSM, and sub-programs, the GPs, to co-evolve in a symbiotic relationship. The GP outputs along with the FSM state transition levels are used to construct confidence intervals that enable each pixel within the image to be classified as either target or non-target, or to cause a state transition to take place and further analysis of the pixel to be performed. The algorithms produced using this method consist of nominally four GPs, with a typical node cardinality of less than ten, that are executed in an order dictated by the FSM. The results of the experimentation performed are compared to those obtained in two independent studies of the same problem using Kohonen neural networks and a two stage genetic programming strategy.\",\"PeriodicalId\":218136,\"journal\":{\"name\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2000.870838\",\"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 the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2000.870838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evolving finite state machines with embedded genetic programming for automatic target detection
This paper presents a model comprising Finite State Machines (FSMs) with embedded Genetic Programs (GPs) which co-evolve to perform the task of Automatic Target Detection (ATD). The fusion of an FSM and GPs allows for a control structure (main program), the FSM, and sub-programs, the GPs, to co-evolve in a symbiotic relationship. The GP outputs along with the FSM state transition levels are used to construct confidence intervals that enable each pixel within the image to be classified as either target or non-target, or to cause a state transition to take place and further analysis of the pixel to be performed. The algorithms produced using this method consist of nominally four GPs, with a typical node cardinality of less than ten, that are executed in an order dictated by the FSM. The results of the experimentation performed are compared to those obtained in two independent studies of the same problem using Kohonen neural networks and a two stage genetic programming strategy.