- Research article
- Open Access
A generic classification-based method for segmentation of nuclei in 3D images of early embryos
BMC Bioinformaticsvolume 15, Article number: 9 (2014)
Studying how individual cells spatially and temporally organize within the embryo is a fundamental issue in modern developmental biology to better understand the first stages of embryogenesis. In order to perform high-throughput analyses in three-dimensional microscopic images, it is essential to be able to automatically segment, classify and track cell nuclei. Many 3D/4D segmentation and tracking algorithms have been reported in the literature. Most of them are specific to particular models or acquisition systems and often require the fine tuning of parameters.
We present a new automatic algorithm to segment and simultaneously classify cell nuclei in 3D/4D images. Segmentation relies on training samples that are interactively provided by the user and on an iterative thresholding process. This algorithm can correctly segment nuclei even when they are touching, and remains effective under temporal and spatial intensity variations. The segmentation is coupled to a classification of nuclei according to cell cycle phases, allowing biologists to quantify the effect of genetic perturbations and drug treatments. Robust 3D geometrical shape descriptors are used as training features for classification. Segmentation and classification results of three complete datasets are presented. In our working dataset of the Caenorhabditis elegans embryo, only 21 nuclei out of 3,585 were not detected, the overall F-score for segmentation reached 0.99, and more than 95% of the nuclei were classified in the correct cell cycle phase. No merging of nuclei was found.
We developed a novel generic algorithm for segmentation and classification in 3D images. The method, referred to as Adaptive Generic Iterative Thresholding Algorithm (AGITA), is freely available as an ImageJ plug-in.
Studying how individual cells spatially and temporally organize within the embryo is a fundamental issue in modern developmental biology to better understand the first stages of embryogenesis. Cell dynamics can be analyzed from three-dimensional (3D) images of labeled nuclei. To perform systematic studies and high-throughput analyses, automated methods that quantify nuclei over time and reconstruct cell lineages are required. For tracking purposes, detecting the centers of nuclei can be sufficient. However, for accurate geometrical and morphological analyses, a complete segmentation of nuclei is required. In addition, in cell-cycle studies, accurate classification of nuclei according to their cell-cycle stage is necessary.
For these reasons, many segmentation and/or tracking methods have been developed. Bao et al. proposed local maxima detection followed by 3D spherical approximation for nuclei segmentation in Caenorhabditis elegans. Melani et al. proposed the identification of nuclei using a spherical Hough transformation, and Soubies et al. extended the procedure to the detection of ellipsoids. Segmentation of nuclei by 2D detections using difference of Gaussians and 3D reconstruction based on Bayesian features was used by Santella . Another algorithm based on a Bayesian estimation framework for tracking was proposed by Carranza et al., where the nuclei were detected using an h-dome transform . Multiple level sets and background/foreground detection was proposed by Chinta et al.. Most of these algorithms require fine-tuning of many parameters and are often only successful for dedicated applications and using specific acquisition systems or labeling protocols.
For the purpose of automation, a key issue is the objective determination of a correct intensity threshold for image segmentation. Due to imperfect imaging conditions and variations of fluorescence intensity with respect to time and depth, a unique global threshold generally fails to correctly detect nuclei. Therefore, the use of adaptive local thresholding is necessary to detect nuclei regardless of fluctuations in their intensity. The idea of testing multiple thresholds for each object and then deciding which threshold is the best is not new (see for example, ). Matas et al. presented MSER (Maximally Stable Extremal Regions), a method where the best threshold is the one that yields to minimal variations of the object surface. Keller et al. developed an algorithm based on this same idea to detect nuclei in developing zebrafish embryos imaged with digital scanned light sheet microscopy . However, identifying and specifying a priori a suitable threshold selection criterion (i.e., yielding robust segmentation results) is a real challenge and may require the fine-tuning of several parameters.
Machine learning can be used to eliminate the need for an explicit threshold selection criterion. In supervised machine learning, samples of known categories are provided as input and the algorithm automatically finds a decision rule that most effectively separates the different classes. Arteta  uses a support vector machine to detect extremal non-overlapping regions in 2D images. Lin  proposed to use Bayesian models on 2D intensity and geometrical features. In this approach, a first segmentation is suggested and the user validates the correctly segmented objects that will be used for the training. Objects are then segmented using a classical watershed approach and the training is used to fuse separated regions.
In the present paper, we introduce a learning-based method to segment nuclei in 3D/4D images of early embryos. This work was developed to compensate for the lack of robust alternatives to segment our working dataset of the C. elegans embryo imaged with a spinning disk confocal microscope. Our method distinguishes itself from previous works in three ways. Firstly, we propose a segmentation technique that can be applied to different image acquisition conditions and various embryo models. Secondly, the number of parameters has been minimized to include just a few biological parameters. Lastly, our algorithm segments and classifies nuclei simultaneously, while other approaches first segment and then classify nuclei. Specifically, we chose the threshold leading to the object that is most similar to one in a set of training samples.
In this paper, we present the results of applying our novel algorithm to three different datasets containing embryo nuclei from C. elegans, Drosophila and 3D simulated data . The algorithm has been implemented as an open-source plug-in for ImageJ  and is publicly available for download along with a tutorial and sample data .
The procedure is composed of three steps: filtering to reduce noise, supervised learning of user-selected training samples and, finally, classification-based segmentation of nuclei (Figure 1). The only biological parameters that must be supplied by the user are the approximate volumes of the nuclei for each cell cycle phase at the start and end time points of the dataset.
Sample preparation of working dataset
The C. elegans early embryo dataset was acquired with a spinning-disk confocal microscope. The dataset is composed of a developing embryo from the 4-cell stage to the 90-cell stage with 160 time points. The signal consists in Histone-GFP expressed in the ovary and transmitted to the future embryo at the time of oocyte formation. At each cell division during embryo development, this maternal load is incorporated into the chromatin of an increasing number of cells, thus leading to a dilution of the fluorescence signal over time.
Overview of the method
The main idea of the algorithm is to use machine learning to improve the segmentation results of cell nuclei. The learning step is an interactive process. The user first selects representative nucleus samples of each cell cycle by clicking on their locations inside the 3D or 4D dataset. The objects at the clicked positions are then segmented through an iterative thresholding procedure using the user-supplied volume estimates as a reference. After that, the user has to validate the proposed segmented nuclei, and 3D descriptors are computed from this set of validated nuclei. A predefined classifier is then trained to assign cell cycle phases to nuclei based on that set and those descriptors. The main joint segmentation/classification procedure is subsequently applied to all time points.
Choosing and setting up the classifier
Before setting up the segmentation procedure based on classification, it was necessary to choose and set up a classifier. A first training set of manually-validated nuclei were extracted from the image using the procedure presented in the Supervised learning section below. Each object was represented by a feature vector of 3D descriptors calculated as described in the following section, and was assigned its corresponding cell cycle phase or class by the user. To find the most suitable learning algorithm, we made experiments across our datasets after dividing our samples into a training and a test set (66% and 33% of the data, respectively). For this purpose, we used the experimenter of the Waikato Environment for Knowledge Analysis (WEKA) suite  and the BIOCAT program . We empirically found that a random forest classifier provided the best separation of our samples between the different cell-cycle phases. A random forest is an ensemble learning method based on the decisions of an arbitrary number of random decision trees . 200 trees were used in our case. The decision trees are simple binary trees in which each node divides the set of samples based on the most differentiating feature at the given tree level. This way, the deeper we go down the tree, the better the samples are differentiated.
Filtering is a common pre-processing step to improve the results of subsequent segmentation by increasing the signal-to-noise ratio in the image. For this purpose, a classical 3D median-filter is used with a variable radius, which is proportional to the radius of the equivalent sphere for a given volume . This classical filter proved useful for noise reduction while preserving edges. Intermediate time point volumes are linearly interpolated from the minimum and maximum volumes supplied by the user at the learning step. Nuclei are large at early stages, so a large radius can be used to reduce noise and homogenize intensity signals inside the nuclei. Adapting the filter size ensures that late stage nuclei, which are smaller, are not removed.
In addition, in order to avoid unnecessarily long computing times when filtering with too large a radius, a limit of R=12 is proposed by the plug-in (12 pixels in the XY-plane; the radius used in Z takes the calibration of the image into account) and performs well in practice. The filtering step is optional and data can be pre-processed with another filtering sequence before segmentation, if appropriate.
In this preliminary step, classes are created in an interactive manner, and features of nuclei for each class are computed. For this purpose the user manually selects some samples of each class at different time points by clicking on the approximate position of the nucleus sample centers in the 3D or 4D image. A fixed-size box centered on the selected voxel is then cropped, and the extracted sub-volume goes through an iterative thresholding procedure similar to MSER. Briefly, for each threshold, the volume of the segmented object (closest to center of box) is computed and compared to the range of volumes given by the user. Once the object falls inside the interval of volumes, it is extracted. The same applies to all selected positions; each sample is therefore thresholded with a different threshold. The user then has to validate correctly segmented nuclei from the set of segmented nucleus samples.
3D shape descriptors
Finding a good set of features for machine-learning classifiers is an important task to obtain accurate classification. We tried to optimize the choice of descriptors so that they can be robustly used in different contexts of acquisition and species. Among the 3D descriptors available, we first eliminated intensity-based descriptors since intensity may vary between nuclei and between acquisitions. Secondly, we discarded descriptors that are size-dependent such as volumes or surfaces, since nuclei in the same cell-cycle phase (e.g., interphase) may have variable sizes, ranging from very large at the first time points to very small at the subsequent time points. We therefore focused on ten shape descriptors that are described below.
Compactness and sphericity
These factors describe how far the object is from a perfect sphere. These two descriptors are related and can be estimated from a normalized surface-to-volume ratio. Their values vary between 0 and 1 for a perfect sphere. These parameters are popular for evaluating morphological changes in biological entities .
where V is the volume of the object (using calibrated voxel sizes in X, Y, and Z).S is the surface of the object (using calibrated voxel sizes in X, Y, and Z).
In order to reduce the sensitivity to surface irregularities that could arbitrarily increase the surface area and decrease the accuracy of the above descriptors, a 3D ellipsoid can be fitted to the object. The fitting of the ellipsoid is performed using the classical moment-based procedure. Elongation and flatness are the ratios between the different radii of the fitted 3D ellipsoid.
where R1, R2 and R3 are three radii of the fitted ellipsoid, in decreasing order.
The ratio between the best fitted 3D ellipsoid volume and the actual volume of the object can also give a good idea of how far the object is from an ellipsoid.
3D geometric moments
These six shape descriptors are invariant with respect to change of scale, translation and rotation. They are based on central moments up to the fourth order, and describe the variations of the object from the ellipsoid. They are described in detail in .
After the training, features are extracted from the nuclei that are validated by the user, the main classification-based segmentation is applied. As mentioned above, the procedure is based on an iterative thresholding method. For a given time point, the 3D filtered image is first segmented using a low threshold and all detected objects are extracted. For each detected object, we first check if the volume falls into the interval of volumes for all classes. If the volume of the object is valid, each descriptor value is compared against the minimum and maximum descriptor values for all classes. Finally, if and only if the object has a valid volume and descriptor values, it is classified using the trained classifier and the corresponding object information (current threshold, classification results, volume, coordinates, etc.) is saved (Figure 2). Since the procedure starts with a low threshold, the whole embryo would be considered as one object, but as a result of this value checking, it will not fall into the interval of accepted volumes and will therefore not be classified, and the next threshold will be used. As the threshold increases, nuclei start to emerge from the embryo. They can be merged as one object for a low threshold, but they will be separated with higher thresholds (Figure 3). With increasing threshold values, objects change in shape and may therefore be classified into different classes. Once the thresholding terminates, we obtain a hierarchy of objects that shows the separation of nuclei with increasing thresholds (Figure 3).
In order to find the best threshold in each branch of this hierarchy (i.e., for each object), we search for the threshold values that stabilize the shape of the object and, therefore, the associated class. More precisely, for each branch, starting from the right (i.e., high thresholds), we look for the largest interval with consecutive classification in the same class. The threshold that provides the highest probability for this class is kept. The object in the branch is then reconstructed using the associated threshold.
Using a prioribiological knowledge
In our procedure, branches with higher thresholds are favored. This provides good separation of nuclei, even when they are close (as in anaphase).
In some cases, like in our C.elegans dataset, some prophase nuclei display very condensed chromosomes that look similar to metaphase nuclei. Due to our strategy, whole nuclei will be segmented using low thresholds and classified as prophase. However, for higher thresholds, condensed chromosomes inside may be segmented and classified as either prophase or metaphase. Therefore, we implemented a generic inclusion model that does not allow particular classes (prophase, in this case) to include other classes (prophase and metaphase).
All figures were done with FigureJ .
The algorithm was applied to three different datasets: the first two were acquired from two different biological models and the third one was a synthetic dataset that simulated dividing cells (Table 1). Our original motivation was to automate the segmentation of nuclei in the C. elegans dataset where none of the available methods had provided satisfactory results. The Drosophila dataset was obtained from an existing reference and hence represents an additional validation dataset . In their study, the authors used a Histone-GFP labeling method with confocal microscopy. For our C. elegans dataset, a slightly different labeling procedure was used, with Histone-GFP expressed in the ovary and transmitted to the future embryo. The fluorescence signal was thus gradually diluted with mitosis, leading to an overall decay in fluorescence intensity and, consequently, of image quality over time. Another difference between the two datasets was that Drosophila embryos were imaged with a conventional confocal microscope , whereas C. elegans embryos were imaged with a spinning disk microscope. The third dataset was a synthetic dataset generated using CytoPack , a program that models dividing cells and creates synthetic datasets that simulate 4D video-microscopy acquisition. Although the aspect of nuclei was realistic, it was not completely natural, and could present high intensity variation, thus providing a difficult test case for our algorithm.
Before using the classifier in the main classification-based segmentationtion algorithm, we had to validate it. For this purpose a first test was performed using objects segmented by the procedure presented in the Supervised learning section. This procedure is based on a MSER algorithm and uses the volumes given by the user as inputs. For each dataset, between 100 and 200 sample nuclei, with approximately equal number for each class, were chosen from different time points according to shape variability, and then assigned a class by a human expert. For all of the datasets, the confusion matrix for the classifier showed satisfactory results, with a classification rate of approximately 90% for the two real embryo datasets and 80% for the synthetic dataset (Table 2).
The efficiency and accuracy of the proposed algorithm was tested on the three complete datasets (see Table 3). The segmentation results were visually compared with original data for all time points and taking the 3D information into account. We used a classification based on five classes (interphase, prophase, metaphase, anaphase and telophase) for all three datasets. Between 10 and 30 sample nuclei per class were chosen for the initialization (supervised training of the classifier). The values used as volume limits for the C. elegans dataset were (in μ m3): 9.8–24.3 (interphase), 14–36.6 (prophase), 5.9–19 (metaphase), 3.6–7.3 (anaphase) and 6.3–9.9 (telophase). For the Drosophila dataset, the minimum and maximum volumes were set to (in μ m3): 45–100, 120–150, 36–40, 25-39 and 20–28.
For the C. elegans dataset, there was a decay of intensity with time due to the particular labeling technique and acquisition system, and the image quality was therefore not as high as in the Drosophila dataset. Furthermore, due to the embryo depth and imaging conditions, the slices farthest away from the objective lens were quite noisy. The selected thresholds corresponding to segmented nuclei varied between time points as well as within each time point image. The threshold values varied between 883 and 1,757 (with an average of 1,180) for time point 40, between 754 and 1,200 (with an average of 900) for time point 86, and between 652 and 1,064 (with an average of 781) for time point 122. However almost all of the nuclei could be correctly detected (correct position) for all time points (Additional file 1). Nevertheless, after time point 128, the image quality was too low to accurately delineate the actual shape of the nuclei. Figure 4 shows the results obtained for some of the time points. At an advanced time point (122), all nuclei were correctly segmented despite the low quality of the image (Figure 5). For the time points to 128, only 21 out of 3,585 (0.3%) were not detected, with zero false negatives.
In the Drosophila dataset, which has a higher signal quality, nuclei were generally present in a 2D layer. All nuclei were correctly segmented, only 15 out of 4,820 (0.3%) were not detected, and an additional 77 spurious noisy objects were incorrectly identified as nuclei (1.6%) (Figure 6) (Additional file 2). The selected threshold values did not vary much, which was coherent with the homogeneous intensity throughout the entire 4D dataset. The difference between the lowest and highest threshold value used was 28 for time point 5, 34 for time point 9, and 36 for time point 25.
For the simulated dataset, all synthetic nuclei were correctly segmented despite high intensity variance within nuclei (Additional file 3).
The results obtained with our method on C. elegans data (our target dataset) were compared with the Hierarchical K-Means method (HK-Means)  of ICY . This method implements a slightly modified version of the MSER technique and is therefore probably one the best available methods to compare to. With the same volume parameters as for our algorithm, HK-Means was globally less accurate. Several detected objects were actually noise, some nuclei were not detected, and several others were merged. For example, at time point 86, there was one noisy object, three nuclei were missing, and there was one fusion of two nuclei; for time point 122, there were six noisy objects, two nuclei were missing, and two were merged (Figure 7). Since HK-Means method favors low threshold values, the objects tended to be larger, and the delineation of nuclei was globally not as accurate as with our algorithm.
The time to segment and classify 128 time points for the C. elegans dataset (160 frames, 512×512×31 voxels) on a Xeon bi-processor with 12 cores/24 threads (Xeon X5660@2.80 Ghz), running Ubuntu Linux 12.04 with 24 Gb of RAM and using Java 1.7, was between 4 and 6 hours, corresponding to approximately 3 minutes per time point.
Although the purpose of the classification procedure in our method is related to the selection of the best threshold value for segmentation, it can also be used collaterally as a classification algorithm per se to predict cell-cycle phases. The information about the cell-cycle stage given by the algorithm can be used for cell-cycle analysis and to help further tracking. We visually analyzed the classification results on a frame-by-frame basis, using temporal information to determine the actual cell-cycle stage.
For the C. elegans dataset, 165 out of 3,583 nuclei (for time points 1–128) were not correctly classified (4.6%), and classification errors occurred uniformly in all time points. This error rate was less than the training error (∼10%, see Table 1) because of the high number of interphase nuclei in the entire dataset, and mainly resulted from shape similarity between classes, especially at the anaphase and telophase stages.
For the Drosophila dataset, 225 out of 4,820 nuclei were not correctly classified (4.7%). 186 of these classification errors occurred in the three last time points. This error rate was similar to the one previously reported .
For the synthetic dataset, where all nuclei were correctly segmented, the classification results were similar, with 96% of correctly classified nuclei. Due to the non-natural aspect of the simulated nuclei, the distinction between some stages was not obvious: the prophase and telophase stages were difficult to discriminate from other stages, whereas the interphase, metaphase and anaphase stages were correctly classified (Additional file 3).
Discussion and conclusion
We have presented a machine-learning based approach for segmenting nuclei in 3D microscopy images. The originality of the approach is to perform segmentation and classification simultaneously within an iterative threshold selection procedure, ensuring that the best threshold for each object will be found. By comparing our approach with HK-Means, we evaluated the benefit of using a machine-learning approach to improve the segmentation accuracy by detecting objects similar in shape to training samples. The segmentation provided by our approach is more accurate because it is the one that leads to the best classification score. From the point of view of classification, we introduced with the paradigm of “jointly segment and classify” rather than “segment then classify”, a new idea that could be used as a basis for further algorithms.
The major advantage of our method is its ability to robustly adapt to different imaging conditions and different species by reporting the introduction of the required knowledge on the initial learning stage from user-specified samples. The only assumption that is made is that an object can be segmented by one threshold value and has a class-specific shape.
Our algorithm was successfully tested on two embryo models, the C. elegans dataset (our work dataset), and the Drosophila dataset (our validation dataset). The overall segmentation results were comparable or better than those of existing algorithms, without the necessity of fine-tuning parameters. The only required parameters are the volumes of nuclei that can be easily learned from a set of trials and errors at the supervised learning step, where all descriptors values are displayed to the user. The user can take some time in training the system but it only needs to be done once per embryo model and imaging conditions. The same set of training descriptors can be re-used in different experiments. The implemented 3D descriptors summarize the shape of the object and do not take quantitative variable aspects such as object volume, surface or intensity into account since these values can be extremely variable over time. In fact, in the first time points of the series, nuclei are usually very large and very bright, contrasting with the numerous darker small nuclei at end time points.
For the Drosophila validation dataset, only a few nuclei were not detected (0.3%), and generally corresponded to very crowded telophase nuclei that displayed very unusual shapes. However, it seems that we detected more nuclei than the original paper  (4,820 compared to 4,166; it is possible that some border objects were not counted). We were also able to achieve an overall acceptable classification with an error rate of less than 5%, where classification errors were mainly present at end time points for very crowded interphase nuclei.
For our working dataset, C. elegans, the results for segmentation and classification were quite satisfactory, even in a context of low signal-to-noise ratio. We can then validate the acquisition and labeling procedure for further studies to improve automated lineage reconstruction.
For the synthetic dataset, we observed significantly better classification results in the entire data than in the training samples because of the over-abundant interphase nuclei (1,586 out of 1,974), which were easier to classify than the other ones.
Classification is a very important step in our thresholding procedure. However, in order not to add a threshold parameter to the classification results, we preferred to add an interval check of volumes and of all descriptor values prior to classification, acting as a Boolean pre-classifier. Nevertheless the classification error rate was quite low, although it is not an easy task, even for an experienced biologist, to distinguish between the five cell-cycle stages we defined. With only three or four classes (merging anaphase and telophase, for example) we would expect higher classification results. Furthermore, since interactive selection of samples for the supervised learning phase is an essential part of the method, we implemented a semi-automatic procedure to make this task easier. The user may have a tendency to choose rather non-ambiguous nuclei in the different cell-cycle stages. However, the nuclei in the different stages present continuous variations that lead to small changes in shape, thus inducing misclassification. For tracking analysis, this misclassification could be alleviated by taking the class of the object at the previous time point into account. Some noisy objects were also detected, but they can be easily removed by post-processing procedures, as they appeared for some threshold values only, presented peculiar shapes or intensities, and had low classification scores. They could be easily filtered out using available tools such as the 3DRoiManager [24, 25]. Since we did not want to add extra parameters, we chose to keep these noisy objects and just warn the user about them with a screen message.
The algorithm may be quite time-consuming since many threshold values are tested, especially in 16-bits. However, the user can speed it up by increasing the step between two thresholds or by converting the data to 8-bits. Furthermore, using multi-threaded algorithms speeded up the process, leading to less than 3 minutes to process one time point.
Our results suggest that the segmentation method proposed can also be applied to other images and provides a promising start for tracking analysis using classification information.
Bao Z, Murray J, Boyle T, Ooi S, Sandel M, Waterston R: Automated cell lineage tracing in Caenorhabditis elegans. Proc Natl Acad Sci U S A. 2006, 103 (8): 2707-2712. 10.1073/pnas.0511111103.
Melani C, Campana M, Lombardot B, Rizzi B, Veronesi F, Zanella C, Bourgine P, Mikula K, Peyrieras N, Sarti A: Cells tracking in a live zebrafish embryo. Conf Proc IEEE Eng Med Biol Soc. 2007, 1: 1631-1634.
Soubies E, Weiss P, Descombes X: A 3D segmentation algorithm for ellipsoidal shapes: Application to nuclei extraction. ICPRAM 2013 - Proceedings of the 2nd International Conference on Pattern Recognition Applications and Methods. 2013, Barcelona,: Espagne, 97-105. http://hal.archives-ouvertes.fr/hal-00733187,
Santella A, Du Z, Nowotschin S, Hadjantonakis A, Bao Z: A hybrid blob-slice model for accurate and efficient detection of fluorescence labeled nuclei in 3D. BMC Bioinformatics. 2010, 11: 580-10.1186/1471-2105-11-580.
Carranza-Herrezuelo N, Smal I, Dzyubachyk O, Niessen WJ, Meijering EHW: Automated lineage tree reconstruction from Caenorhabditis elegans image data using particle filtering based cell tracking. 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro. 2011, 1921-1924.
Chinta R, Wasser M: Three dimensional segmentation of nuclei and mitotic chromosomes for the study of cell divisions in live Drosophila embryos. Cytometry Part A. 2012, 81A: 52-64. 10.1002/cyto.a.21164.
Matas J, Chum O, Urban M, Pajdla T: Robust wide-baseline stereo from maximally stable extremal regions. Image and Vis Comput. 2004, 22 (10): 761-767. 10.1016/j.imavis.2004.02.006.
Schmidt AD, Wittbrodt J, Stelzer EHK, Keller P J: Reconstruction of Zebrafish early embryonic development by scanned light sheet microscopy. Science. 2008, 322 (5904): 1065-1069. 10.1126/science.1162493.
Arteta C, Lempitsky V, Noble J, Zisserman A: Learning to Detect Cells Using Non-overlapping Extremal Regions. Medical Image Computing and Computer-Assisted Intervention âǍŞ MICCAI 2012, Volume 7510 of Lecture Notes in Computer Science. Edited by: Ayache N, Delingette H, Golland P, Mori K. 2012, Berlin Heidelberg: Springer, 348-356.
Lin G, Chawla MK, Olson K, Barnes CA, Guzowski JF, Bjornsson C, Shain W, Roysam B: A multi-model approach to simultaneous segmentation and classification of heterogeneous populations of cell nuclei in 3D confocal microscope images. Cytometry Part A. 2007, 71A (9): 724-736. 10.1002/cyto.a.20430.
Svoboda D, Ulman V: Generation of synthetic image datasets for time-lapse fluorescence microscopy. Image Analysis and Recognition, no. 7325 in Lecture Notes in Computer Science. Edited by: Campilho A, Kamel M. 2012, Berlin Heidelberg: Springer, 473-482. http://link.springer.com/chapter/10.1007/978-3-642-31298-456,
Schneider CA, Rasband WS, Eliceiri KW: NIH Image to ImageJ: 25 years of image analysis. Nature Methods. 2012, 9 (7): 671-675. 10.1038/nmeth.2089.
Generic Segmentation 3D in biological development. 2013, http://imagejdocu.tudor.lu/doku.php?id=plugin:3d:rules-based_segmentation_and_tracking_4d_of_c._elegans_early_embryogenesis:start,
Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten I: The WEKA data mining software: an update. ACM SIGKDD Explorations Newslett. 2009, 11: 10-18. 10.1145/1656274.1656278.
Zhou J, Lamichhane S, Sterne G, Ye B, Peng H: BIOCAT: a pattern recognition platform for customizable biological image classification and annotation. BMC Bioinformatics. 2013, 14: 291-10.1186/1471-2105-14-291.
Breiman L: Random forests. Mach Learn. 2001, 45: 5-32. 10.1023/A:1010933404324.
Braumann UD, Kuska JP, Einenkel J Horn, Lffler M, Hckel M: Three-dimensional reconstruction and quantification of cervical carcinoma invasion fronts from histological serial sections. IEEE Trans Med Imaging. 2005, 24 (10): 1286-1307.
Xu D, Li H: Geometric moment invariants. Pattern Recogn. 2008, 41: 240-249. 10.1016/j.patcog.2007.05.001.
Mutterer J, Zinck E: Quick-and-clean article figures with FigureJ. J Microscopy. 2013, 252: 89-91. 10.1111/jmi.12069.
Centre for Biomedical Image Analysis | CytoPacq: a simulation toolbox | Image, Digital, Images. http://cbia.fi.muni.cz/projects/simulator.html,
Arai K, Barakbah AR: Hierarchical K-means: an algorithm for centroids initialization for K-means. Rep Faculty Sci Eng. 2007, 36: 25-31.
Open Community Platform for Bioimage Informatics. 2012, http://icy.bioimageanalysis.org/,
Du T, Puah W, Wasser M: Cell cycle phase classification in 3D in vivo microscopy of Drosophila embryogenesis. BMC Bioinformatics. 2011, 12 (Suppl 13): S18-10.1186/1471-2105-12-S13-S18.
3D ImageJ Suite. 2012, http://imagejdocu.tudor.lu/doku.php?id=plugin:stacks:3d_ij_suite:start,
Ollion J, Cochennec J, Loll F, Escud C, Boudier T: TANGO: a generic tool for high-throughput 3D image analysis for studying nuclear organization. Bioinformatics (Oxford, England). 2013, 29 (14): 1840-1841. 10.1093/bioinformatics/btt276.
The authors thank the different people for providing 3D/4D datasets so we could test and improve our algorithm. JGM thanks Campus France and the Regional Government of Kurdistan (KRG) for providing him a scholarship for his thesis. IAC was funded by the French National Research Agency (ANR) Infrastructure d’Avenir TEFOR (ANR-11-INBS-0014). VG wishes to thank: the Centre National de la Recherche Scientifique (ATIP Grant), the University of Pierre and Marie Curie, the French National Research Agency (ANR 07-BLAN-0063-21 and ANR 12-BSV2-0018-01), the Association pour la Recherche contre le Cancer, and the Bettencourt-Schueller Foundation (Coup d’ élan pour la recherche 2012).
The authors declare that they have no competing interests.
JGM implemented the segmentation algorithm; IAC implemented the classification; PA participated in the design of the study; VG provided the C. elegans data, participated in the design of the study and validated the results; TB implemented the 3D descriptors and designed the study; JGM, IAC and TB analyzed the results; JGM, IAC, PA and TB wrote the paper. All authors read and approved the final manuscript.
Electronic supplementary material
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.