{"title":"分割连接蛇形提取多目标边界算法的实验分析","authors":"Guo Cui, JaeYong Hwang, Jong-Whan Jang","doi":"10.3745/KIPSTB.2012.19B.4.221","DOIUrl":null,"url":null,"abstract":"The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can`t split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects\",\"authors\":\"Guo Cui, JaeYong Hwang, Jong-Whan Jang\",\"doi\":\"10.3745/KIPSTB.2012.19B.4.221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can`t split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.\",\"PeriodicalId\":122700,\"journal\":{\"name\":\"The Kips Transactions:partb\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Kips Transactions:partb\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3745/KIPSTB.2012.19B.4.221\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Kips Transactions:partb","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3745/KIPSTB.2012.19B.4.221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects
The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can`t split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.