Texture image segmentation based on entropy theory

A two-stage segmentation algorithm for textured object image is proposed based on variational approaches and entropy theory. Structure tensor of the image is adopted as the texture feature for the discrimination of texture patterns. In order to make the four information channels cooperatively push the evolving contour towards the textured foreground object, a pre-processing based on mean shift algorithm is applied, which can implement edge-preserving smoothing and has a definite stopping criterion. The Dream/sup 2/s framework is extended to the structure tensor data in the first segmentation stage in which the differential entropy is adopted as regional descriptors, and Gaussian distribution for both the foreground part and the background part is assumed. In the second stage, the nonparametric density distributions are exploited, and the mutual information between the intensity random variables of different information channels and the binary label random variable is adopted as the criterion to minimize. The nonparametric representation can describe the truly nongaussianity of data, and thus can refine the initial segmentation result obtained from the first stage.

[1]  John W. Fisher,et al.  Nonparametric methods for image segmentation using information theory and curve evolution , 2002, Proceedings. International Conference on Image Processing.

[2]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Michel Barlaud,et al.  DREAM2S: Deformable Regions Driven by an Eulerian Accurate Minimization Method for Image and Video Segmentation , 2002, International Journal of Computer Vision.

[4]  Stanley Osher,et al.  Level Set Methods , 2003 .

[5]  Michel Barlaud,et al.  DREAM2S: Deformable Regions Driven by an Eulerian Accurate Minimization Method for Image and Video Segmentation , 2002, ECCV.

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

[7]  Johan Wiklund,et al.  Multidimensional Orientation Estimation with Applications to Texture Analysis and Optical Flow , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[9]  Roman Goldenberg,et al.  Fast Geodesic Active Contours , 1999, Scale-Space.

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

[11]  Rachid Deriche,et al.  Active unsupervised texture segmentation on a diffusion based feature space , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[12]  Tony F. Chan,et al.  A Level-Set and Gabor-based Active Contour Algorithm for Segmenting Textured Images , 2002 .