Object auto-segmentation based on watershed and graph cut
-
摘要: 为快速、准确的提取CT序列图像中目标物体,把分水岭和图割相结合.首先选择目标物体的内外轮廓,对内外轮廓之间的区域用分水岭算法预分割为若干小区域,把每一个小区域作为一个节点,建立图结构.把多源点和多汇点简化成单源点和单汇点,建立新的图结构.然后利用最大流/最小割定理进行切割,提取目标物体.最后把上一张CT目标物体的轮廓映射到下一张CT上,分别扩大和缩小该轮廓作为该CT的内外轮廓.根据上述方法提取轮廓,对整个CT序列依次循环操作.通过实验证明该算法在分割效果和分割时间上优于其它传统算法,同时,实现了三维空间上序列轮廓的自动提取.Abstract: In order to segment CT slices mostly and accurately, watershed algorithm and graph cut were combined. Firstly, the inner contour and the outer contour of the target object were selected, and then watershed algorithm was applied to divide the region between contours into series of smaller regions. Each smaller region was regarded as a node to establish the graph. Multiple sources and multiple sinks can be converted to the single source and the single sink to refine the graph. Secondly, the target object of the first CT can be extracted by the maximal-flow cut. Thirdly, mapping the contour to the next CT, the contour was reduced and expanded to regard as the inner contours and the outer contours. Then the next CT was segmented. Followed by the cycling, the entire sequence of CT will be operated. The experiment proves that this algorithm is more effective in the segmentation and the running time than the other traditional algorithms. Meanwhile, the contours of the series of CT were extracted automatically.
-
[1] 曹蕾,路利军,杨蕊梦,等.基于区域增长的肺结节自适应形态分割[J].南方医科大学学报,2008,28(12):2109-2125 Cao Lei,Lu Lijun,Yang Ruimeng,et al.Self-adapted segmentation of pulmonary nodule based on region growing[J].J South Med Univ,2008,28(12):2109-2125(in Chinese) [2] 赵锋,赵荣椿.分裂-合并方法在图象分割、目标提取中的应用[J].西北工业大学学报,2000,18(1):116-120
Zhao Feng,Zhao Rongchun.A new method for image segmentation[J].Journal of North Western Polytechnical University,2000,18(1):116-120(in Chinese)[3] 孔丁科,汪国昭.基于区域相似性的活动轮廓SAR图像分割[J].计算机辅助设计与图形学学报,2010,22(9):1554-1560
Kong Dingke,Wang Guozhao.Region-similarity based active contour model for SAR image segmentation[J].Journal of Computer-Aided Design & Computer Graphics,2010,22(9):1554-1560(in Chinese)[4] Yuri Boykov,Gareth Funkalea.Graph cuts and efficient N-D image segmentation[J].International Journal of Computer Vision,2006,70(2):109-131 [5] Vincent L,Soille P.Watersheds in digital spaces:an efficient algorithm based on immersion simulation[J].IEEE Transactions on Pattern Analysis and Machine Inteligence,1991,13:583-598 [6] Li Yin,Sun Jian,Tang Chikeung,et al.Lazy snapping[J].ACM Transactions on Graphics,2004,23(3):303-308 [7] Xu Ning,Ahuja Narendra,Bansal Ravi.Object segmentation using graph cuts based active contours[J].Computer Vision and Image Understanding,2007,107:210-224 [8] Boykov Yuri,Kolmogorov Vladimir.An experimental comparison of min-cut max-flow algorithm of energy minimization in vision[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2004,26(9):1124-1137 -
点击查看大图
计量
- 文章访问数: 2576
- HTML全文浏览量: 237
- PDF下载量: 577
- 被引次数: 0
下载:
