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

邻域自适应调整的Snake算法
引用本文:秦中元,牟轩沁,蔡元龙. 邻域自适应调整的Snake算法[J]. 小型微型计算机系统, 2005, 26(4): 684-686
作者姓名:秦中元  牟轩沁  蔡元龙
作者单位:1. 西安交通大学,电子与信息工程学院,图像所,陕西,西安,710049;东南大学,无线电工程系,江苏,南京,210096
2. 西安交通大学,电子与信息工程学院,图像所,陕西,西安,710049
基金项目:国家自然科学基金项目(30070225)资助
摘    要:提出了一种自适应的Snake算法,对于初始包络上的每一点,按照Greedy算法中的能量公式计算其邻城内各点的能量.如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻城内各点的能量,直到邻城内包含轮廓点为止.该算法只需迭代一次即可得到目标轮廓.而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况.对比实验说明了这种方法的有效性。

关 键 词:主动轮廓模型 邻域 自适应
文章编号:1000-1220(2005)04-0684-03

Snake Algorithm of Neighborhood Adaptive Modification
QIN Zhong-yuan,MOU Xuan-qin,CAI Yuan-long. Snake Algorithm of Neighborhood Adaptive Modification[J]. Mini-micro Systems, 2005, 26(4): 684-686
Authors:QIN Zhong-yuan  MOU Xuan-qin  CAI Yuan-long
Affiliation:QIN Zhong-yuan 1,2,MOU Xuan-qin 1,CAI Yuan-long 1 1
Abstract:An adaptive Snake algorithm is presented in this paper. To every point in the initial position, the energy of the point in its neighbors is calculated using the formula given in Greedy algorithm. If the target contour is not included in its neighbors, the radius of its neighbors is increased and energy of all the points are calculated again until target contour is included. The target contour can be got after only one iteration and the convergent radius is increased. The bulge in contour can also be processed. Comparative experiments indicate the validity of this method.
Keywords:active contour model  neighborhood  adaptive
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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