×

Active contours driven by local image fitting energy. (English) Zbl 1192.68624

Summary: A new region-based active contour model that embeds the image local information is proposed in this paper. By introducing the local image fitting (LIF) energy to extract the local image information, our model is able to segment images with intensity inhomogeneities. Moreover, a novel method based on Gaussian filtering for variational level set is proposed to regularize the level set function. It can not only ensure the smoothness of the level set function, but also eliminate the requirement of re-initialization, which is very computationally expensive. Experiments show that the proposed method achieves similar results to the LBF (local binary fitting) energy model but it is much more computationally efficient. In addition, our approach maintains the sub-pixel accuracy and boundary regularization properties.

MSC:

68T10 Pattern recognition, speech recognition
68U10 Computing methodologies for image processing
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Kass, M.; Witkin, A.; Terzopoulos, D., Snakes: active contour models, International Journal of Computer Vision, 1, 321-331 (1988)
[2] Osher, S.; Sethian, J. A., Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations, Journal of Computational Physics, 79, 12-49 (1988) · Zbl 0659.65132
[3] V. Caselles, R. Kimmel, G. Sapiro, Geodesic active contours, in: Processing of IEEE International Conference on Computer Vision’95, Boston, MA, 1995, pp. 694-699.; V. Caselles, R. Kimmel, G. Sapiro, Geodesic active contours, in: Processing of IEEE International Conference on Computer Vision’95, Boston, MA, 1995, pp. 694-699. · Zbl 0894.68131
[4] Caselles, V.; Kimmel, R.; Sapiro, G., Geodesic active contours, International Journal of Computer Vision, 22, 1, 61-79 (1997) · Zbl 0894.68131
[5] Chan, T.; Vese, L., Active contour without edges, IEEE Transaction on Image Processing, 10, 2, 266-277 (2001) · Zbl 1039.68779
[6] Zhu, G. P.; Zhang, Sh. Q.; Zeng, Q. SH.; Wang, Ch. H., Boundary-based image segmentation using binary level set method, SPIE OE Letters, 46, 5 (2007)
[7] Lie, J.; Lysaker, M.; Tai, X. C., A binary level set model and some application to Mumford-Shah image segmentation, IEEE Transaction on Image Processing, 15, 1171-1181 (2006) · Zbl 1286.94018
[8] Mumford, D.; Shah, J., Optimal approximation by piecewise smooth function and associated variational problems, Communication on Pure and Applied Mathematics, 42, 577-685 (1989) · Zbl 0691.49036
[9] C.M. Li, C.Y. Xu, C.F. Gui, M.D. Fox, Level set evolution without re-initialization: a new variational formulation, in: IEEE Conference on Computer Vision and Pattern Recognition, San Diego, 2005, pp. 430-436.; C.M. Li, C.Y. Xu, C.F. Gui, M.D. Fox, Level set evolution without re-initialization: a new variational formulation, in: IEEE Conference on Computer Vision and Pattern Recognition, San Diego, 2005, pp. 430-436.
[10] C.M. Li, C. Kao, J. Gore, Z. Ding, Implicit active contours driven by local binary fitting energy, in: IEEE Conference on Computer Vision and Pattern Recognition, 2007.; C.M. Li, C. Kao, J. Gore, Z. Ding, Implicit active contours driven by local binary fitting energy, in: IEEE Conference on Computer Vision and Pattern Recognition, 2007.
[11] Li, C.; Kao, C.; Gore, J.; Ding, Z., Minimization of region-scalable fitting energy for image segmentation, IEEE Transactions on Image Processing, 17, 1940-1949 (2008) · Zbl 1371.94225
[12] Shi, Y.; Karl, W. C., Real-time tracking using level sets, IEEE Conference on Computer Vision and Pattern Recognition, 2, 34-41 (2005)
[13] Perona, P.; Malik, J., Scale-space and edge detection using anisotropic diffusion, IEEE Transaction on Pattern Analysis and Machine Intelligence, 12, 629-640 (1990)
[14] Paragios, N.; Deriche, R., Geodesic active contours and level sets for detection and tracking of moving objects, IEEE Transaction on Pattern Analysis and Machine Intelligence, 22, 1-15 (2000)
[15] Osher, S.; Fedkiw, R., Level Set Methods and Dynamic Implicit Surfaces (2002), Springer: Springer New York
[16] Tsai, A.; Yezzi, A.; Willsky, A. S., Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification, IEEE Transaction on Image Processing, 10, 1169-1186 (2001) · Zbl 1062.68595
[17] Vese, L. A.; Chan, T. F., A multiphase level set framework for image segmentation using the Mumford-Shah model, International Journal of Computer Vision, 50, 271-293 (2002) · Zbl 1012.68782
[18] Ronfard, R., Region-based strategies for active contour models, International Journal of Computer Vision, 46, 223-247 (2002)
[19] Paragios, N.; Deriche, R., Geodesic active regions and level set methods for supervised texture segmentation, International Journal of Computer Vision, 46, 223-247 (2002) · Zbl 1012.68726
[20] Malladi, R.; Sethian, J. A.; Vemuri, B. C., Shape modeling with front propagation: a level set approach, IEEE Transaction on Pattern Analysis and Machine Intelligence, 17, 158-175 (1995)
[21] Liu, H.; Chen, Y.; Chen, W., Neighborhood aided implicit active contours, IEEE Conference on Computer Vision and Pattern Recognition, 1, 841-848 (2006)
[22] Aubert, G.; Kornprobst, P., Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations (2002), Springer: Springer New York · Zbl 1109.35002
[23] Vasilevskiy, A.; Siddiqi, K., Flux-maximizing geometric flows, IEEE Transaction on Pattern Analysis and Machine Intelligence, 24, 1565-1578 (2002)
[24] Zhao, H.-K.; Chan, T.; Merriman, B.; Osher, S., A variational level set approach to multiphase motion, Journal of Computational Physics, 127, 179-195 (1996) · Zbl 0860.65050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.