Re ion COm et it ion: Unifying Snakes,Region Growing, inergy/Bayes P MDL for Multi-band Image Segmentation

their boundaries and require good initial estimates to yield We present a novel statistical and variational approach to image segmentation baaed on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL(Minimum Description Length) criterion using the variational principle. We show that existing techniques in early vision such as, snake/balloon models, region growing, and Bayes/MDL are addressing different aspects of the same problem and they can be unified within a common statistical framework which combines their advantages. We analyze how to optimize the precision of the resulting boundary location by studying the statistical properties of the region competition algorithm and discuss what are good initial conditions for the algorithm. Our method is generalized to color and texture segmentation and is demonstrated on grey level images, color images and texture images.

[1]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Ruzena Bajcsy,et al.  Segmentation as the search for the best description of the image in terms of primitives , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[3]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Laurent D. Cohen,et al.  On active contour models and balloons , 1991, CVGIP Image Underst..

[6]  Alan L. Yuille,et al.  A common framework for image segmentation , 1990, International Journal of Computer Vision.