Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 19, 2026.

Accurate and versatile 3D segmentation of plant tissues at cellular resolution

Adrian Wolny, Lorenzo Cerrone, Athul Vijayan and 18 more

eLife · 2020 · CC BY

doi:10.7554/elife.57613

Abstract

Quantitative analysis of plant and animal morphogenesis requires accurate segmentation of individual cells in volumetric images of growing organs. In the last years, deep learning has provided robust automated algorithms that approach human performance, with applications to bio-image analysis now starting to emerge. Here, we present PlantSeg, a pipeline for volumetric segmentation of plant tissues into cells. PlantSeg employs a convolutional neural network to predict cell boundaries and graph partitioning to segment cells based on the neural network predictions. PlantSeg was trained on fixed and live plant organs imaged with confocal and light sheet microscopes. PlantSeg delivers accurate results and generalizes well across different tissues, scales, acquisition settings even on non plant samples. We present results of PlantSeg applications in diverse developmental contexts. PlantSeg is free and open-source, with both a command line and a user-friendly graphical interface.

Full text

From PubMed Central, U.S. National Library of Medicine, as current on Oct 20, 2026. Paragraph numbers are ours, so an answer can point at one.

Introduction

Large-scale quantitative study of morphogenesis in a multicellular organism entails an accurate estimation of the shape of all cells across multiple specimen. State-of-the-art light microscopes allow for such analysis by capturing the anatomy and development of plants and animals in terabytes of high-resolution volumetric images. With such microscopes now in routine use, segmentation of the resulting images has become a major bottleneck in the downstream analysis of large-scale imaging experiments. A few segmentation pipelines have been proposed, but these either do not leverage recent developments in the field of computer vision or are difficult to use for non-experts.

With a few notable exceptions, such as the Brainbow experiments, imaging cell shape during morphogenesis relies on staining of the plasma membrane with a fluorescent marker. Segmentation of cells is then performed based on their boundary prediction. In the early days of computer vision, boundaries were usually found by edge detection algorithms. More recently, a combination of edge detectors and other image filters was commonly used as input for a machine learning algorithm, trained to detect boundaries. Currently, the most powerful boundary detectors are based on Convolutional Neural Networks (CNNs). In particular, the U-Net architecture has demonstrated excellent performance on 2D biomedical images and has later been further extended to process volumetric data.

Once the boundaries are found, other pixels need to be grouped into objects delineated by the detected boundaries. For noisy, real-world microscopy data, this post-processing step still represents a challenge and has attracted a fair amount of attention from the computer vision community. If centroids (‘seeds’) of the objects are known or can be learned, the problem can be solved by the watershed algorithm. For example, in a 3D U-Net was trained to predict cell contours together with cell centroids as seeds for watershed in 3D confocal microscopy images. This method, however, suffers from the usual drawback of the watershed algorithm: misclassification of a single cell centroid results in sub-optimal seeding and leads to segmentation errors.

Recently, an approach combining the output of two neural networks and watershed to detect individual cells showed promising results on segmentation of cells in 2D. Although this method can in principle be generalized to 3D images, the necessity to train two separate networks poses additional difficulty for non-experts.

While deep learning-based methods define the state-of-the-art for all image segmentation problems, only a handful of software packages strives to make them accessible to non-expert users in biology (reviewed in). Notably, the U-Net segmentation plugin for ImageJ conveniently exposes U-Net predictions and computes the final segmentation from simple thresholding of the probability maps. CDeep3M and DeepCell enable, via the command-line, the thresholding of the probability maps given by the network, and DeepCell allows instance segmentation as described in. More advanced post-processing methods are provided by the ilastik Multicut workflow, however, these are not integrated with CNN-based prediction.

Here, we present PlantSeg, a deep learning-based pipeline for volumetric instance segmentation of dense plant tissues at single-cell resolution. PlantSeg processes the output from the microscope with a CNN to produce an accurate prediction of cell boundaries. Building on the insights from previous work on cell segmentation in electron microscopy volumes of neural tissue, the second step of the pipeline delivers an accurate segmentation by solving a graph partitioning problem. We trained PlantSeg on 3D confocal images of fixed Arabidopsis thaliana ovules and 3D+t light sheet microscope images of developing lateral roots, two standard imaging modalities in the studies of plant morphogenesis. We investigated a range of network architectures and graph partitioning algorithms and selected the ones which performed best with regard to extensive manually annotated ground truth. We benchmarked PlantSeg on a variety of datasets covering a range of samples and image resolutions. Overall, PlantSeg delivers excellent results on unseen data and, as we show through quantitative and qualitative evaluation, even non-plant datasets do not necessarily require network retraining. Combining the repository of accurate neural networks trained on the two common microscope modalities and going beyond just thresholding or watershed with robust graph partitioning strategies is the main strength of our package. PlantSeg is an open-source tool which contains the complete pipeline for segmenting large volumes. Each step of the pipeline can be adjusted via a convenient graphical user interface while expert users can modify configuration files and run PlantSeg from the command line. Users can also provide their own pre-trained networks for the first step of the pipeline using a popular 3D U-Net implementation (https://github.com/wolny/pytorch-3dunet), which was developed as a part of this project. Although PlantSeg was designed to segment 3D images, one can directly use it to segment 2D stacks. Besides the tool itself, we provide all the networks we trained for the confocal and light sheet modalities at different resolution levels and make all our training and validation data publicly available All datasets used to support the findings of this study have been deposited in https://osf.io/uzq3w. All the source code can be found at (; https://github.com/hci-unihd/plant-seg; copy archived at https://github.com/elifesciences-publications/plant-seg).

A pipeline for segmentation of plant tissues into cells

The segmentation algorithm we propose contains two major steps. In the first step, a fully convolutional neural network (a variant of U-Net) is trained to predict cell boundaries. Afterwards, a region adjacency graph is constructed from the pixels with edge weights computed from the boundary predictions. In the second step, the final segmentation is computed as a partitioning of this graph into an unknown number of objects (see Figure 1). Our choice of graph partitioning as the second step is inspired by a body of work on segmentation for nanoscale connectomics (segmentation of cells in electron microscopy images of neural tissue), where such methods have been shown to outperform more simple post-processing of the boundary maps.

Datasets

To make our tool as generic as possible, we used both fixed and live samples as core datasets for design, validation and testing. Two microscope modalities common in studies of morphogenesis were employed, followed by manual and semi-automated annotation of ground truth segmentation.

The first dataset consists of fixed Arabidopsis thaliana ovules at all developmental stages acquired by confocal laser scanning microscopy with a voxel size of 0.075 × 0.075 × 0.235 μm. 48 volumetric stacks with hand-curated ground truth segmentation were used. A complete description of the image acquisition settings and the ground truth creation protocol is reported in.

The second dataset consists of three time-lapse videos showing the development of Arabidopsis thaliana lateral root primordia (LRP). Each recording was obtained by imaging wild-type Arabidopsis plants expressing markers for the plasma membrane and the nuclei using a light sheet fluorescence microscope (LSFM). Stacks of images were acquired every 30 min with constant settings across movies and time points, with a voxel size of 0.1625 × 0.1625 × 0.250 μm. The first movie consists of 52 time points of size 2048 × 1050 × 486 voxels. The second movie consists of 90 time points of size 1940 × 1396 × 403 voxels and the third one of 92 time points of size 2048 × 1195 × 566 voxels. The ground truth was generated for 27 images depicting different developmental stages of LRP coming from the three movies (see Appendix 1 Groundtruth Creation).

The two datasets were acquired on different types of microscopes and differ in image quality. To quantify the differences we used the peak signal-to-noise (PSNR) and the structural similarity index measure (SSIM). We computed both metrics using the input images and their ground truth boundary masks; higher values show better quality. The average PSNR measured on the light sheet dataset was 22.5 ± 6.5 dB (average ± SD), 3.4 dB lower than the average PSNR computed on the confocal dataset (25.9 ± 5.7). Similarly, the average SSIM is 0.53 ± 0.12 for the light sheet, 0.1 lower than 0.63 ± 0.13 value measured on the confocal images. Both datasets thus contain a significant amount of noise. LSFM images are noisier and more difficult to segment, not only because of the noise, but also due to part of nuclear labels being in the same channel as membrane staining.

In the following we describe in detail the design and performance of each of the two steps of the pipeline.

Step 1: cell boundary detection

Being the current state of the art in bioimage segmentation, U-Net was chosen as the base model architecture for predicting the boundaries between cells. Aiming for the best performance across different microscope modalities, we explored various components of neural network design critical for improved generalization and robustness to noise, namely: the network architecture, loss function, normalization layers and size of patches used for training. For the final PlantSeg package we trained one set of CNNs for each dataset as the ovule and lateral root datasets are substantially different.

In more detail, with regard to the network architecture we compared the regular 3D U-Net as described in with a Residual U-Net from. We tested two loss functions commonly used for the semantic segmentation task: binary cross-entropy (BCE) and Dice loss, as well as their linear combination termed BCE-Dice. The patch size and normalization layers were investigated jointly by comparing training on a single large patch, versus training on multiple smaller patches per network iteration. For single patch we used group normalization whereas standard batch normalization was used for the multiple patches.

In the ovule dataset, 39 stacks were randomly selected for training, two for validation and seven for testing. In the LRP dataset, 27 time points were randomly selected from the three videos for training, two time points were used for validation and four for testing.

The best performing CNN architectures and training procedures is illustrated by the precision/recall curves evaluated at different threshold levels of the predicted boundary probability maps (see Figure 2). Training with a combination of binary cross-entropy and Dice loss performed best on average across the two datasets in question contributing to 3 out of 6 best performing network variants. BCE-Dice loss also generalized well on the out of sample data described in 2.1.4 Performance on external plant datasets. Due to the regularity of cell shapes, the networks do not benefit from broader spatial context when only cell membrane signal is present in input images. Indeed, training the networks with bigger patch sizes does not noticeably increase the performance as compared to training with smaller patches. 4 out of 6 best performing networks use smaller patches and batch normalization (Batch-Norm) whereas only 2 out of 6 use bigger patches and group normalization (Group-Norm). Residual U-Net architecture (3D-ResUnet) performed best on the LRP dataset (Figure 2B), whereas standard U-Net architecture (3D-Unet) was better on the ovule datasets (Figure 2A). For a complete overview of the performance of investigated models see also Figure 1 and Appendix 5—table 1. In conclusion, choosing the right loss function and normalization layers increased the final performance on the task of boundary prediction on both microscope modalities.

Step 2: segmentation of tissues into cells using graph partitioning

After the cell boundaries are predicted, segmentation of the cells can be formulated as a generic graph partitioning problem, where the graph is built as the region adjacency graph of the image voxels. However, solving the partitioning problem directly at voxel-level is computationally expensive for volumes of biologically relevant size. To make the computation tractable, we first cluster the voxels into so-called supervoxels by running a watershed algorithm on the distance transform of the boundary map, seeded by all local maxima of the distance transform smoothed by a Gaussian blur. The region adjacency graph is then built directly on supervoxels and partitioned into an unknown number of segments to deliver a segmentation. We tested four different partitioning strategies: Multicut, hierarchical agglomeration as implemented in GASP average (GASP), Mutex watershed (Mutex) as well as the distance transform (DT) watershed as a baseline since similar methods have been proposed previously.

To quantify the accuracy of the four segmentation strategies, we use Adapted Rand error (ARand) for the overall segmentation quality and two other metrics based on the variation of information (see Metrics used for evaluation), measuring the tendency to over-split (VOIsplit) or over-merge (VOImerge). GASP, Multicut and Mutex watershed consistently produced accurate segmentation on both datasets with low ARand errors and low rates of merge and split errors (Figure 3A–C and Appendix 5—table 2). As expected DT watershed tends to over-segment with higher split error and resulting higher ARand error. Multicut solves the graph partitioning problem in a globally optimal way and is therefore expected to perform better compared to greedy algorithms such as GASP and Mutex watershed. However, in our case the gain was marginal, probably due to the high quality of the boundary predictions.

The performance of PlantSeg was also assessed qualitatively by expert biologists. The segmentation quality for both datasets is very satisfactory. For example in the lateral root dataset, even in cases where the boundary appeared masked by the high brightness of the nuclear signal, the network correctly detected it and separated the two cells (Figure 3D, green box). On the ovule dataset, the network is able to detect weak boundaries and correctly separate cells in regions where the human expert fails (Figure 3E, green box). The main mode of error identified in the lateral root dataset is due to the ability of the network to remove the nuclear signal which can weaken or remove part of the adjacent boundary signal leading to missing or blurry cell contour. For example, the weak signal of a newly formed cell wall close to two nuclei was not detected by the network and the cells were merged (Figure 3D, red box). For the ovule dataset, in rare cases of very weak boundary signal, failure to correctly separate cells could also be observed (Figure 3E, red box).

Taken together, our analysis shows that segmentation of plant tissue using graph partitioning handles robustly boundary discontinuities present in plant tissue segmentation problems.

Performance on external plant datasets

To test the generalization capacity of PlantSeg, we assessed its performance on data for which no network training was performed. To this end, we took advantage of the two publicly available datasets: Arabidopsis 3D Digital Tissue Atlas (https://osf.io/fzr56) composed of eight stacks of eight different Arabidopsis thaliana organs with hand-curated ground truth, as well as the developing leaf of the Arabidopsis with 3D segmentation given by the SimpleITK package. The input images from the digital tissue atlas are confocal stacks of fixed tissue with stained cell contours and thus similar to the images of the Arabidopsis ovules, whereas the images of the leaf were acquired through the use of live confocal imaging. It’s important to note that the latter image stacks contain highly lobed epidermal cells, which are difficult to segment with classical watershed-based algorithms. We fed the confocal stacks to PlantSeg and qualitatively assessed the resulting segmentation. Quantitative assessment was performed only for the digital tissue atlas, where the ground truth labels are available.

Qualitatively, PlantSeg performed well on both datasets, giving satisfactory results on all organs from the 3D Digital Tissue Atlas, correctly segmenting even the oval non-touching cells of the anther and leaf: a cell shape not present in the training data (Figure 4). Our pipeline yielded especially good segmentation results when applied to the complex epidermal cells, visibly outperforming the results obtained using the SimpleITK framework (Figure 5).

Quantitatively, the performance of PlantSeg out of the box (default parameters) on the 3D Digital Tissue Atlas is on par with the scores reported on the LRP and ovules datasets on the anther, leaf, and the root, but lower for the other tissues (Table 1, left). Default parameters have been chosen to deliver good results on most type of data, however we show that a substantial improvement can be obtained by parameter tuning (see Appendix 6: PlantSeg - Parameters Guide for an overview of the pipeline’s hyperparameters and Appendix 7: Empirical Example of parameter tuning for a detailed guide on empirical parameter tuning), in case of the tissue 3D Digital Tissue Atlas tuning improved segmentation by a factor of two as measured with the ARand error (Table 1, right). It should be noted that the ground truth included in the dataset was created for analysis of the cellular connectivity network, with portions of the volumes missing or having low quality ground truth (see e.g filament and sepal in Figure 4). For this reason, the performance of PlantSeg on these datasets may be underestimated.

Altogether, PlantSeg performed well qualitatively and quantitatively on datasets acquired by different groups, on different microscopes, and at different resolutions than the training data. This demonstrates the generalization capacity of the pre-trained models from the PlantSeg package.

Performance on a non-plant benchmark

For completeness, we compared PlantSeg performance with state-of-the-art methods on a non-plant open benchmark consisting of epithelial cells of the Drosophila wing disc. Visually, the benchmark images are quite similar to the ovules dataset: membrane staining is used along with a confocal microscope, and the cell shapes are compact and relatively regular. Although we did not train the neural networks on the benchmark datasets and used only the ovule pre-trained models provided with the PlantSeg package, we found out that PlantSeg is very competitive qualitatively and quantitatively and faster than the state-of-the-art methods, all of which rely on networks trained directly on the benchmark dataset (see Appendix 3: Performance of PlantSeg on an independent reference benchmark for detailed overview of the benchmark results). We argue that the large selection of pre-trained networks and graph partitioning algorithms make PlantSeg versatile enough to work well on wide variety of membrane stained tissues, beyond plant samples.

A package for plant tissue segmentation and benchmarking

We release PlantSeg as an open-source software for the 2D and 3D segmentation of cells with cell contour staining. PlantSeg allows for data pre-processing, boundary prediction with neural networks and segmentation of the network output with a choice of four partitioning methods: Multicut, GASP, Mutex watershed and DT watershed.

PlantSeg can be executed via a simple graphical user interface or via the command line. The critical parameters of the pipeline are specified in a configuration file. Running PlantSeg from the graphical user interface is well suited for processing of single experiments, while the use of the command line utility enables large scale batch processing and remote execution. Our software can export both the segmentation results and the boundary probability maps as Hierarchical Data Format (HDF5) or Tagged Image File Format (TIFF). Both file formats are widely supported and the results can be further processed by other bioimage analysis tools, such as ilastik, MorphographX or Fiji. In particular: the final segmentation is exported as a labeled volume where all pixels of each segmented cell are assigned the same integer value. It is best viewed with a random lookup table, such as ‘glasbey’ in Fiji. In exported boundary probability maps each pixel has a floating point number between 0 and 1 reflecting a probability of that pixel belonging to a cell boundary. PlantSeg comes with several 2D and 3D networks pre-trained on different voxel size of the Arabidopsis ovule and LRP datasets. Users can select from the available set of pre-trained networks the one with features most similar to their datasets. Alternatively, users can let PlantSeg select the pre-trained network based on the microscope modality (light sheet or confocal) and voxel size. PlantSeg also provides a command-line tool for training the network on new data when none of the pre-trained network is suitable to the user’s needs.

PlantSeg is publicly available https://github.com/hci-unihd/plant-seg. The repository includes a complete user guide and the evaluation scripts used for quantitative analysis. Besides the source code, we provide a Linux conda package and a docker image which allows to run PlantSeg on non-Linux operating systems. The software is written in Python, the neural networks use the PyTorch framework. We also make available the raw microscopic images as well as the ground truth used for training, validation and testing.

Applications of PlantSeg

Here, we show case applications of PlantSeg to the analysis of the growth and differentiation of plant organs at cellular resolution.

Variability in cell number of ovule primordia

Ovule development in Arabidopsis thaliana has been described to follow a stereotypical pattern. However, it is unclear if ovules within a pistil develop in a synchronous fashion.

Taking advantage of PlantSeg we undertook an initial assessment of the regularity of primordia formation between ovules developing within a given pistil (Figure 6). We noticed that spacing between primordia is not uniform (Figure 6A). Our results further indicated that six out of the eight analyzed stage 1 primordia (staging according to ) showed a comparable number of cells (140.5 ± 10.84, mean ± SD, ovules 1–5, 7) (Figure 6B). However, two primordia exhibited a smaller number of cells with ovule #6 being composed of 91 and ovule #8 of 57 cells, respectively. Interestingly, we observed that the cell number of a primordium does not necessarily translate into its respective height or proximal-distal (PD) extension. For example, ovule #2, which is composed of 150 cells and thus of the second largest number of cells of the analyzed specimen, actually represents the second shortest of the eight primordia with a height of (Figure 6C). Its comparably large number of cells relates to a wide base of the primordium. Taken together, this analysis indicates that ovule primordium formation within a pistil is relatively uniform, however, some variability can be observed.

Asymmetric division of lateral root founder cells

Arabidopsis thaliana constantly forms lateral roots (LRs) that branch from the main root. These LRs arise from a handful of founder cells located in the pericycle, a layer of cells located deep within the primary root. Upon lateral root initiation, these founder cells invariably undergo a first asymmetric division giving rise to one small and one large daughter cell. Although the asymmetric nature of this division has long been reported and its importance realised, it is still unknown how regular the volume partitioning is between the daughter cells. We used the segmentation of the LR dataset produced by PlantSeg to quantify this ratio. The asymmetric divisions were identified by visual examination during the first 12 hr of the recording and the volumes of the two daughter cells retrieved (Figure 7B). The analysis of cell volume ratios confirmed that the first division of the founder cell is asymmetric with a volume ratio between the two daughter cells of 0.65 ± 0.22 (mean ± SD, ) (Figure 7C).

Epidermal cell volumes in a shoot apical meristem

Epidermal cell morphologies in the shoot apical meristem of Arabidopsis thaliana are genetically controlled and even subtle changes can have an impact on organogenesis and pattern formation. To quantify respective cell shapes and volumes in the newly identified big cells in epidermis (bce) mutant we used the PlantSeg package to analyze image volumes of six Arabidopsis thaliana meristems (three wild type and three bce specimens).

Inflorescence meristems of Arabidopsis thaliana were imaged using confocal las[er scanning microscopy after staining cell walls with DAPI. Image volumes were used to obtain 3D cell segmentations using PlantSeg: in this case a 3D UNet trained on the Arabidopsis ovules was used in combination with the Multicut algorithm. This segmentation procedure allows to determine epidermal cell volumes for wild-type (Figure 8A) and the bce mutant (Figure 8B). Cells within a radius of 33 µm around the manually selected center of the meristem (colored cells in Figure 8A and B) were used for the cell volume quantification shown in Figure 8C. The mean volume of epidermal cells in the bce mutant is increased by roughly 50% whereas overall meristem size is only slightly reduced which implicates changes in epidermal cell division in mutant meristems.

Analysis of leaf growth and differentiation

Leaves are a useful system to study morphogenesis in the context of evolution because final organ forms of different species show considerable variation despite originating from almost indistinguishable buds. To track leaf growth, the same sample is imaged over the course of several days, covering a volume much larger than ovules or meristems. To reduce stress and growth arrest it is required to use relatively low resolution and laser intensity which makes an accurate full 3D segmentation more challenging. Because leaves grow mainly in two dimensions, their morphogenesis can be tracked on the organ surface. We therefore use the software platform MorphoGraphX which is specialized in creating and analyzing curved surface segmentations. It offers a semi-automatic surface segmentation pipeline using a seeded watershed algorithm (Figure 10A–C) but segmentation errors require extensive curation by the user. We tested whether PlantSeg can improve the segmentation pipeline of MorphoGraphX by using PlantSeg’s membrane prediction and 3D segmented output files as additional input for creating the surface segmentation in MorphoGraphX. We used confocal laser scanning microscopy stacks of Arabidopsis thaliana and Cardamine hirsuta leaves fluorescently tagged at the cell boundaries (Figure 10A). Voxel sizes ranged from to.

We compared the auto-segmentation produced by MorphoGraphX using the original raw stacks as input (RawAutoSeg) to the one produced by MorphoGraphX using PlantSeg’s wall prediction (PredAutoSeg) or by projecting PlantSeg’s 3D segmentation (Proj3D) (Figure 10B,C). We tested six different samples and computed the quality measures for the results of all different methods: ARand, VOImerge and VOIsplit as well as the accuracy (% of correctly segmented cells compared to the GT). The two methods using PlantSeg input produced lower ARand scores and higher accuracy than using the raw input (Figure 9). Therefore, combining PlantSeg with MorphographX produced segmentations more similar to the GT at the vertex and cell levels.

Next, we used the PlantSeg segmentation to measure growth over 24 hr at cellular resolution and compare differentiation in A. thaliana and C. hirsuta 600 µm-long leaves. Growth was slow in the midrib and distal margin cells, whereas the remaining blade displayed a gradient along the proximal-distal axis with the maximum values at the basal margin (Figure 10D). Tissue differentiation typically starts at the apex of leaves and progresses basipetally influencing this growth gradient. To compare this process between A. thaliana and C. hirsuta leaves, for each cell, we extracted its distance to the leaf base together with its area and lobeyness, attributes positively correlated with differentiation. Overall, A. thaliana leaves showed higher cell size and lobeyness, and this difference accentuated towards the apex, confirming earlier differentiation onset in this species (Figure 10E,F).

Discussion

Taking advantage of the latest developments in machine learning and computer vision we created PlantSeg, a simple, powerful, and versatile tool for plant cell segmentation. Internally, it implements a two-step algorithm: the images are first passed through a state-of-the-art convolutional neural network to detect cell boundaries. In the second step, the detected boundaries are used to over-segment the image using the distance transform watershed and then a region adjacency graph of the image superpixels is constructed. The graph is partitioned to deliver accurate segmentation even for noisy live imaging of dense plant tissue.

PlantSeg was trained on confocal images of Arabidopsis thaliana ovules and light sheet images of the lateral root primordia and delivers high-quality segmentation on images from these datasets never seen during training as attested by both qualitative and quantitative benchmarks. We experimented with different U-Net designs and hyperparameters, as well as with different graph partitioning algorithms, to equip PlantSeg with the ones that generalize the best. This is illustrated by the excellent performance of PlantSeg without retraining of the CNNs on a variety of plant tissues and organs imaged using confocal microscopy (3D Cell Atlas Dataset) including the highly lobed epidermal cells. This feature underlines the versatility of our approach for images presenting similar features to the ones used in training. In addition, PlantSeg comes with scripts to train a CNN on a new set of images and evaluate its performance. Given the importance of ground truth for training of CNNs we also provide instructions on how to generate ground truth in the Appendix 1: Groundtruth Creation. Besides the plant data, we compared PlantSeg to the state-of-the-art on an open benchmark for the segmentation of epithelial cells in the Drosophila wing disc. Using only the pre-trained networks, PlantSeg performance was shown to be close to the benchmark leaders, while additional training on challenge data has narrowed the gap even further.

We demonstrate the usefulness of PlantSeg on four concrete biological applications that require accurate extraction of cell geometries from complex, densely packed 3D tissues. First, PlantSeg allowed to sample the variability in the development of ovules in a given pistil and reveal that those develop in a relatively synchronous manner. Second, PlantSeg allowed the precise computation of the volumes of the daughter cells resulting from the asymmetric division of the lateral root founder cell. This division results in a large and a small daughter cells with volume ratio of between them. Third, segmentation of the epidermal cells in the shoot apical meristem revealed that these cells are enlarged in the bce mutant compared to wild type. Finally, we showed that PlantSeg can be used to improve the automated surface segmentation of time-lapse leaf stacks which enables different downstream analyses such as growth tracking at cell resolution. Accurate and versatile extraction of cell outlines rendered possible by PlantSeg opens the door to rapid and robust quantitative morphometric analysis of plant cell geometry in complex tissues. This is particularly relevant given the central role plant cell shape plays in the control of cell growth and division.

Unlike intensity-based segmentation methods used, for example, to extract DAPI-stained cell nuclei, our approach relies purely on boundary information derived from cell contour detection. While this approach grants access to the cell morphology and cell-cell interactions, it brings additional challenges to the segmentation problem. Blurry or barely detectable boundaries lead to discontinuities in the membrane structure predicted by the network, which in turn might cause cells to be under-segmented. The segmentation results produced by PlantSeg on new datasets are not fully perfect and still require proof-reading to reach 100% accuracy. For our experiments we used Paintera for manually correcting the 3D segmentation results. Importantly the newly proof-read results can then be used to train a better network that can be applied to this type of data in the future (see the Appendix 1: Groundtruth Creation for an overview of this process). If nuclei are imaged along with cell contours, nuclear signal can be leveraged for improving the segmentation as we have explored in (see Appendix 2: Exploiting nuclei staining to improve the lateral root cells' segmentation for detailed procedure). In future work, we envision developing new semi-supervised approaches that would exploit the vast amounts of unlabeled data available in the plant imaging community.

During the development of PlantSeg, we realised that very few benchmark datasets were available to the community for plant cell segmentation tasks, a notable exception being the 3D Tissue Atlas. To address this gap, we publicly release our sets of images and the corresponding hand-curated ground truth in the hope to catalyse future development and evaluation of cell instance segmentation algorithms.

Biological material and imaging

Imaging of the Arabidopsis thaliana ovules was performed as described in. Imaging of the shoot apical meristem was performed as previously described; with a confocal laser scanning microscope (Nikon A1, 25 × NA = 1.1) after staining cell walls with DAPI (0.2 mg/ml).

For imaging of Arabidopsis thaliana lateral root, seedlings of the line sC111 (UB10pro:: PIP 1,4-3 × GFP/GAT A23pro:: H2B: 3 × mCherry/DR5v2pro:: 3 × YFPnls/RPS5Apro:: dtTomato: NLS, described in ) were used at 5 day post germination. Sterilized seeds were germinated on top of 4.5 mm long Blaubrand micropipettes (Cat 708744; 100 μl) that were immobilised on the bottom of a petri dish and covered with MS-phytagel. Before sowing, the top of the micropipettes is exposed by removing the phytagel with a razor blade and one seed is sowed per micropipette. Plates were stratified for two days and transferred to a growth incubator (23°C, 16 h day light). Imaging was performed on a Luxendo MuViSPIM (https://luxendo.eu/products/muvi-spim/) equipped with two 10×NA=0.3for illumination and 40×NA=0.8for detection. The following settings were used for imaging: image size, exposure time 75 ms, channel #1 illumination 488 nm 10% power, detection 497–553 nm band pass filter, channel #2 illumination 561 nm 10% power, detection 610–628 nm band pass filter. Stacks encompassing the whole volume of the root were acquired every 30 min. Images from the two cameras were fused using the Luxendo Image processing tool and registered to correct any 3D drift using the BigDataProcessor in Fiji.

Leaves were grown and imaged as described previously. Cells were visualized either by expressing of UBQ10::acyl:YFP or by staining with 10 mg/mL propidium iodide for 15 min. The bce mutant is a yet uncharacterised recessive mutant obtained in J. Lohmanns lab. The phenotype was observed after T-DNA transformation of Arabidopsis Col-0 plants.

Creation of leaf surface segmentations

To compare the segmentations created by MorphoGraphX alone with the ones using PlantSeg’s files as input, we first obtained a ground-truth segmentation using the MorphographX auto-segmentation pipeline as described in (Figure 10B) and manually fixed all segmentation errors using processes in MorphoGraphX. We then fed the confocal stacks to PlantSeg to compute wall predictions and 3D segmentations using the network trained on the ovule confocal data and the GASP method. Note that for samples with weaker cell wall signal we processed the raw input data in MorphoGraphX by adding a 2 µm thick layer of signal under the surface mesh and fed these to PlantSeg which tended to improve the PlantSeg output greatly. We then created surface segmentation using three methods: First, using the raw stack and the auto-segmentation pipeline in MorphoGraphX (method RawAutoSeg, Figure 10B, top). Second, using PlantSeg’s wall prediction values as input for the auto-segmentation process in MorphoGraphX (method PredAutoSeg, Figure 10B, left red arrow) and third, using PlantSeg’s fully segmented stack and projecting the resulting 3D labels onto the surface mesh using a custom process in MorphoGraphX (method Proj3D, Figure 10B, right red arrow).

Training

2D and 3D U-Nets were trained to predict the binary mask of cell boundaries. Ground truth cell contours where obtained by taking the ground truth label volume, finding a two voxels-thick boundaries between labeled regions ( function from the Scikit-image package and applying a Gaussian blur on the resulting boundary image. Gaussian smoothing reduces the high frequency components in the boundary image, which helps prevent over-fitting and makes the boundaries thicker, increasing the amount of foreground signal during training. Transforming the label image into the boundary image is depicted in Equation 1.

Where transforms the labeled volume into the boundary image, is the isotropic Gaussian kernel and * denotes a convolution operator. We use in our experiments. Both standard and residual U-Net architectures were trained using Adam optimizer with, L2 penalty of 0.00001 and initial learning rate. Networks were trained until convergence for 150K iterations, using the PyTorch framework on 8 NVIDIA GeForce RTX 2080 Ti GPUs. For validation during training, we used the adjusted Rand error computed between the ground truth segmentation and segmentation obtained by thresholding the probability maps predicted by the network and running the connected components algorithm. The learning rate was being reduced by a factor of 2 once the learning stagnated during training, that is, no improvements were observed on the validation set for a given number of iterations. We choose as best network the one with lowest Arand error values. For training with small patch sizes we used 4 patches of shape and batch normalization per network iteration. When training with a single large patch (size ), we used group normalization layers instead of batch normalization. The reason is that batch normalization with a single patch per iteration becomes an instance normalization and makes the estimated batch statistics weaker. All networks use the same layer ordering where the normalization layer is followed by the 3D convolution and a rectified linear unit (ReLU) activation. This order of layers consistently performed better than alternative orderings. During training and inference, input images were standardized by subtracting mean intensity and dividing by the standard deviation. We used random horizontal and vertical flips, random rotations in the XY-plane, elastic deformations and noise augmentations (additive Gaussian, additive Poisson) of the input image during training in order to increase network generalization on unseen data. The performance of CNNs is sensitive to changes in voxel size and object sizes between training and test images. We thus also trained the networks using the original datasets downscaled by a factor of 2 and 3 in the XY dimension.

3D U-Nets trained at different scales of our two core datasets (light-sheet lateral root, confocal ovules) are made available as part of the PlantSeg package. All released networks were trained according to the procedure described above using a combination of binary cross-entropy and Dice loss:

(we set, in our experiments) and follow the standard U-Net architecture with two minor modifications: batch normalization is replaced by group normalization and same convolutions are used instead of valid convolutions. For completeness we also publish 2D U-Nets trained using the Z-slices from the original 3D stacks, enabling segmentation of 2D images with PlantSeg.

Inference

During inference we used mirror padding on the input image to improve the prediction at the boundaries of the volume. We kept the same patch sizes as during training since increasing it during inference might lead to lower quality of the predictions, especially on the borders of the patch. We also parse the volume patch-by-patch with a 50% overlap between consecutive tiles and average the probability maps. This strategy prevents checkerboard artifacts and reduces noise in the final prediction.

The code used for training and inference can be found at https://github.com/wolny/pytorch-3dunet copy archived at https://github.com/elifesciences-publications/pytorch-3dunet.

Segmentation using graph partitioning

The boundary predictions produced by the CNN are treated as a graph, where nodes V are represented by the image voxels, and the edges E connect adjacent voxels. The weight of each edge is derived from the boundary probability maps. On this graph we first performed an over-segmentation by running the DT watershed. For this, we threshold the boundary probability maps at a given value δ to get a binary image ( was chosen empirically in our experiments). Then we compute the distance transform from the binary boundary image, apply a Gaussian smoothing and assign a seed to every local minimum in the resulting distance transform map. Finally we remove small regions (<50 voxels). Standalone DT watershed already delivers accurate segmentation and can be used as is in simple cases when, for example noise is low and/or boundaries are sharp.

For Multicut, GASP, and Mutex watershed algorithms, we used the DT watershed as an input. Although all three algorithms could be run directly on the boundary predictions produced by the CNN (voxel level), we choose to run them on a region adjacency graph (RAG) derived from the DT watershed to reduce the computation time. In the region adjacency graph each node represents a region and edges connect adjacent regions. We compute edge weights by using the mean value of the probabilities maps along the boundary. We then run Multicut, GASP or Mutex watershed with a hyperparameter that balances over- and under-segmentation (with higher tending to over-segment). As a general guideline for choosing the partitioning strategy on a new data is to start with GASP algorithm, which is the most generic. If needed, one may try to improve the results with multicut or mutex watershed. If none of the three strategies give satisfactory segmentation results we recommend to over-segment provided stack using the distance transform watershed and proofread the result manually using Paintera software.

A detailed overview of the parameters exposed via the PlantSeg’s UI can be found on the project’s GitHub page https://github.com/hci-unihd/plant-seg as well as in Appendix 6—table 3.

Metrics used for evaluation

For the boundary predictions we used precision (number of pixels positively predicted as boundary divided by the number of boundary pixels in the ground truth), recall (number of positively predicted boundary pixels divided by the sum of positively and negatively predicted boundary pixels) and F1 score

For the final segmentation, we used the inverse of the Adjusted Rand Index (AdjRand) defined as which measures the distance between two clustering as global measure of accuracy between PlantSeg prediction and ground truth. An ARand error of 0 means that the PlantSeg results are identical to the ground truth, whereas one shows no correlation between the ground truth and the segmentation results. To quantify the rate of merge and split errors, we used the Variation of Information (VOI) which is an entropy based measure of clustering quality. It is defined as:where H is the conditional entropy function and the Seg and GT the predicted segmentation and ground truth segmentation respectively. defines the split mistakes (VOIsplit) whereas corresponds to the merge mistakes (VOImerge).

References 75

  1. 1.

    Aigouy B, Umetsu D, Eaton S, Dahmann C. Segmentation and quantitative analysis of epithelial tissues. Drosophila Methods in Molecular Biology. 2016;420-450.

    Not in our library10.1007/978-1-4939-6371-3_13

  2. 2.

    Bailoni A, Pape C, Wolf S, Beier T, Kreshuk A, Hamprecht FA. A generalized framework for agglomerative clustering of signed graphs applied to instance segmentation. arXiv. 2019.

    Not in our library

  3. 3.
  4. 4.

    Bassel G. Arabidopsis 3d Digital Tissue Atlas OSF. 2019.

    Not in our library

  5. 5.

    Beier T, Pape C, Rahaman N, Prange T, Berg S, Bock DD, Cardona A, Knott GW, Plaza SM, Scheffer LK, Koethe U, Kreshuk A, Hamprecht FA. Multicut brings automated neurite segmentation closer to human performance. Nature Methods. 2017;14:101-102.

    Not in our library10.1038/nmeth.4151

  6. 6.

    Berg S, Kutra D, Kroeger T, Straehle CN, Kausler BX, Haubold C, Schiegg M, Ales J, Beier T, Rudy M, Eren K, Cervantes JI, Xu B, Beuttenmueller F, Wolny A, Zhang C, Koethe U, Hamprecht FA, Kreshuk A. Ilastik: interactive machine learning for (bio)image analysis. Nature Methods. 2019;16:1226-1232.

    Not in our library10.1038/s41592-019-0582-9

  7. 7.

    Briggman K, Denk W, Seung S, Helmstaedter MN, Turaga SC, Jordan MI, LeCun Y, Solla SA. Maximin affinity learning of image segmentation. Advances in Neural Information Processing Systems. 2009;1865-1873.

    Not in our library

  8. 8.

    Canny J. A computational approach to edge detection. 1986;679-698.

    Not in our library10.1109/tpami.1986.4767851

  9. 9.

    Cerrone L, Zeilmann A, Hamprecht FA. End-to-end learned random walker for seeded image segmentation. arXiv. 2019.

    Not in our library

  10. 10.

    Çiçek Ö, Abdulkadir A, Lienkamp SS, Brox T, Ronneberger O. 3d u-net: learning dense volumetric segmentation from sparse annotation. 2016;424-432.

    Not in our library

  11. 11.

    Couprie C, Grady L, Najman L, Talbot H. Power watershed: a unifying Graph-Based optimization framework. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2011;33:1384-1399.

    Not in our library10.1109/tpami.2010.200

  12. 12.

    CREMI. 2017.

    Not in our library

  13. 13.

    Eschweiler D, Spina T, Choudhury RC, Meyerowitz E, Cunha A, Stegmaier J. Cnn-based preprocessing to optimize watershed-based cell segmentation in 3d confocal microscopy images. arXiv. 2018.

    Not in our library

  14. 14.

    Falk T, Mai D, Bensch R, Çiçek Ö, Abdulkadir A, Marrakchi Y, Böhm A, Deubner J, Jäckel Z, Seiwald K, Dovzhenko A, Tietz O, Dal Bosco C, Walsh S, Saltukoglu D, Tay TL, Prinz M, Palme K, Simons M, Diester I, Brox T, Ronneberger O. U-Net: deep learning for cell counting, detection, and morphometry. Nature Methods. 2019;16:67-70.

    Not in our library10.1038/s41592-018-0261-2

  15. 15.

    Fernandez R, Das P, Mirabet V, Moscardi E, Traas J, Verdeil JL, Malandain G, Godin C. Imaging plant growth in 4D: robust tissue reconstruction and lineaging at cell resolution. Nature Methods. 2010;7:547-553.

    Not in our library10.1038/nmeth.1472

  16. 16.

    Fox S, Southam P, Pantin F, Kennaway R, Robinson S, Castorina G, Sánchez-Corrales YE, Sablowski R, Chan J, Grieneisen V, Marée AFM, Bangham JA, Coen E. Spatiotemporal coordination of cell division and growth during organ morphogenesis. PLOS Biology. 2018;16:e2005952.

    Not in our library10.1371/journal.pbio.2005952

  17. 17.

    Funke J, Tschopp F, Grisaitis W, Sheridan A, Singh C, Saalfeld S, Turaga SC. A deep structured learning approach towards automating connectome reconstruction from 3d electron micrographs. arXiv. 2017.

    Not in our library

  18. 18.

    Funke J, Tschopp F, Grisaitis W, Sheridan A, Singh C, Saalfeld S, Turaga SC. Large scale image segmentation with structured loss based deep learning for connectome reconstruction. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2019a;41:1669-1680.

    Not in our library10.1109/tpami.2018.2835450

  19. 19.

    Funke J, Mais L, Champion A, Dye N, Kainmueller D. A Benchmark for Epithelial Cell Tracking. 2019b.

    Not in our library

  20. 20.

    Haberl MG, Churas C, Tindall L, Boassa D, Phan S, Bushong EA, Madany M, Akay R, Deerinck TJ, Peltier ST, Ellisman MH. CDeep3M-Plug-and-Play cloud-based deep learning for image segmentation. Nature Methods. 2018;15:677-680.

    Not in our library10.1038/s41592-018-0106-z

  21. 21.

    Hanslovsky P, Leite V, Saalfeld S, Pisarev I, Funke J, Pietzsch T, Günther U, Bogovic J, Schmidt U, Nunez-Iglesias J. saalfeldlab/paintera. 2019.

    Not in our library

  22. 22.

    Heisler MG, Ohno C, Riechmann J. L, Wellmer F. Live-Imaging of the Arabidopsis Inflorescence Meristem. Flower Development: Methods and Protocols, Methods in Molecular Biology. 2014;431-440.

    Not in our library10.1007/978-1-4614-9408-9

  23. 23.

    Horé A, Ziou D. Image Quality Metrics: Psnr vs. Ssim. 2010;2366-2369.

    Not in our library10.1109/icpr.2010.579

  24. 24.

    Horňáková A, Lange J-H, Andres B. Analysis and Optimization of Graph Decompositions by Lifted Multicuts. 2017;1539-1548.

    Not in our library

  25. 25.

    Ioffe S, Szegedy C. Batch normalization: accelerating deep network training by reducing internal covariate shift. arXiv. 2015.

    Not in our library

  26. 26.

    Januszewski M, Maitin-Shepard J, Li P, Kornfeld J, Denk W, Jain V. Flood-filling networks. arXiv. 2016.

    Not in our library10.1038/s41592-018-0049-4

  27. 27.

    Jug F, Levinkov E, Blasse C, Myers EW, Andres B. Moral lineage tracing. arXiv. 2015.

    Not in our library

  28. 28.

    Kappes JH, Speth M, Andres B, Reinelt G, Schn C. Globally optimal image partitioning by multicuts. 2011;31-44.

    Not in our library

  29. 29.
  30. 30.

    Kingma DP, Ba J. Adam: a method for stochastic optimization. arXiv. 2014.

    Not in our library

  31. 31.

    Kokkinos I. Pushing the boundaries of boundary detection using deep learning. arXiv. 2015.

    Not in our library

  32. 32.

    Laskowski MJ, Williams ME, Nusbaum HC, Sussex IM. Formation of lateral root meristems is a two-stage process. Development. 1995;121:3303-3310.

    Not in our library10.1242/dev.121.10.3303

  33. 33.

    Lee K, Zung J, Li P, Jain V, Seung HS. Superhuman accuracy on the snemi3d connectomics challenge. arXiv. 2017.

    Not in our library

  34. 34.

    Long J, Shelhamer E, Darrell T. Fully Convolutional Networks for Semantic Segmentation. 2015;3431-3440.

    Not in our library10.1109/tpami.2016.2572683

  35. 35.
    The Design of SimpleITK · 2013
    No notice
  36. 36.

    Lucchi A, Smith K, Achanta R, Knott G, Fua P. Supervoxel-based segmentation of mitochondria in em image stacks with learned shape features. IEEE Transactions on Medical Imaging. 2012;31:474-486.

    Not in our library10.1109/tmi.2011.2171705

  37. 37.

    Maizel A, von Wangenheim D, Federici F, Haseloff J, Stelzer EH. High-resolution live imaging of plant growth in near physiological bright conditions using light sheet fluorescence microscopy. The Plant Journal. 2011;68:377-385.

    Not in our library10.1111/j.1365-313x.2011.04692.x

  38. 38.

    Malamy JE, Benfey PN. Organization and cell differentiation in lateral roots of Arabidopsis thaliana. Development. 1997;124:33-44.

    Not in our library10.1242/dev.124.1.33

  39. 39.

    Maška M, Ulman V, Svoboda D, Matula P, Matula P, Ederra C, Urbiola A, España T, Venkatesan S, Balak DM, Karas P, Bolcková T, Streitová M, Carthel C, Coraluppi S, Harder N, Rohr K, Magnusson KE, Jaldén J, Blau HM, Dzyubachyk O, Křížek P, Hagen GM, Pastor-Escuredo D, Jimenez-Carretero D, Ledesma-Carbayo MJ, Muñoz-Barrutia A, Meijering E, Kozubek M, Ortiz-de-Solorzano C. A benchmark for comparison of cell tracking algorithms. Bioinformatics. 2014;30:1609-1617.

    Not in our library10.1093/bioinformatics/btu080

  40. 40.

    Meila M. Comparing Clusterings: An Axiomatic View. 2005;577-584.

    Not in our library

  41. 41.

    Meilă M. Comparing clusterings—an information based distance. Journal of Multivariate Analysis. 2007;98:873-895.

    Not in our library10.1016/j.jmva.2006.11.013

  42. 42.

    Moen E, Bannon D, Kudo T, Graf W, Covert M, Van Valen D. Deep learning for cellular image analysis. Nature Methods. 2019;16:1233-1246.

    Not in our library10.1038/s41592-019-0403-1

  43. 43.

    Nunez-Iglesias J, Kennedy R, Plaza SM, Chakraborty A, Katz WT. Graph-based active learning of agglomeration (GALA): a Python library to segment 2D and 3D neuroimages. Frontiers in Neuroinformatics. 2014;8:34.

    Not in our library10.3389/fninf.2014.00034

  44. 44.

    Pape C, Matskevych A, Wolny A, Hennies J, Mizzon G, Louveaux M, Musser J, Maizel A, Arendt D, Kreshuk A. Leveraging domain knowledge to improve microscopy image segmentation with lifted multicuts. Frontiers in Computer Science. 2019;1:6.

    Not in our library10.3389/fcomp.2019.00006

  45. 45.

    Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga L, Desmaison A, Kopf A, Yang E, DeVito Z, Raison M, Tejani A, Chilamkurthy S, Steiner B, Fang L, Bai J, Chintala S, Wallach H, Larochelle H, Beygelzimer A, dAlché-Buc F, Garnett R, Fox E. Pytorch: An imperative style, high-performance deep learning library. Advances in Neural Information Processing Systems. 2019;8024-8035.

    Not in our library

  46. 46.

    Rand WM. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association. 1971;66:846-850.

    Not in our library10.1080/01621459.1971.10482356

  47. 47.

    Rasmussen CG, Bellinger M. An overview of plant division-plane orientation. New Phytologist. 2018;219:505-512.

    Not in our library10.1111/nph.15183

  48. 48.

    Rempfler M, Lange J, Jug F, Blasse C, Myers EW, Menze BH, Andres B. Efficient algorithms for moral lineage tracing. arXiv. 2017.

    Not in our library

  49. 49.

    Robinson-Beers K, Pruitt RE, Gasser CS. Ovule development in Wild-Type Arabidopsis and two Female-Sterile mutants. The Plant Cell. 1992;4:1237-1249.

    Not in our library10.2307/3869410

  50. 50.

    Roerdink JBTM, Meijster A. The watershed transform: definitions, algorithms and parallelization strategies. Fundamenta Informaticae. 2000;41:187-228.

    Not in our library10.3233/fi-2000-411207

  51. 51.

    Ronneberger O, Fischer P, Brox T. U-net: convolutional networks for biomedical image segmentation. 2015;234-241.

    Not in our library

  52. 52.

    Schindelin J, Arganda-Carreras I, Frise E, Kaynig V, Longair M, Pietzsch T, Preibisch S, Rueden C, Saalfeld S, Schmid B, Tinevez JY, White DJ, Hartenstein V, Eliceiri K, Tomancak P, Cardona A. Fiji: an open-source platform for biological-image analysis. Nature Methods. 2012;9:676-682.

    Not in our library10.1038/nmeth.2019

  53. 53.

    Schneitz K, Hulskamp M, Pruitt RE. Wild-type ovule development in Arabidopsis thaliana: a light microscope study of cleared whole-mount tissue. The Plant Journal. 1995;7:731-749.

    Not in our library10.1046/j.1365-313x.1995.07050731.x

  54. 54.

    Stegmaier J, Amat F, Lemon WC, McDole K, Wan Y, Teodoro G, Mikut R, Keller PJ. Real-time three-dimensional cell segmentation in Large-Scale microscopy data of developing embryos. Developmental Cell. 2016;36:225-240.

    Not in our library10.1016/j.devcel.2015.12.028

  55. 55.

    Strauss S, Sapala A, Kierzkowski D, Smith RS, Cvrčková F. Quantifying plant growth and cell proliferation with morphographx. Plant Cell Morphogenesis. 2019;269-290.

    Not in our library10.1007/978-1-62703-643-6

  56. 56.

    Sudre CH, Li W, Vercauteren T, Ourselin S, Cardoso MJ. Generalised dice overlap as a deep learning loss function for highly unbalanced segmentations. arXiv. 2017.

    Not in our library10.1007/978-3-319-67558-9_28

  57. 57.

    Tischer C, Norlin N, Pepperkok R. BigDataProcessor: Fiji plugin for big image data inspection and processing. 2019.

    Not in our library10.1093/bioinformatics/btab106

  58. 58.

    Tofanelli R, Vijayan A, Scholz S, Schneitz K. Protocol for rapid clearing and staining of fixed Arabidopsis ovules for improved imaging by confocal laser scanning microscopy. Plant Methods. 2019;15:120.

    Not in our library10.1186/s13007-019-0505-x

  59. 59.

    Tu Z, Bai X. Auto-context and its application to high-level vision tasks and 3d brain image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2010;32:1744-1757.

    Not in our library10.1109/tpami.2009.186

  60. 60.

    Turaga SC, Murray JF, Jain V, Roth F, Helmstaedter M, Briggman K, Denk W, Seung HS. Convolutional networks can learn to generate affinity graphs for image segmentation. Neural Computation. 2010;22:511-538.

    Not in our library10.1162/neco.2009.10-08-881

  61. 61.

    Ulyanov D, Vedaldi A, Lempitsky VS. Instance normalization: the missing ingredient for fast stylization. arXiv. 2016.

    Not in our library

  62. 62.
  63. 63.

    van Noord N, Postma E. Learning scale-variant and scale-invariant features for deep image classification. Pattern Recognition. 2017;61:583-592.

    Not in our library10.1016/j.patcog.2016.06.005

  64. 64.
  65. 65.

    Vilches Barro A, Stöckle D, Thellmann M, Ruiz-Duarte P, Bald L, Louveaux M, von Born P, Denninger P, Goh T, Fukaki H, Vermeer JEM, Maizel A. Cytoskeleton dynamics are necessary for early events of lateral root initiation in Arabidopsis. Current Biology. 2019;29:2443-2454.

    Not in our library10.1016/j.cub.2019.06.039

  66. 66.

    von Wangenheim D, Daum G, Lohmann JU, Stelzer EK, Maizel A. Live imaging of Arabidopsis development. Methods in Molecular Biology. 2014;1062:539-550.

    Not in our library10.1007/978-1-62703-580-4_28

  67. 67.

    von Wangenheim D, Fangerau J, Schmitz A, Smith RS, Leitte H, Stelzer EH, Maizel A. Rules and Self-Organizing properties of Post-embryonic plant organ cell division patterns. Current Biology. 2016;26:439-449.

    Not in our library10.1016/j.cub.2015.12.047

  68. 68.

    Wang W, Taft DA, Chen YJ, Zhang J, Wallace CT, Xu M, Watkins SC, Xing J. Learn to segment single cells with deep distance estimator and deep cell detector. Computers in Biology and Medicine. 2019;108:133-141.

    Not in our library10.1016/j.compbiomed.2019.04.006

  69. 69.

    Weissman TA, Pan YA. Brainbow: new resources and emerging biological applications for multicolor genetic labeling and analysis. Genetics. 2015;199:293-306.

    Not in our library10.1534/genetics.114.172510

  70. 70.

    Willis L, Refahi Y, Wightman R, Landrein B, Teles J, Huang KC, Meyerowitz EM, Jönsson H. Cell size and growth regulation in the Arabidopsis thaliana apical stem cell niche. PNAS. 2016;113:E8238-E8246.

    Not in our library10.1073/pnas.1616768113

  71. 71.

    Wolf S, Pape C, Bailoni A, Rahaman N, Kreshuk A, Kothe U, Hamprecht F. The Mutex Watershed: Efficient, Parameter-Free Image Partitioning. 2018;546-562.

    Not in our library

  72. 72.

    Wolny A. GitHub. 2020a.

    Not in our library

  73. 73.

    Wolny A. GitHub. 2020b.

    Not in our library

  74. 74.

    Wu Y, He K. Group normalization. arXiv. 2018.

    Not in our library

  75. 75.

    Xie S, Tu Z. Holistically-nested edge detection. arXiv. 2015.

    Not in our library

Cited by papers we hold 4

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.