首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于分水岭与图割的自动分割方法
引用本文:刘荣,彭艳敏,唐粲,程胜.基于分水岭与图割的自动分割方法[J].北京航空航天大学学报,2012,38(5):636-640,647.
作者姓名:刘荣  彭艳敏  唐粲  程胜
作者单位:北京航空航天大学机械工程及自动化学院,北京,100191;天津医科大学医学影像学院,天津,300203;昆山市工业技术研究院,昆山,215300
摘    要:为快速、准确的提取CT序列图像中目标物体,把分水岭和图割相结合.首先选择目标物体的内外轮廓,对内外轮廓之间的区域用分水岭算法预分割为若干小区域,把每一个小区域作为一个节点,建立图结构.把多源点和多汇点简化成单源点和单汇点,建立新的图结构.然后利用最大流/最小割定理进行切割,提取目标物体.最后把上一张CT目标物体的轮廓映射到下一张CT上,分别扩大和缩小该轮廓作为该CT的内外轮廓.根据上述方法提取轮廓,对整个CT序列依次循环操作.通过实验证明该算法在分割效果和分割时间上优于其它传统算法,同时,实现了三维空间上序列轮廓的自动提取.

关 键 词:图割  分水岭  最大流/最小割  三维分割  图像处理
收稿时间:2011-03-04

Object auto-segmentation based on watershed and graph cut
Liu RongSchool of Mechanical Engineering and Automation,Beijing University of Aeronautics and Astronautics,Beijing,China Peng Yanmin School of Medical Imaging,Tianjin Medical University,Tianjin,China Tang Can Cheng Sheng.Object auto-segmentation based on watershed and graph cut[J].Journal of Beijing University of Aeronautics and Astronautics,2012,38(5):636-640,647.
Authors:Liu RongSchool of Mechanical Engineering and Automation  Beijing University of Aeronautics and Astronautics  Beijing  China Peng Yanmin School of Medical Imaging  Tianjin Medical University  Tianjin  China Tang Can Cheng Sheng
Institution:1. School of Mechanical Engineering and Automation, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;2. School of Medical Imaging, Tianjin Medical University, Tianjin 300203, China;3. Kunshan Industrial Technology Research Institute, Kunshan 215300, China
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.
Keywords:graph cut  watershed algorithm  max flow/min cut  the three-dimensional segmentation  image processing
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号