期刊文献+

局部C-V主动轮廓模型快速图像分割算法 被引量:4

A fast image segmentation algorithm with local C-V active contour model
原文传递
导出
摘要 经典的C-V模型分割算法在处理较大尺寸图像时存在需多次迭代、运算时间长的缺点。在分析图像尺寸和初始逼近图像与获得稳定解的迭代次数与运算时间的关系的基础上,提出了一种改进的基于阈值分割及快速连通域标记算法的局部C-V图像分割算法,对大尺寸图像进行处理。采用OTSU算法对图像进行初步的阈值分割,再利用快速非递归连通域标记算法进行连通域的标记及图像的局部分片。对分片后的小块图像以其阈值分割的结果作为初始逼近图像采用C-V算法进行分割处理。算法分析及仿真结果证实,与经典C-V算法相比较,改进的算法能够以很少的迭代次数和很短的运算时间达到稳定解,能够对含有丰富轮廓细节的大尺寸图像进行快速有效的处理。 For the typical C-V Algorithm,there exists the weakness of requiring multi-iterative operations and long time computation to deal with large size image.Based on the analysis upon the relationship between the image size and the initialized approaching image with the number of iterations and computing time to obtain the stead results,an improved local C-V image divisional algorithm based on the segmentation of threshold value and the connected domain labeled algorithm to deal with large size image is proposed.The OTSU method is used to divide the threshold value of image to reach the goal of label and local segmentation of image through the fast non-recursion algorithm of connected domains.The segmented pieces and the result of its segmentation are used as the initialized approaching image of the C-V algorithm model.Compared with the classical C-V algorithm,the analysis and simulated result indicates that the improved C-V algorithm reaches the steady solution quickly with fewer times of iterations.The proposed method can handle large size image with profound contour details quickly and effectively.
出处 《重庆大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第6期112-116,共5页 Journal of Chongqing University
基金 国家社科基金特别委托项目(06@ZH007)
关键词 主动轮廓模型 图像分割 阈值分割 连通域 active contour model image segmentation threshold value segmentation connected domain
  • 相关文献

参考文献14

  • 1王文哲,唐克伦,牟宗魁.主动轮廓模型综述[J].机械设计与制造,2009(8):257-259. 被引量:4
  • 2CHAN T F, VESE L A. Active contours without edges[J]. IEEE Transactions on Image Processing, 2001, 10(2): 266-277.
  • 3VESE L A, CHANT F. A multiphase level set framework for image segmentation using the mumford and shad model [J]. International Journal of Computer Vision, 2002, 50(3); 271-293.
  • 4刘皓挺,姜国华,王丽.变形模板技术及其在多目标跟踪中的应用[J].系统仿真学报,2006,18(4):1073-1077. 被引量:7
  • 5LI C M, KAO C Y, GORE J C, et al. Implicit active contours dviven by local binary fitting energy[C] // Proceedings of the IEEE Conference on Computer Vision and Patten Recognition (CVPR), June 17-22, 2007. Minnesota, USA: IEEE, 2007: 1-7.
  • 6WANG Y P, DANG C Y. An evolutionary algorithm for global optimixation based on level-set evolution andlatin-sequares[J]. IEEE Transactions on evolutionary Computation, 2007, 11(5) : 579-595.
  • 7WANG W Y. An active contour model for selective segmentation [ C]// Proceedings of the International Conference on Computer Graphics, Image and Vision: New Trends, July 26 29, 2005. Washington DC, USA IEEE, 2005: 111-116.
  • 8LIU H F, CHEN Y M, CHEN W F. Neighborhood aided implicit active contours[C]//Proceedings of the IEEE Computer Society Conference on Computer Vision and Patten Recognition (CVPR), June 17-22, 2006. New York, USA: IEEE, 2006, 1: 841-848.
  • 9WONG W C K, CHUNG A C S. Bayesian image segmentation using local iso-intensity structural orientation [ J ] IEEE Transaction on Image Processing, 2005, 14(10): 1512-1523.
  • 10张开华,周文罡,张振,郑孝娟.一种改进的C-V主动轮廓模型[J].光电工程,2008,35(12):112-116. 被引量:29

二级参考文献48

共引文献49

同被引文献23

  • 1Jiangyu Liu, Jian Sun, Heung-Yeung Shum. Paint Seleclion[J]. ACM Trans. Graph, 2009,28:1- 7.
  • 2Carsten Rother, Vladimir Kolmogorov, Andrew Blake. Crab cut: Interactive foreground extraction using iterated graph cuts [J]. ACM Trans. Graph. ,2004,23:309-314.
  • 3Bae E, Tai X C. Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Muhiphase Image Seg mentation[J]. Scale Space and Variational Method in Compute: Vision, 2009,5567: 1-13.
  • 4Brian L. Price, Bryan Morse, Scott Cohen. Geodesic graph cut for interactive image segmentation[J]. In Proc. CVPR, 2010: 3288-3295.
  • 5Ismail Ben Ayed, Hua mei Chen, Kumaradevan PunitbaKu mar, et al. Graph cut segmentation with a global constraint: Recovering region distribution via a bound of the bhattacharyya measure[J]. In Proc. CVPR, 2010: 3288-3295.
  • 6Viet-Quoc Pham, Keita Takahashi, Takeshi Naemura. Fore ground background segmentation using iterated distribution matching[J]. In Proc. CVPR, 2011: 2113 -2120.
  • 7Vicent Caselles,Ron Kimmel,Guillermo Sapiro.Geodesic Active Contours[J]. International Journal of Computer Vision . 1997 (1)
  • 8Kaihua Zhang,Huihui Song,Lei Zhang.Active contours driven by local image fitting energy[J]. Pattern Recognition . 2009 (4)
  • 9Kaihua Zhang,Lei Zhang,Huihui Song,Wengang Zhou.Active contours with selective local or global segmentation: A new formulation and level set method[J]. Image and Vision Computing . 2009 (4)
  • 10徐海祥,曹万华,陈炜,郭丽艳.基于改进的支持向量机方法的多目标图像分割[J].舰船电子工程,2009,29(2):113-115. 被引量:3

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部