{"title":"A 3 Levels Image Segmentation with Integrated Objects and Local Information","authors":"L. Sheng, Z. Gong, Zhenhua Chen, Shen Long","doi":"10.1109/ICCEE.2008.13","DOIUrl":null,"url":null,"abstract":"This paper introduces a new integrated method for segmenting image which imitates the human observing mechanism. Human firstly pays attention to large objects, then some details, and lastly the concerned details. At the first stage of the algorithm discontinuous edges are detected in the original image, then cut equidistantly to some segmentations, and the end points of segmentations are gathered into a points set. At the second stage a constrained Delaunay triangulation is yielded from the points set and then a graph is attained too. Graph cut algorithm such as minimum spanning tree (MST), is then performed to assemble triangles into regions. At the last stage, the obtained regions are projected into the original image and region boundaries are refined by snake model. Experimental results show that edges are accurate, and a good spatial coherence is attained.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper introduces a new integrated method for segmenting image which imitates the human observing mechanism. Human firstly pays attention to large objects, then some details, and lastly the concerned details. At the first stage of the algorithm discontinuous edges are detected in the original image, then cut equidistantly to some segmentations, and the end points of segmentations are gathered into a points set. At the second stage a constrained Delaunay triangulation is yielded from the points set and then a graph is attained too. Graph cut algorithm such as minimum spanning tree (MST), is then performed to assemble triangles into regions. At the last stage, the obtained regions are projected into the original image and region boundaries are refined by snake model. Experimental results show that edges are accurate, and a good spatial coherence is attained.