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

基于极坐标中蛇模型的类圆目标轮廓提取技术研究
引用本文:龙德帆,樊尚春. 基于极坐标中蛇模型的类圆目标轮廓提取技术研究[J]. 电路与系统学报, 2006, 11(3): 118-120
作者姓名:龙德帆  樊尚春
作者单位:北京航空航天大学,仪器科学与光电工程学院,北京,100083
摘    要:提出了转化到极坐标中的蛇模型.通过把蛇模型转化到极坐标中,使轮廓的候选点得以更有序的排列.由于采用了动态规划法并在整个能量空间中搜索能量泛函的极值,算法对能量泛函的局部极值有较强的鲁棒性.所提出的模型不需要确定初始轮廓,可以用非迭代方法直接求解.与传统的动态规划法和贪婪算法进行了比较实验.结果表明,所提出的算法对极坐标中极点的位置不是很敏感.

关 键 词:Snake 极坐标 类圆目标 动态规划 贪婪算法 活动轮廓模型
文章编号:1007-0249(2006)03-0118-03
收稿时间:2004-02-06
修稿时间:2004-05-11

Extraction of the contours of elliptic objects based on polar-transformed snake
LONG De-fan,FAN Shang-chun. Extraction of the contours of elliptic objects based on polar-transformed snake[J]. Journal of Circuits and Systems, 2006, 11(3): 118-120
Authors:LONG De-fan  FAN Shang-chun
Abstract:A polar-transformed snake for extraction of the contours of elliptic objects is presented. The candidate points for the contour are collocated by transforming the snake into polar coordinates. The proposed approach is robust to local minima of the energy functional because it is minimized by dynamic programming method in the whole energy space. A precise initial contour is not necessary and the solution can be obtained non-iteratively. The proposed algorithm is compared with the methods based on dynamic programming and greedy. Results show that the model is robust to local minima and the location of origin of the polar coordinates.
Keywords:snake   polar coordinates   elliptic object   dynamic programming   greedy algorithm   active contour model
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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