关键词: 主动轮廓模型 几何Snake模型 势能地图 图搜索 最短路径 A^＊算法

Abstract:

How to alleviate the sensitivity of active contour models to their initial curves and bow to keep convergent to the global minimum during the iterative procedure of energy minimization are difficult problems for solving the active eontour models. In order to extract open contour between two given poin ts, 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.

Key words: active contour model, geometric Snake model, potential map, graph search, minimal path , A^＊ method