{"title":"基于差分进化和粒子群优化的Freeman链码提取","authors":"H. Hasan, H. Haron, S. Hashim","doi":"10.1109/SoCPaR.2009.27","DOIUrl":null,"url":null,"abstract":"This paper is focusing on extracting chain codes of a thinned binary image using two soft computing approaches, i.e. Differential Evolution (DE) and Particle Swarm Optimization (PSO). The problem is to find a continuous route which covers all of the nodes of the image. The motivation is that finding such a route is complicated when it has many branches. Literature review shows that these approaches have not been used for solving such problem. In addition, the result shows that the proposed PSO has a better performance than the proposed DE for solving the problem.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"290 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Freeman Chain Code Extraction Using Differential Evolution (DE) and Particle Swarm Optimization (PSO)\",\"authors\":\"H. Hasan, H. Haron, S. Hashim\",\"doi\":\"10.1109/SoCPaR.2009.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is focusing on extracting chain codes of a thinned binary image using two soft computing approaches, i.e. Differential Evolution (DE) and Particle Swarm Optimization (PSO). The problem is to find a continuous route which covers all of the nodes of the image. The motivation is that finding such a route is complicated when it has many branches. Literature review shows that these approaches have not been used for solving such problem. In addition, the result shows that the proposed PSO has a better performance than the proposed DE for solving the problem.\",\"PeriodicalId\":284743,\"journal\":{\"name\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"volume\":\"290 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SoCPaR.2009.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoCPaR.2009.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Freeman Chain Code Extraction Using Differential Evolution (DE) and Particle Swarm Optimization (PSO)
This paper is focusing on extracting chain codes of a thinned binary image using two soft computing approaches, i.e. Differential Evolution (DE) and Particle Swarm Optimization (PSO). The problem is to find a continuous route which covers all of the nodes of the image. The motivation is that finding such a route is complicated when it has many branches. Literature review shows that these approaches have not been used for solving such problem. In addition, the result shows that the proposed PSO has a better performance than the proposed DE for solving the problem.