Segmentation of coherent active images, which schematically consists in determining the shape of objects present in a scene, is a challenging problem due to the large fluctuations inherent to speckle noise. Snake algorithms have made it possible to improve the segmentation performance of a single object in video images, but they are not well suited to speckled images. Furthermore, they require regularization techniques to obtain smooth contours, which introduces free parameters in the algorithm that must be adjusted by supervised learning. We recently introduced a new technique based on a polygonal description of the contour to be segmented and on the optimization of a statistical criterion. This approach leads to good performance for the segmentation of a target with homogeneous random gray levels but still requires a regularization term. Here, we show that a new technique based on the Minimum Description Length principle makes it possible to efficiently segment an object in a speckled image with a fast algorithm which has no free parameters. This method is thus fully automatic and well suited to speckled images, and we propose to illustrate its capabilities on classical and polarimetric active speckled images.
Information theory-based snake segmentation adapted to speckled images
19th Congress of the International Commission for Optics: Optics for the Quality of Life ; 2002 ; Florence,Italy
Proc. SPIE ; 4829
2003-11-19
Conference paper
Electronic Resource
English
Estimation of Spectra from Speckled Images
IEEE | 1982
|Snake-based liver lesion segmentation
IEEE | 2004
|A Snake for Model-Based Segmentation
British Library Conference Proceedings | 1995
|WaterBalloons: A hybrid watershed Balloon Snake segmentation
British Library Online Contents | 2008
|