A fast region-based image segmentation based on least square method

Image segmentation is always very important for computer vision and pattern recognition. Moreover, how to fast extract objects from a given image is still a problem for real time image processing. Most of the traditional region-based models depend on global information to converge to minimum error segmentation, but they are always time-consuming, and result in no effective segmentation. In this paper, we propose a region-based model with weight matrix to detect objects fast based on Least Square Method. The basic ideal of our model is to build up a minimum error functional by approximating objects and background of original image with two constants respectively. At the same time, we introduce a weight matrix into the region-based model, which can enhance the weight of objects while reducing the influence from background. Our method can fast converge through alternating iterations under Least Square Method. We also compare it with other region-based methods to show the improvements that can be achieved. Experimental results show the advantages of our method in terms of efficiency in image segmentation without losing accuracy.

[1]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[2]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods/ J. A. Sethian , 1999 .

[3]  Dimitris N. Metaxas,et al.  CRF-driven Implicit Deformable Model , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[5]  Tony F. Chan,et al.  A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model , 2002, International Journal of Computer Vision.

[6]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[7]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[8]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[9]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[10]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[11]  Chunming Li,et al.  Implicit Active Contours Driven by Local Binary Fitting Energy , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  Chunming Li,et al.  Level set evolution without re-initialization: a new variational formulation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[13]  Allen R. Tannenbaum,et al.  Localizing Region-Based Active Contours , 2008, IEEE Transactions on Image Processing.

[14]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  T. Chan,et al.  A Variational Level Set Approach to Multiphase Motion , 1996 .

[16]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[17]  Rachid Deriche,et al.  Geodesic Active Regions and Level Set Methods for Supervised Texture Segmentation , 2002, International Journal of Computer Vision.

[18]  Jerry L. Prince,et al.  Snakes, shapes, and gradient vector flow , 1998, IEEE Trans. Image Process..

[19]  Anthony J. Yezzi,et al.  Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification , 2001, IEEE Trans. Image Process..