Abstract
Variational models for image segmentation are usually solved by the level set method, which is not only slow to compute but also dependent on initialization strongly. Recently, fuzzy region competition models or globally convex segmentation models have been introduced. They are insensitive to initialization, but contain TV-regularizers, making them difficult to compute. Goldstein, Bresson and Osher have applied the split Bregman iteration to globally convex segmentation models which avoided the regularization of TV norm and speeded up the computation. However, the split Bregman method needs to solve a partial differential equation (PDE) in each iteration. In this paper, we present a simple algorithm without solving the PDEs proposed originally by Jia et al. (2009) with application to image segmentation problems. The algorithm also avoids the regularization of TV norm and has a simpler form, which is in favor of implementing. Numerical experiments show that our algorithm works faster and more efficiently than other fast schemes, such as duality based methods and the split Bregman scheme.
Similar content being viewed by others
References
Bresson, X., Esedoglu, S., Vandergheynst, P., Thiran, J.-P., Osher, S.: Fast global minimization of the active contour/snake model. J. Math. Imaging Vis. 28, 151–167 (2007)
Cai, J.-F., Osher, S., Shen, Z.: Split Bregman methods and frame based image restoration. Multiscale Model. Simul.: A SIAM Interdisciplinary Journal 8, 337–369 (2009)
Caselles, V., Catte, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numer. Math. 66, 1–31 (1993)
Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. In: Fifth International Conference on Computer Vision, pp. 694–699 (1995)
Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20(1–2), 89–97 (2004)
Chambolle, A., Lions, P.-L.: Image recovery via total variation minimization and related problems. Numer. Math. 76, 167–188 (1997)
Chan, T.F., Esedoglu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. Appl. Math. 66(5), 1632–1648 (2006)
Chan, T.F., Vese, L.: A level set algorithm for minimizing the Mumford-Shah functional in image processing. In: IEEE Workshop on Variational and Level Set Methods, pp. 161–168 (2001)
Chan, T.F., Vese, L.: Active contours without edges. IEEE Trans. Image Process. 10(2), 266-277 (2001)
Goldstein, T., Bresson, X., Osher, S.: Geometric applications of the split Bregman method: Segmentation and surface reconstruction. UCLA CAAM Report 09–06 (2009)
Goldstein, T., Osher, S.: The split Bregman method for L1 regularized problems. UCLA CAAM Report 08–29 (2008)
Jia, R.-Q., Zhao, H.Q.: A fast algorithm for the total variation model of image denoising. Adv. Comput. Math. (2009). doi:10.1007/s10444-009-9128-5
Jia, R.-Q., Zhao, H.Q. , Zhao, W.: Convergence analysis of the Bregman method for the variational model of image denosing. Appl. Comput. Harmon. Anal. (2009). doi:10.1016/j.acha.2009.05.002
Kass, W., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. Int. J. Comput. Vis. 1(4), 312–331 (1988)
Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A., Yezzi, A.: Gradient flows and geometric active contour models. In: Fifth International Conference on Computer Vision. Cambridge, MA (1995)
Kim, J., Fisher, J.W., Yezzi, A., Çetin, M., Willsky, A.S.: A nonparametric statistical method for image segmentation using information theory and curve evolution. IEEE Trans. Image Process. 14(10), 1486–1502 (2005)
Kimmel, R.: Fast edge integration. In: Osher S., Paragios N. (eds.) Geometric Level Set Methods in Imaging, Vision, and Graphics, pp. 59–78. Springer-Verlag, New-York (2003)
Li, C.M., Kao, C.-Y., Gore, J.C., Ding, Z.H.: Implicit active contours driven by local binary fitting energy. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2007)
Mory, B., Ardon, R.: Fuzzy region competition: a convex two-phase segmentation framework. In: First International Conference on Scale Space Methods and Variational Methods in Computer Vision (SSVM), LNCS 4485, pp. 214–226 (2007)
Mumford, D., Shah, J.: Optimal approximation by piecewise smooth functions and associated variational problems. Commun. Pure Appl. Math. 42, 577–685 (1989)
Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4, 460–489 (2005)
Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations. J. Comput. Phys. 79, 12–49 (1988)
Paragios, N., Deriche, R.: Geodesic active regions: a new framework to deal with frame partition problems in computer vision. J. Vis. Commun. Image Represent. 13(1), 249–268 (2002)
Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D 60, 259–268 (1992)
Zhao, H.K., Chan, T., Merriman, B., Osher, S.: A variational level set approach to multiphase motion. J. Comput. Phys. 127, 179–195 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Q. Jia.
This work was supported in part by the NNSF of China (Grant No. 10971190) and the Qiu-Shi Chair Professor Fellowship from Zhejiang University.
Rights and permissions
About this article
Cite this article
Dong, F., Liu, C. & Kong, DX. A fast algorithm for image segmentation based on fuzzy region competition. Adv Comput Math 37, 521–542 (2012). https://doi.org/10.1007/s10444-011-9221-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-011-9221-4
Keywords
- Image segmentation
- Variational models
- Level set method
- Fuzzy region competition
- Split Bregman method
- Jia and Zhao’s algorithm