Minimal Stochastic Complexity Image Partitioning With Unknown Noise Model

We present a generalization of a new statistical technique of image partitioning into homogeneous regions to cases where the family of the probability laws of the gray-level fluctuations is a priori unknown. For that purpose, the probability laws are described with step functions whose parameters are estimated. This approach is based on a polygonal grid which can have an arbitrary topology and whose number of regions and regularity of its boundaries are obtained by minimizing the stochastic complexity of the image. We demonstrate that efficient homogeneous image partitioning can be obtained when no parametric model of the probability laws of the gray levels is used and that this approach leads to a criterion without parameter to be tuned by the user. The efficiency of this technique is compared to a statistical parametric technique on a synthetic image and is compared to a standard unsupervised segmentation method on real optical images

[1]  O Ruch,et al.  Minimal-complexity segmentation with a polygonal snake adapted to different optical noise models. , 2001, Optics letters.

[2]  Philippe Réfrégier,et al.  Influence of the noise model on level set active contour segmentation , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Peter J. W. Rayner,et al.  Unsupervised image segmentation using Markov random field models , 1997, Pattern Recognit..

[4]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[5]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[6]  J. Jao.  Amplitude distribution of composite terrain radar clutter and the κ-Distribution , 1984 .

[7]  Harry Shum,et al.  Image segmentation by data driven Markov chain Monte Carlo , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[8]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[9]  Alan L. Yuille,et al.  Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  R. Chellappa,et al.  SEGMENTATION OF SYNTHETIC APERTURE RADAR COMPLEX DATA , 1990, 1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, 1990..

[12]  Patrick A. Kelly,et al.  Adaptive segmentation of speckled images using a hierarchical random field model , 1988, IEEE Trans. Acoust. Speech Signal Process..

[13]  B. S. Manjunath,et al.  Unsupervised Segmentation of Color-Texture Regions in Images and Video , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Christophe Chesnaud,et al.  Statistical Region Snake-Based Segmentation Adapted to Different Physical Noise Models , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Silvana G. Dellepiane,et al.  Synthetic aperture radar image segmentation by a detail preserving Markov random field approach , 1997, IEEE Trans. Geosci. Remote. Sens..

[16]  Tapas Kanungo,et al.  A fast algorithm for MDL-based multi-band image segmentation , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[17]  R. G. White,et al.  Change detection in SAR imagery , 1990 .

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

[19]  Jitendra Malik,et al.  Learning to detect natural image boundaries using local brightness, color, and texture cues , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Yvan G. Leclerc,et al.  Constructing simple stable descriptions for image partitioning , 1989, International Journal of Computer Vision.

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

[22]  Frédéric Galland,et al.  Minimum description length synthetic aperture radar image segmentation , 2003, IEEE Trans. Image Process..

[23]  S. Sangwine,et al.  The Colour Image Processing Handbook , 1998, Springer US.

[24]  Frédéric Galland,et al.  Multi-component image segmentation in homogeneous regions based on description length minimization: Application to speckle, Poisson and Bernoulli noise , 2005, Pattern Recognit..

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

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

[27]  Anil K. Jain.  Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

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

[29]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[30]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[31]  Rod Cook,et al.  MUM (Merge Using Moments) segmentation for SAR images , 1994, Remote Sensing.

[32]  Peter Meer,et al.  Edge Detection with Embedded Confidence , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  José M. N. Leitão,et al.  Unsupervised contour representation and estimation using B-splines and a minimum description length criterion , 2000, IEEE Trans. Image Process..

[34]  Henryk Palus,et al.  Representations of colour images in different colour spaces , 1998 .