International Journal of Biomedical Imaging

Volume 2009 (2009), Article ID 968986, 9 pages

http://dx.doi.org/10.1155/2009/968986

## Region-Based PDEs for Cells Counting and Segmentation in 3D+Time Images of Vertebrate Early Embryogenesis

^{1}DEIS, University of Bologna, Via Venezia 52, 47521 Cesena, Italy^{2}DEIS, University of Bologna, Via Risorgimento 2, 40136 Bologna, Italy

Received 20 October 2008; Accepted 16 July 2009

Academic Editor: David Wilson

Copyright © 2009 Barbara Rizzi and Alessandro Sarti. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper is devoted to the segmentation of cell nuclei from time lapse confocal microscopy images, taken throughout early Zebrafish embryogenesis. The segmentation allows to identify and quantify the number of cells in the animal model. This kind of information is relevant to estimate important biological parameters such as the cell proliferation rate in time and space. Our approach is based on the active contour model without edges. We compare two different formulations of the model equation and evaluate their performances in segmenting nuclei of different shapes and sizes. Qualitative and quantitative comparisons are performed on both synthetic and real data, by means of suitable gold standard. The best approach is then applied on a number of time lapses for the segmentation and counting of cells during the development of a zebrafish embryo between the sphere and the shield stage.

#### 1. Introduction

The cell morphodynamics underlying the processes that control the organized spatial distribution of cells during the embryonic development are nowadays largely unknown. A single fertilized egg-cell (zygote) undergoes cellular divisions, differentiations, and interactions giving rise to specific forms of tissues and organs. The reconstruction of the nuclei shape and the identification of their number and position during embryogenesis are an essential tool for an integrated understanding of such morphogenetic processes. This kind of information is relevant to estimate the cell growth and identify cell divisions and apoptosis. It is a helpful tool to extract parameters such as the cell proliferation rate in time and space. It is relevant for investigating stem cells populations and early steps of cancerogenesis, opening the way for the preclinical evaluation of anticancer drug effects in vivo. We apply in this paper a region-based segmentation algorithm to segment the nuclei in a live zebrafish embryo. Since during the acquisition the embryo is growing up, the cell number strongly increases. The segmentation easily allows to identify the nuclei and count their number in time. Furthermore, since prior and during mitosis the nuclei condense and lengthen along the future cell division plane, the segmentation is a helpful tool to identify cell divisions. Our approach is based on the active contour model without edges. We consider and compare two different forms of the equation originally proposed by Chan and Vese [1]. Comparison is performed through qualitative and quantitative analysis of results on both phantoms and real data. We then apply to our dataset the formulation that ensures the best performances.

In the rest of the paper we first describe the data acquisition process (Section 2). In Section 3 we introduce the active contour model without edges and both tested formulations. In Section 4 we show and quantify results and justify our choice of method and parameters. Conclusions are provided in Section 5.

#### 2. Image Acquisition

##### 2.1. The Animal Model

The zebrafish (Danio Rerio) is a model organism extensively studied to explore the gene function and vertebrate development [2–7] and might soon become a major model organism for preclinical drug testing by pharmaceutical industries. Although distant from humans, nevertheless it has comparable organs and tissues and may supplement higher vertebrate models. Compared with mice, zebrafish embryo develops rapidly and externally to the mother, favoring its manipulation. Its transparency allows the visual inspection of the internal anatomy. Due to its ability to regenerate fins, skin, the heart, and the brain, it is an object of study to understand healing/repair mechanisms in vertebrates.

##### 2.2. Animal Preparation and Laser Confocal Microscopy Set-Up

To reconstruct the shape and the position of every nucleus in a live zebrafish embryo is necessary to stain all the cells and use an acquisition technique with micrometrical resolution. This is a very challenging approach requiring specific methodologies and tools in embryos engineering and microscopy imaging. Recent advances in imaging strategies open the way to in 4D imaging of live animals with a resolution at the cellular level and enough contrast to allow segmentation of individual cells. Through the ubiquitous expression of fluorescent proteins in the zebrafish embryo, it is possible to label all the cells and perform time-lapse CLSM (confocal laser scanning microscopy) imaging throughout embryonic development.

The embryo used in this paper to design and validate our strategy has been stained through injection at the one cell stage of RNAs encoding farnesylated mCherry fluorescent protein and histone H2B/eGFP fusion protein. This allows the simultaneous acquisition of two different signals, membranes and nuclei, respectively. In this paper we focus our attention on nuclei. The images have been acquired using a Confocal Microscope Leica SP2 AOBS with a 40x/0.8 NA water objective and 488 nm and 561 nm laser light excitation. We used the best compromise in terms of embryo survival and spatial and temporal resolution, as suggested in [8]. The data has been acquired for four hours (25°C under the microscope), starting at 3.5-hour postfertilization (development at 28°C) from the animal pole. Due to the lower temperature, during the acquisition the normal embryo development [9] is slowed down and by the end it reaches the shield stage (see Figure 1).

Images are acquired parallel to the focal plane , at regularly spaced depth to build a stack. The procedure has been repeated every 5 minutes to generate a temporal sequence of 49 volumes. Every volume consists of voxels. The dimension of each voxel is . In the entire period of development, the whole embryo looks like a sphere with a diameter of 740 . As the 3D images have a physical dimension of , they cover only the top part of the embryo, as depicted in Figure 1.

Observing Figure 2(a) is possible to note how the typology of staining influences the features of original data. As the histone H2B protein is a component of the chromatin, nuclei in mitosis appear well contrasted, as chromosomes are condensing along the future division plane. Conversely cell nuclei in interphase show a nonuniform image intensity and boundaries often not clearly defined. We explain in next section how this peculiarity leads to the choice of the segmentation method.

#### 3. Image Segmentation

One of the most popular approaches for image segmentation is the active contour model or snake [10], based on the evolution of a curve attracted by image boundaries in order to detect objects. Malladi et al. [11] and Caselles et al. [12] implemented such models using level set methods, introduced first by Osher and Sethian [13] and extensively used to track the evolution of fronts in a variety of applications. With the level set methods the desired curve of active contour models is embedded as zero level set of an implicit function, overcoming the drawbacks of the original snakes models [10] as the difficulties related to topological transformations. However, the above-mentioned active contour models are edge-based; that is, a curve is evolved with a speed function depending on a precomputed edge indicator defined by the image gradient. Dealing with image derivatives, a preprocessing step is required to remove the noise and smooth the image. If the objects are not well contrasted, the denoising can disrupt image information and preclude the correct identification of objects surface. Lately a region-based level-set method has been proposed by Chan and Vese [1] to segment objects whose boundaries are not defined by a gradient. The model does not require preprocessing and is based on the informations provided directly by the image intensity. The Chan Vese approach is then well adapted to situations in which images are noisy, and it is difficult to extract the boundary of the desired object. These features make the method well suitable to our typology of data.

##### 3.1. The Chan Vese Model

Let us consider a 3D image as a real positive function defined in a rectangular domain . The Chan Vese [1] model moves an arbitrary surface for decomposing the image into two regions of approximately piecewise-constant intensities: the objects to be detected and the background. Such decomposition is obtained by minimizing the following energy functional: where and are, respectively, the averages of inside and outside , and , , and are fixed parameters. While the first term of the right side of (1) controls its smoothness, the surface separates the image into distinct regions depending on their mean values. The parameter plays an important role in the segmentation process, as it acts like a scale parameter. The minimization problem is solved using the level set method. Let , is represented as a zero level set of an implicit function : such that The level set flow associated to (1) is computed as where is the Dirac function, denotes the exterior normal to the boundary , and is an initial function with the property that its zero level set corresponds to the position of the initial front. For details about using the level set method to solve (1) we refer to the original paper [1].

##### 3.2. Replacement of the Function

Equation (3) acts only locally, on the zero level set of the function , and the solution depends on the initial condition. In order to extend the evolution to all the level sets of and find a global minimizer of the energy, a common approach [14, 15] is to set , leading to where is the mean curvature of every level sets of . The term performs then a regularization through a mean curvature motion.

Another interesting solution has been proposed by Gibou and Fedkiw [16] who take (see also [17–19]). Observing that only the zero level set of is important and the object boundaries are represented by discontinuities in , they ignore the regularization term and consider directly the ordinary differential equation . Regularization and scaling are achieved by a preprocessing step of nonlinear diffusion [20].

Considering the features of dataset, we suggest instead, following [21], to avoid any denoising and take keeping the regularization term in (3): The first term in (5) represents then a total variation regularization [22]. Its use in the Chan Vese model has been already proposed in [23].

We tested the behavior of (5) and (4) on noisy phantoms and our real data. To solve the presented PDEs models we used explicit finite difference schemes as introduced in [13]. In the next section we show qualitative and quantitative results justifying our choice of representation.

#### 4. Results

As previously introduced in Section 2.2, our dataset is composed by 49 volumes and represents the cell nuclei during the development of a zebrafish embryo between the sphere and the shield stage. To a first approximation (see Figure 2) the nuclei can be comparable to spheres of different diameter, between 6-7 (internal) and 12–14 voxels (epithelial). Nevertheless, sometimes they are elongated and very jagged, especially before a mitosis. Furthermore, the nuclei located in depth are usually incomplete. As our aim is to segment all the nuclei at the same time, we have to segment simultaneously objects of different shapes and sizes. In the next section we compare from this perspective the behavior of both versions of Chan-Vese model previously introduced. We evaluate their performances according to different values of scale parameter on a synthetic image and our real data.

##### 4.1. Choice of Method and Tuning of

The parameter determines an upper bound to the mean curvature of segmented objects. Therefore if we have to detect many objects with different size, should be small. If we have to detect only larger objects and to filter out smaller objects (like points, due to the noise), then has to be larger. By considering the nuclei dimension, we perform a first test on phantoms by segmenting spheres of different radii, then on real data by segmenting a region of interest selected in a volume of time lapse series. We test both (4) and (5) using different values of . In all our computations we use . The time step is set to 0.1 if , otherwise to 0.01. Equations (4) and (5) are iterated until the steady state. The segmentation error is evaluated by calculating the mean Hausdorff distance (MHD) and the Hausdorff distance (HD) [24] between the segmented surfaces and a suitable gold standard. Given two finite point sets, and , the Hausdorff distance is defined as

where .

The MHD is defined similarly, using . The two formulations can be used to quantify different kinds of error: HD is related to the maximum segmentation error, whereas MHD to the total error. In Figure 3 are depicted our results on noisy phantoms, using, respectively, (Figures 3(c) and 3(d)) (4) and (5). The original data (Figures 3(a), 3(b)) are composed of spheres with radius 1, 3, 5, and 7 voxels. Figures 3(c) and 3(d) show the original data in a cutting plane and the segmentation (blue) obtained using . Considering the nuclei size in our dataset, our purpose is to segment only spheres with radius 3. We can first observe how increasing only bigger objects can be detected with both methods. When , (4) is able to identify all the four spheres, while (5) segments also smaller regions given by noise. For both methods segment correctly the desired regions. When the scale parameter is 0.5, only (5) still segments three regions. For , (4) identifies one sphere and (5) two. We verified that (4) is able to detect three regions only when , while (5) can exploit a more wide range, . Such behavior can be observed also by examining the mean and the maximum segmentation errors. The graphs in Figure 4 depict MHD and HD calculated between the surfaces of segmented spheres and corresponding surfaces of spheres created without noise. The results are plotted only for the range of interest of . In solid line is the use of (4). In dashed line is the use of (5). The color is related to the radius. The sphere of the biggest radius (7 voxels, depicted in red) is segmented correctly with both methods and for the whole range of scale parameter. The behavior of methods changes instead for smaller spheres. While using (5) errors keep about constant for all nuclei; errors with (4) are everywhere small only for the smallest value of . The replacement of with 1 in (3) is less sensitive to changes in size than its replacement with . Such behavior is confirmed on real data, also if in a more restrictive useful range of values for . We selected a region of interest in a volume of our dataset. The ROI contains both epithelial and internal nuclei, and some of them are cut. A gold standard has been created by manual segmentation to compare the methods. Original data, gold standard, and results attained using are depicted in Figure 5. For smaller values of both methods detect regions given by noise. We can observe that the methods described in (4) fails, because it is not able to segment all the nuclei in the subvolume. The smallest region (on the left in Figures 5(c) and 5(d)) is lost. Another small nucleus (bottom-right in the same figures) is not correctly segmented. The method described by (5) is instead able to segment all the regions in the ROI. Its mean and maximum errors are listed in Table 1. The Hausdorff and the mean Hausdorff Distances are in this case averaged on the number of nuclei in the subvolume. As the spacing in our data is not uniform, distances are given in m. For the total error is small (0.3 m) and the maximum is anyhow limited (1.5 m). The diagonal of every voxel is in fact about 1.2 m.

Because of robustness, we then choose to segment our time lapse series with the method described by (4). Considering results on both phantoms and real data, we used . Let us point out that this analysis represents also a validation of segmentation, with very satisfactory results.

##### 4.2. Segmentation and Cells Counting

We show in this section some results obtained by segmenting the whole time lapse with the method described by (5). The level-set function is initialized as the difference between the 3D image itself and its mean value. The mean value is calculated only where and the function thus constructed is then smoothed with few scale steps of the heat equation. This initialization provides an initial solution close to the final one and does not depend on a previous segmentation. Actually an alternative could be to use the result of segmentation at time as initial solution for the segmentation at time . But this choice does not consider that the number of nuclei changes between subsequent volumes. Indeed some nuclei divide and others are close to the bottom of the acquired volume and can go out of the imaged part of the embryo. Moreover, our solution allows the simultaneous segmentation, for example, on different processors, of all the volumes in the time lapse series.

We keep , while the scale parameters have been chosen by our previous analysis and set to 0.1. We use in every case a time step of 0.1 and the steady state is reached after about 1500 iterations. From the isosurface corresponding to the zero level set of the final solution are then extracted the connected components, whose number provides the counting of nuclei in the processed volume. Both for extracting the isosurface zero and its connected components we make use of the open-source VTK (Visualization Toolkit) library [25], which provides widely used filters for image visualization and analysis.

Examples of our segmentations on whole 3D images are given in Figures 6–8. In the first a cutting plane of last volume is compared with a cut of segmented surfaces. The white outline well reproduces the nuclei boundaries even if they are not clearly defined, and small regions are correctly detected. In Figure 7 is visualized a segmentation (red) together with three orthoslices of original data. Observing the nuclei cut by planes it is possible to see the white contour line of original data. Figure 8 shows instead the segmentation of first and last volume of our dataset. Let us observe that during the acquisition the number of cells strongly increases. As previously introduced, this number can be quantified by counting the connected components extracted from the segmented surfaces. We show in Figure 9 an example of connected components extraction on last volume of the time lapse series. The number of nuclei detected in our dataset during the embryo development is instead plotted as graph in Figure 10. At the beginning we detected 333 nuclei, whereas at the end 520. The most parts of cells divide during the course of images acquisition. Nevertheless we would like to point out that the number of detected cells is not strictly increasing but shows small oscillations around an exponential trend. This behavior occurs because the cells are moving and the imaging includes only the top part of the embryo. Cells close to the bottom of the imaged volume can then be located either on the inside or on the outside.

In order to estimate the ability of our method of correctly extracting the number of cells, we then compared the number of nuclei identified by a manual computation on the first volume of the time lapse series (340 nuclei) with the number automatically detected. By our evaluation the correct cells number is then slightly underestimated, but our error is less than 3%. For the most part, nuclei are correctly detected and segmented. The main source of error is given by nuclei very close, if not overlapped, in original data. In this case we segment only one region. This drawback could be overcome by combining signal of both nuclei and membranes, by refining the segmentation locally, or through the multiphase level-set approach [26].

#### 5. Conclusions

We applied the active contour model without edges to time lapse series of confocal images representing cells nuclei in a live zebrafish embryo. As the nuclei in our dataset are varying in shape and size, we considered two forms of the originally proposed model equation. The two formulations are based on a different approximation of the Dirac function. We then compared their performances in segmenting objects of different forms and dimensions. The maximum and total errors have been quantified as the Hausdorff distance and the mean Hausdorff distance between the data and a gold standard obtained through manual segmentation. This analysis has been made on both synthetic and real data. We proved that our suggestion of using is the formulation with the best performances. This form of the active contour model without edges has then be applied to a dataset which represents the development of a zebrafish embryo between the shield and the sphere stage. From the results of segmentation have been afterwards extracted the connected components, whose counting allowed to quantify the number of cells. The corresponding error has been estimated through a comparison between the number of cells detected by the algorithm and the number of cells detected by a manual computation in a selected volume.

#### Acknowledgments

This work was supported by the European Projects Embryomics (NEST 012916) and Bioemergence (NEST 028892). The authors thank all the members of the projects for their very fruitful interdisciplinary interaction. Special thanks to Dr. Nadine Peyriéras from CNRS Paris for the testing images.

#### References

- T. Chan and L. Vese, “Active contours without edges,”
*IEEE Transactions on Image Processing*, vol. 10, no. 2, pp. 266–277, 2001. View at Google Scholar - K. Dooley and L. Zon, “Zebrafish: a model system for the study of human disease,”
*Current Opinion in Genetics & Development*, vol. 10, no. 3, pp. 252–256, 2000. View at Google Scholar - A. Dufour, V. Shinin, S. Tajbakhsh, N. Guilln-Aghion, J. C. Olivo-Marin, and C. Zimmer, “Segmenting and tracking fluorescent cells in dynamic 3-D microscopy with coupled active surfaces,”
*IEEE Transactions on Image Processing*, vol. 14, no. 9, pp. 1396–1410, 2005. View at Google Scholar - P. J. Keller, A. D. Schmidt, J. Wittbrodt, and E. H. K. Stelzer, “Reconstruction of zebrafish early embryonic development by scanned light sheet microscopy science,”
*Science*, vol. 322, no. 5904, pp. 1065–1069, 2008. View at Google Scholar - R. L. Mayden, K. L. Tang, K. W. Conway et al., “Phylogenetic relationships of Danio within the order Cypriniformes: a framework for comparative and evolutionary studies of a model species,”
*Journal of Experimental Zoology*, vol. 308B, pp. 642–654, 2007. View at Google Scholar - C. Melani, M. Campana, B. Lombardot et al., “Tracking cells in a live zebrafish embryo,” in
*Proceedings of the 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBS '07)*, Lyon, France, August 2007. - C. Zanella, B. Rizzi, M. Campana et al., “Segmentation of cells from 3-D confocal images of live zebrafish embryo,” in
*Proceedings of the 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBS '07)*, Lyon, France, 2007. - S. Megason and S. Fraser, “Digitizing life at the level of the cell: high performance laser-scanning microscopy and image analysis for in toto imaging of development,”
*Mechanisms of Development*, vol. 120, pp. 1407–1420, 2003. View at Google Scholar - C. B. Kimmel, W. W. Ballard, S. R. Kimmel, B. Ullmann, and Th. F. Schilling, “Stages of embryonic development of the zebrafish,”
*Developmental Dynamics*, vol. 203, pp. 253–310, 1995. View at Google Scholar - D. Terzopoulos, J. Platt, A. Barr, and K. Fleischer, “Elastically deformable models,” in
*Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '87)*, pp. 205–214, ACM Press, 1987. View at Publisher · View at Google Scholar - R. Malladi, J. A. Sethian, and B. C. Vemuri, “Shape modeling with front propagation: a level set approach,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 17, pp. 158–175, 1995. View at Google Scholar - V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic active contours,”
*International Journal of Computer Vision*, vol. 22, no. 1, pp. 61–79, 1997. View at Google Scholar - S. Osher and J. A. Sethian, “Front propagating with curvature dependent speed: algorithms based on Hamilton Jacobi formulation,”
*Journal of Computational Physics*, vol. 79, p. 1249, 1988. View at Google Scholar - A. Sarti, C. Corsi, E. Mazzini, and C. Lamberti, “Maximum likelihood segmenta-tion of ultrasound images with rayleigh distribution,”
*IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control*, vol. 52, no. 6, pp. 947–960, 2005. View at Publisher · View at Google Scholar - H. Zhao, T. F. Chan, B. Merriman, and S. Osher, “A variational level set approach to multiphase motion,”
*Journal of Computational Physics*, vol. 127, no. 1, pp. 179–195, 1996. View at Google Scholar - F. Gibou and R. Fedkiw, “Fast hybrid k-means level set algorithm for segmentation,” in
*Proceedings of the 4th Annual Hawaii International Conference on Statistics and Mathematics*, Stanford Technical Report, November 2002. - L. He and S. Osher,
*Solving the Chan-Vese Model by a Multiphase Level Set Algorithm Based on the Topological Derivative*, vol. 4485, Springer, Heidelberg, Germany, 2007. - Y. Pan, J. D. Birdwell, and S. M. Djouadi, “Efficient implementation of the chan-vese models without solving PDEs,” in
*Proceedings of the 8th IEEE Workshop on Multimedia Signal Processing*, pp. 350–354, 2006. - B. Song and T. Chan, “A fast algorithm for level set based optimization,” Tech. Rep. 02-68, University of California, Los Angeles, December 2002. View at Google Scholar
- P. Perona and J. Malik, “Scale-space and edge detection using anisotropic diffusion,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 12, no. 1, pp. 629–639, 1990. View at Google Scholar - E. Hodneland,
*Segmentation of digital images*, M.S. thesis, 2003. - L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,”
*Physica D*, vol. 60, no. 1–4, pp. 259–268, 1992. View at Google Scholar - G. Chung and L. Vese, “Image segmentation using a multilayer level-set approach,”
*Computing and Visualization in Science*, pp. 1432–9360, 2008. View at Google Scholar - D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge, “Comparing images using the Hausdorff distance,”
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, vol. 15, no. 9, pp. 850–863, 1993. View at Google Scholar - W. Schroeder, K. Martin, and B. Lorensen,
*The Visualization Toolkit: an Object-Oriented Approach to 3D Graphics*, Prentice Hall, Upper Saddle River, NJ, USA, 2nd edition, 1997. - L. A. Vese and T. F. Chan, “A multiphase level set framework for image segmentation using the Mumford and Shah model,”
*International Journal of Computer Vision*, vol. 50, no. 3, pp. 271–293, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH