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

Chan-Vese图像分割模型的快速实现算法的研究
引用本文:蒋宁,章日康,蒲立新,陈伟建.Chan-Vese图像分割模型的快速实现算法的研究[J].电子科技大学学报(自然科学版),2008,37(5):705-708.
作者姓名:蒋宁  章日康  蒲立新  陈伟建
作者单位:1.电子科技大学光电信息学院 成都 610054;
基金项目:信息产业部电子信息产业发展基金
摘    要:重初始化是水平集方法耗时的一个主要原因,通过将水平集函数与符号距离函数的偏差作为能量项引入C-V模型,以此来约束水平集函数成为符号距离函数,从而去掉了重初始化步骤。在检测多目标时,采用了曲线族代替单曲线作为初始曲线。在数值算法上,利用加性可操作分裂算子(AOS)消除了对时间步长的限制,可以选择大步长,从而加速了演化过程而且绝对稳定。实验结果表明,分割速度相对于经典的C-V模型有了很大的提高,而精度损失可以忽略。

关 键 词:加性可操作分裂算子    C-V模型    图像分割    水平集
收稿时间:2007-04-02

Research of Fast Approach for Chan-Vese Model
JIANG Ning,ZHANG Ri-kang,PU Li-xin,CHEN Wei-jian.Research of Fast Approach for Chan-Vese Model[J].Journal of University of Electronic Science and Technology of China,2008,37(5):705-708.
Authors:JIANG Ning  ZHANG Ri-kang  PU Li-xin  CHEN Wei-jian
Affiliation:1.School of Optoelectronic Information,University of Electronic Science and Technology of China Chengdu 610054;2.School of Automation Engineering,University of Electronic Science and Technology of China Chengdu 610054;3.School of Communication and Information Engineering,University of Electronic Science and Technology of China Chengdu 610054
Abstract:The reinitialization process is quite time-consuming in level set method. A new variational formulation which is the difference between the level set function and the signed distance function is introduced to C-V model. In this way, the level set function is forced close to a signed distance function, and therefore completely eliminates the need of the constly re-initialization procedure. Also, when detecting more than one object, a group of curves are choosed to be the initial curve. In the numerical implementation, AOS scheme is adopted to eliminates limit of time step. So the large time step can be selected to accelerate the evolution velocity. The result shows that the evolution velocity is greatly improved and the precision doesn't reduce.
Keywords:
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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