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

基于A^*搜索方法的主动轮廓提取算法
引用本文:陈欣,熊岳山,谭珂,郭光友.基于A^*搜索方法的主动轮廓提取算法[J].计算机工程与科学,2006,28(1):86-88.
作者姓名:陈欣  熊岳山  谭珂  郭光友
作者单位:1. 国防科技大学计算机学院,湖南,长沙,410073;浙江师范大学信息学院,浙江,金华,321004
2. 国防科技大学计算机学院,湖南,长沙,410073
3. 解放军总医院技术教育中心,北京,100853
摘    要:在主动轮廓模型Snake的研究与应用中,如何降低Snake对初始轮廓的敏感性以厦如何保证能量极小化过程收敛到全局最小值,是两个极其重要的问题。为提取两点间的目标轮廓线,本文提出了基于A^*搜索过程的Snake算法,将Snake能量极小化问题转换成势能地图的最短路径搜索问题。实验结果表明,该算法简化了Snake的初始化过程,而且Snaake能量收敛至全局最小值,具有良好的实用性与鲁棒性。

关 键 词:主动轮廓模型  几何Snake模型  势能地图  图搜索  最短路径  A^*算法
文章编号:1007-130X(2006)01-0086-03
修稿时间:2004年7月7日

Active Contour Extraction Based on the A* Search Procedure
CHEN Xin,XIONG Yue-shan,TAN Ke,GUO Guang-you.Active Contour Extraction Based on the A* Search Procedure[J].Computer Engineering & Science,2006,28(1):86-88.
Authors:CHEN Xin  XIONG Yue-shan  TAN Ke  GUO Guang-you
Abstract:How to alleviate the sensitivity of active contour models to their initial curves and how to keep convergent to the global minimum during the iterative procedure of energy minimization are difficult problems for solving the active contour models.In order to extract open contour between two given points,a Snake approach based on the A* graph search procedure is proposed in this paper.The classical energy minimization is turned into searching the minimal weighted paths in a potential map.Our approach for active contour extraction simplifies the initialization of the Snake model,just needing two boundary points for an open contour,and the experimental results show that this method is sure to find the global minimum of the Snake energy.It is able to give satisfying solutions for contour extraction.
Keywords:active contour model  geometric Snake model  potential map  graph search  minimal path  A~* method
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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