{"title":"Unbiased Curvilinear Structure Extraction for Cartoon Images","authors":"Ping Yang, Guozhao Wang","doi":"10.1109/ISVD.2011.37","DOIUrl":null,"url":null,"abstract":"In this paper, a novel method for unbiased curvilinear structure extraction of cartoon images is proposed. Our method based on Delaunay triangulation can extract two types of curves, decorative curves and boundary curves, with sub-pixel accuracy. In order to make it, we start by estimating edge points from both types of curves, using the information of the curves and their surroundings. According to the properties of Delaunay triangulation on edge points, we not only estimate the precise position of curve points, but also find the connection relationships of decorative curve points. Compared with related curvilinear structure extraction algorithm, our method can compute the unbiased position of decorative curve points and boundary curve points and, more importantly, keep the topological relationship of decorative curves well.","PeriodicalId":280229,"journal":{"name":"International Symposium on Voronoi Diagrams in Science and Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Voronoi Diagrams in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.2011.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, a novel method for unbiased curvilinear structure extraction of cartoon images is proposed. Our method based on Delaunay triangulation can extract two types of curves, decorative curves and boundary curves, with sub-pixel accuracy. In order to make it, we start by estimating edge points from both types of curves, using the information of the curves and their surroundings. According to the properties of Delaunay triangulation on edge points, we not only estimate the precise position of curve points, but also find the connection relationships of decorative curve points. Compared with related curvilinear structure extraction algorithm, our method can compute the unbiased position of decorative curve points and boundary curve points and, more importantly, keep the topological relationship of decorative curves well.