The segmentation of plant roots from soil and other growing media in X-ray computed tomography images is needed to effectively study the root system architecture without excavation. However, segmentation is a challenging problem in this context because the root and non-root regions share similar features. In this paper, we describe a method based on level sets and specifically adapted for this segmentation problem. In particular, we deal with the issues of using a level sets approach on large image volumes for root segmentation, and track active regions of the front using an occupancy grid. This method allows for straightforward modifications to a narrow-band algorithm such that excessive forward and backward movements of the front can be avoided, distance map computations in a narrow band context can be done in linear time through modification of 's distance transform algorithm, and regions of the image volume are iteratively used to estimate distributions for root versus non-root classes. Results are shown of three plant species of different maturity levels, grown in three different media. Our method compares favorably to a state-of-the-art method for root segmentation in X-ray CT image volumes.
 Since their introduction as a means of front propagation and their first application to edge-based segmentation in the early 90's, level set methods have become increasingly popular as a general framework for image segmentation. In this paper, we present a survey of a specific class of region-based level set segmentation methods and clarify how they can all be derived from a common statistical framework. Region-based segmentation schemes aim at partitioning the image domain by progressively fitting statistical models to the intensity, color, texture or motion in each of a set of regions. In contrast to edge-based schemes such as the classical Snakes, region-based methods tend to be less sensitive to noise. For typical images, the respective cost functionals tend to have less local minima which makes them particularly well-suited for local optimization methods such as the level set method. We detail a general statistical formulation for level set segmentation. Subsequently, we clarify how the integration of various low level criteria leads to a set of cost functionals. We point out relations between the different segmentation schemes. In experimental results, we demonstrate how the level set function is driven to partition the image plane into domains of coherent color, texture, dynamic texture or motion. Moreover, the Bayesian formulation allows to introduce prior shape knowledge into the level set method. We briefly review a number of advances in this domain. Much effort has been made in integrating different information in a variational framework to segment images. Recent works on curve propagation were able to incorporate stochastic information (see Paragios, N. and Deriche, R., J. Visual Commun. and Image Representation, 2002; Zhu, S. and Yuille, A., 1996) and prior knowledge on shapes (see Cremers, D. et al, 2002; Rousson M. and Paragios, N., 2002). The information inserted in these studies is most of the time extracted offline. Meanwhile, other approaches have proposed to extract region information during the segmentation process itself (see Chan, T. et al, 2000; Jehan-Besson, S. et al, 2002; Yezzi, A. et al, 1999). Following these new approaches and extending the work of Paragios and Deriche to vector-valued images, we propose an entirely variational framework to approach the segmentation problem. Both the image partition and the statistical parameters for each region are unknown. After a brief reminder on recent segmenting methods, we present a variational formulation obtained from a Bayesian model. After that, we show two different differentiations driving to the same evolution equations. Detailed studies on gray and color images of the 2-phase case follow. We finish with an application to tracking which shows the benefits of our dynamic framework.