部分最優(yōu)化動態(tài)規(guī)劃輪廓檢測算法
Partial Optimal Dynamic Programming Contour Detection Algorithm
-
摘要: 在研究動態(tài)輪廓模型原理及其求解算法的基礎(chǔ)上提出了一種新的部分最優(yōu)化動態(tài)規(guī)劃輪廓檢測算法，保留了動態(tài)規(guī)劃算法的性能和優(yōu)點，但綜合運算復(fù)雜度降低，運算速度大大提高。
-
關(guān)鍵詞:
- 輪廓檢測;動態(tài)輪廓模型;動態(tài)規(guī)劃;計算機視覺
Abstract: Basing on studying the principle of active contour model and some solutions to it, a new partial optimal dynamic programming contour detection algorithm is presented and the results comparable to the dynamic programming algorithm are given. Experiment shows such new algorithm is much faster. -
Kass M,Witkin A,Terzopoulos D.Snake:Active contour models[J].International Journal of Computer Vision.1988,1(4):321-331[2]Williams D J,Shah M.A fast algorithm for active contours.In Proc.Third Int.Conf.Computer Vision,Osaka Japan,Dec.4-7,1990:592-595.[3]Williams D J,Shah M.A fast algorithm for active contours and curvature estimation.CVGIP:Image Understanding,1991,55(1):14-26.[4]Amini A,Tehrani S,Whemouth T.Using dynamic programming for minimizing the energy of active contours in the presence of hard constraints.In Proc.Second Int.Conf.Computer Vision.Tarpon Springs,FL,Dec.5-8,1988:95-99.[5]Amini A,Whemouth T,Jain R.Using dynamic programming for solving variational problems in vision.IEEE Trans.on Pattern Anal.Machine Intell.,1990,PAMI-12(9):855-867.[6]Mokhtarian F,Mohanna F.Fast active contour convergence through adaptive curvature scale space smoothing.In Proc.Int.Conf Computer Vision,Pattern Recognition and Image Processing.Durham,North Carolina,2002:724-727.[7]Park H,Schoepflin T,Kim Y.Active contour model with gradient directional information:directional snake[J].IEEE Trans.on Circuits and Systems for Video Technology.2001,11(2):252-256[8]Kang D J.A fast and stable snake algorithm for medical images.Pattern Recognition Letters,1999,1(1):507-512. -
計量
- 文章訪問數(shù): 2282
- HTML全文瀏覽量: 114
- PDF下載量: 804
- 被引次數(shù): 0
下載:
