吉林大学学报(工学版) ›› 2013, Vol. 43 ›› Issue (增刊1): 115-119.

Previous Articles     Next Articles

Two algorithms for level set method preserving signed distance functions

LIU Cun-liang1,2, PAN Zhen-kuan1, ZHENG Yong-guo2, DUAN Jin-ming1, ZHANG Feng1   

  1. 1. College of Information Engineering, Qingdao University, Qingdao 266071, China;
    2. College of Information Science & Engineering, Shandong University of Science & Technology, Qingdao 266510, China
  • Received:2012-06-05 Published:2013-06-01

Abstract:

The well-known Chan-Vese model has been widely used in image segmentation.However,the original model is limited by two important numerical issues.Firstly,the level set method does not implicitly preserve the level set function as a signed distance function.Secondly,the level set method is slow because of the gradient descent equation.In this paper,two fast algorithms,a dual method and a split Bregman method,were proposed to improve the computation efficiency.In order to force the level set function to be a signed distance function during evolution,a projection approach was proposed to solve the constraint,and then the augmented Lagrangian method was used to speed up the convergence rate.The experimental results demonstrate that the proposed methods not only have better performance,but also are more efficient than the gradient descent method.

Key words: Chan-Vese model, level set method, dual method, split Bregman method, augmented Lagrangian method

CLC Number: 

  • TP391.41

[1] Osher S,Sethian J A.Fronts propagating with curvature-dependent speed:Algorithms based on Hamilton-Jacobi formulations[J].Journal of Computational Physics,1988,79(1):12-49.

[2] Caselles V,Catte F,Coll T,Dibos F.A geometric model for active contours in image processing[J].Numerische Mathematik,1993,66(1):1-31.

[3] Malladi R,Sethian J A,Vemuri B C.Shape modeling with front propagation:A level set approach[J].IEEE Transaction on Pattern Analysis and Machine Intelligence,1995,17(2):158-175.

[4] Kass M,Witkin A,Terzopoulos D.Snakes:Active contour models[J].International Journal of Computer Vision,1987,1(4):321-331.

[5] Caselles V,Kimmel R,Sapiro G.Geodesic active contours[J].International Journal of Computer Vision,1997,22(1):61-79.

[6] Chan T F,Vese L A.Active contours without edges[J].IEEE Transactions on Image Processing,2001,10(2):266-277.

[7] Bresson X,Esedoglu S,Vandergheynst P,et al.Fast global minimization of the active contour/snake model[J].Journal of Mathematical Imaging and Vision,2007,28(2):151-167.

[8] Goldstein T,Bresson X,Osher S.Geometric applications of the Split Bregman method:segmentation and surface reconstruction[J].Journal of Scientific Computing,2010,45(1):272-293.

[9] 潘振宽,李华,魏伟波等.三维图像多相分割的变分水平集方法[J].计算机学报,2009,32(12):2464-2474. Pan Zen-kuan,Li Hua,Wei Wei-bo,et al.A variational level set method of multiphase segmentation for 3D images[J].Chinese Journal of Computers,2009,32(12):2464-2474.

[10] 王琦,潘振宽,魏伟波.隐式曲面两相图像分割的变分水平集模型及对偶方法[J].电子学报,2011,39(1):207-212. Wang Qi,Pan Zhen-kuan,Wei Wei-bo.Variational image segmentation on implicit surface using dual methods[J].Acta Electronica Sinica,2011,39(1):207-212.

[11] Courant R,Friedrichs K,Lewy H.On the partial difference equations of mathematical physics[J].IBM Journal of Research and Development,1967,11(2):215-234.

[12] Wu C,Tai X.Augmented Lagrangian method,dual methods,and Split Bregman iteration for ROF,vectorial TV,and high order models[J].SIAM Journal on Imaging Sciences,2010,3:300-339.

[13] Chambolle A.An algorithm for total variation minimization and applications[J].Journal of Mathematical Imaging and Vision,2004,20(1):89-97.

[14] Chan T,Kang S H,Shen J H.Euler's elastica and curvature based inpaintings[J].SIAM Journal on Applied Mathematics,2002,63(2):564-592.

[1] SHEN Xuan-jing, YU Kai-min, WANG Kai-ye, CHEN Hai-peng. Image segmentation algorithm of combining global and local grayscale fitting for active contour model [J]. , 2012, (06): 1532-1537.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!