{"title":"解析没有边界曲率的轮廓","authors":"R. Juengling, Lakshman Prasad","doi":"10.1109/ICIAP.2007.101","DOIUrl":null,"url":null,"abstract":"We describe a new decomposition algorithm for two-dimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes (\"ribbons\") by grouping skeleton fragments into long smooth spines. The parts are then obtained by cutting the ribbons along lines of mutual intersection. With this approach we find part cuts that obey heuristic rules of early vision (M. Singh et a., 1999) without using boundary curvature.","PeriodicalId":118466,"journal":{"name":"14th International Conference on Image Analysis and Processing (ICIAP 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Parsing Silhouettes without Boundary Curvature\",\"authors\":\"R. Juengling, Lakshman Prasad\",\"doi\":\"10.1109/ICIAP.2007.101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a new decomposition algorithm for two-dimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes (\\\"ribbons\\\") by grouping skeleton fragments into long smooth spines. The parts are then obtained by cutting the ribbons along lines of mutual intersection. With this approach we find part cuts that obey heuristic rules of early vision (M. Singh et a., 1999) without using boundary curvature.\",\"PeriodicalId\":118466,\"journal\":{\"name\":\"14th International Conference on Image Analysis and Processing (ICIAP 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"14th International Conference on Image Analysis and Processing (ICIAP 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAP.2007.101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th International Conference on Image Analysis and Processing (ICIAP 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAP.2007.101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
摘要
我们描述了一种新的二维多边形形状的分解算法。该算法首先通过将骨骼碎片分组成光滑的长刺，找到一组重叠的带状亚形状(“带状”)。然后通过沿相互交点的线切割色带来获得零件。通过这种方法，我们发现部分切割遵循早期视觉的启发式规则(M. Singh et a.， 1999)，而不使用边界曲率。
We describe a new decomposition algorithm for two-dimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by grouping skeleton fragments into long smooth spines. The parts are then obtained by cutting the ribbons along lines of mutual intersection. With this approach we find part cuts that obey heuristic rules of early vision (M. Singh et a., 1999) without using boundary curvature.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
