Piecewise Constant Level Set Method for 3D Image Segmentation
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piecewise Constant Level Set Methods (PCLSM), have been proposed for some interface problems. The methods need to minimize a smooth cost functional under some special constraints. In this paper a PCLSM for 3D image segmentation is tested. The algorithm uses the gradient descent method combined with a Quasi-Newton method to minimize an augmented Lagrangian functional. Experiments for medical image segmentation are shown on synthetic three dimensional MR brain images. The efficiency of the algorithm and the quality of the obtained images are demonstrated.
Unable to display preview. Download preview PDF.
- 3.Osher, S., Burger, M.: A survey on level set methods for inverse problems and optimal design. Cam-report-04-02, UCLA, Applied Mathematics (2004)Google Scholar
- 5.Chan, T.F., Vese, L.A.: Image segmentation using level sets and the piecewise constant mumford-shah model. Technical report, CAM Report 00-14, UCLA, Math. Depart (April 2000, revised December 2000)Google Scholar
- 6.Osher, S., Sethian, J.: Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1) (1988)Google Scholar
- 7.Chan, T., Vese, L.: Active contours without edges. In: IEEE Image Proc., vol. 10, pp. 266–277 (2001)Google Scholar
- 8.Lie, J., Lysaker, M., Tai, X.C.: A variant of the level set method and applications to image segmentation. Math. Comp. 75(255) (2006)Google Scholar
- 10.Christiansen, O., Tai, X.-C.: Fast implementation of piecewise constant level set methods. In: Image processing based on partial differential equations, pp. 253–272. Springer, Heidelberg (2006)Google Scholar
- 14.Song, B., Chan, T.F.: Fast algorithm for level set segmentation. UCLA CAM report 02-68 (2002)Google Scholar
- 15.Gibou, F., Fedkiw, R.: A fast hybrid k-means level set algorithm for segmentation. In: 4th Annual Hawaii International Conference on Statistics and Mathematics, pp. 281–291 (2005)Google Scholar
- 17.Shi, Y., Karl, W.C.: A fast level set method without solving pdes. In: ICASSP’05 (2005)Google Scholar
- 18.Goldenberg, R., et al.: Cortex Segmentation: A Fast Variational Geometric Approach. IEEE Transactions on medical imaging 21(2) (2002)Google Scholar
- 19.Holtzman-Gazit, M., et al.: Segmentation of Thin Structures in Volumetric Medical Images. IEEE Transactions on image processing 15(2) (2006)Google Scholar
- 20.Mumford, D., Shah, J.: Optimal approximation by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math, 42 (1989)Google Scholar
- 21.McConnell Brain Imaging Centre, Montréal Neurological Institute, M.U.: Brainweb (12.6.2006), http://www.bic.mni.mcgill.ca/brainweb/