A deep learning-based toolkit for 3D nuclei segmentation and quantitative analysis in cellular and tissue context.

We present a new set of computational tools that enable accurate and widely applicable 3D segmentation of nuclei in various 3D digital organs. We have developed an approach for ground truth generation and iterative training of 3D nuclear segmentation models, which we applied to popular CellPose, PlantSeg and StarDist algorithms. We provide two high-quality models trained on plant nuclei that enable 3D segmentation of nuclei in datasets obtained from fixed or live samples, acquired from different plant and animal tissues, and stained with various nuclear stains or fluorescent protein-based nuclear reporters. We also share a diverse high-quality training dataset of about 10,000 nuclei. Furthermore, we advanced the MorphoGraphX analysis and visualization software by, among other things, providing a method for linking 3D segmented nuclei to their surrounding cells in 3D digital organs. We found that the nuclear-to-cell volume ratio varies between different ovule tissues and during the development of a tissue. Finally, we extended the PlantSeg 3D segmentation pipeline with a proofreading tool that uses 3D segmented nuclei as seeds to correct cell segmentation errors in difficult-to-segment tissues.

Visualizing hierarchies in scRNA-seq data using a density tree-biased autoencoder.

MOTIVATION: Single-cell RNA sequencing (scRNA-seq) allows studying the development of cells in unprecedented detail. Given that many cellular differentiation processes are hierarchical, their scRNA-seq data are expected to be approximately tree-shaped in gene expression space. Inference and representation of this tree structure in two dimensions is highly desirable for biological interpretation and exploratory analysis. RESULTS: Our two contributions are an approach for identifying a meaningful tree structure from high-dimensional scRNA-seq data, and a visualization method respecting the tree structure. We extract the tree structure by means of a density-based maximum spanning tree on a vector quantization of the data and show that it captures biological information well. We then introduce density-tree biased autoencoder (DTAE), a tree-biased autoencoder that emphasizes the tree structure of the data in low dimensional space. We compare to other dimension reduction methods and demonstrate the success of our method both qualitatively and quantitatively on real and toy data. AVAILABILITY AND IMPLEMENTATION: Our implementation relying on PyTorch and Higra is available at github.com/hci-unihd/DTAE. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Microscopy-based assay for semi-quantitative detection of SARS-CoV-2 specific antibodies in human sera: A semi-quantitative, high throughput, microscopy-based assay expands existing approaches to measure SARS-CoV-2 specific antibody levels in human sera.

Emergence of the novel pathogenic coronavirus SARS-CoV-2 and its rapid pandemic spread presents challenges that demand immediate attention. Here, we describe the development of a semi-quantitative high-content microscopy-based assay for detection of three major classes (IgG, IgA, and IgM) of SARS-CoV-2 specific antibodies in human samples. The possibility to detect antibodies against the entire viral proteome together with a robust semi-automated image analysis workflow resulted in specific, sensitive and unbiased assay that complements the portfolio of SARS-CoV-2 serological assays. Sensitive, specific and quantitative serological assays are urgently needed for a better understanding of humoral immune response against the virus as a basis for developing public health strategies to control viral spread. The procedure described here has been used for clinical studies and provides a general framework for the application of quantitative high-throughput microscopy to rapidly develop serological assays for emerging virus infections.

ilastik: interactive machine learning for (bio)image analysis.

We present ilastik, an easy-to-use interactive tool that brings machine-learning-based (bio)image analysis to end users without substantial computational expertise. It contains pre-defined workflows for image segmentation, object classification, counting and tracking. Users adapt the workflows to the problem at hand by interactively providing sparse training annotations for a nonlinear classifier. ilastik can process data in up to five dimensions (3D, time and number of channels). Its computational back end runs operations on-demand wherever possible, allowing for interactive prediction on data larger than RAM. Once the classifiers are trained, ilastik workflows can be applied to new data from the command line without further user interaction. We describe all ilastik workflows in detail, including three case studies and a discussion on the expected performance.

Integration of Cell Growth and Asymmetric Division during Lateral Root Initiation in Arabidopsis thaliana.

Lateral root formation determines to a large extent the ability of plants to forage their environment and thus their growth. In Arabidopsis thaliana and other angiosperms, lateral root initiation requires radial cell expansion and several rounds of anticlinal cell divisions that give rise to a central core of small cells, which express different markers than the larger surrounding cells. These small central cells then switch their plane of divisions to periclinal and give rise to seemingly morphologically similar daughter cells that have different identities and establish the different cell types of the new root. Although the execution of these anticlinal and periclinal divisions is tightly regulated and essential for the correct development of the lateral root, we know little about their geometrical features. Here, we generate a four-dimensional reconstruction of the first stages of lateral root formation and analyze the geometric features of the anticlinal and periclinal divisions. We identify that the periclinal divisions of the small central cells are morphologically dissimilar and asymmetric. We show that mother cell volume is different when looking at anticlinal vs. periclinal divisions and the repeated anticlinal divisions do not lead to reduction in cell volume, although cells are shorter. Finally, we show that cells undergoing a periclinal division are characterized by a strong cell expansion. Our results indicate that cells integrate growth and division to precisely partition their volume upon division during the first two stages of lateral root formation.

An objective comparison of cell-tracking algorithms.

We present a combined report on the results of three editions of the Cell Tracking Challenge, an ongoing initiative aimed at promoting the development and objective evaluation of cell segmentation and tracking algorithms. With 21 participating algorithms and a data repository consisting of 13 data sets from various microscopy modalities, the challenge displays today's state-of-the-art methodology in the field. We analyzed the challenge results using performance measures for segmentation and tracking that rank all participating methods. We also analyzed the performance of all of the algorithms in terms of biological measures and practical usability. Although some methods scored high in all technical aspects, none obtained fully correct solutions. We found that methods that either take prior information into account using learning strategies or analyze cells in a global spatiotemporal video context performed better than other methods under the segmentation and tracking scenarios included in the challenge.

DiversePathsJ: diverse shortest paths for bioimage analysis.

Motivation: We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. Results: The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. Availability and implementation: http://bigwww.epfl.ch/algorithms/diversepathsj. Contact: michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary information: Supplementary data are available at Bioinformatics online.

Graphical model for joint segmentation and tracking of multiple dividing cells.

MOTIVATION: To gain fundamental insight into the development of embryos, biologists seek to understand the fate of each and every embryonic cell. For the generation of cell tracks in embryogenesis, so-called tracking-by-assignment methods are flexible approaches. However, as every two-stage approach, they suffer from irrevocable errors propagated from the first stage to the second stage, here from segmentation to tracking. It is therefore desirable to model segmentation and tracking in a joint holistic assignment framework allowing the two stages to maximally benefit from each other. RESULTS: We propose a probabilistic graphical model, which both automatically selects the best segments from a time series of oversegmented images/volumes and links them across time. This is realized by introducing intra-frame and inter-frame constraints between conflicting segmentation and tracking hypotheses while at the same time allowing for cell division. We show the efficiency of our algorithm on a challenging 3D+t cell tracking dataset from Drosophila embryogenesis and on a 2D+t dataset of proliferating cells in a dense population with frequent overlaps. On the latter, we achieve results significantly better than state-of-the-art tracking methods. AVAILABILITY AND IMPLEMENTATION: Source code and the 3D+t Drosophila dataset along with our manual annotations will be freely available on http://hci.iwr.uni-heidelberg.de/MIP/Research/tracking/

Segmenting and Tracking Multiple Dividing Targets Using ilastik.

Tracking crowded cells or other targets in biology is often a challenging task due to poor signal-to-noise ratio, mutual occlusion, large displacements, little discernibility, and the ability of cells to divide. We here present an open source implementation of conservation tracking (Schiegg et al., IEEE international conference on computer vision (ICCV). IEEE, New York, pp 2928-2935, 2013) in the ilastik software framework. This robust tracking-by-assignment algorithm explicitly makes allowance for false positive detections, undersegmentation, and cell division. We give an overview over the underlying algorithm and parameters, and explain the use for a light sheet microscopy sequence of a Drosophila embryo. Equipped with this knowledge, users will be able to track targets of interest in their own data.

SimpleSTORM: a fast, self-calibrating reconstruction algorithm for localization microscopy.

Although there are many reconstruction algorithms for localization microscopy, their use is hampered by the difficulty to adjust a possibly large number of parameters correctly. We propose SimpleSTORM, an algorithm that determines appropriate parameter settings directly from the data in an initial self-calibration phase. The algorithm is based on a carefully designed yet simple model of the image acquisition process which allows us to standardize each image such that the background has zero mean and unit variance. This standardization makes it possible to detect spots by a true statistical test (instead of hand-tuned thresholds) and to de-noise the images with an efficient matched filter. By reducing the strength of the matched filter, SimpleSTORM also performs reasonably on data with high-spot density, trading off localization accuracy for improved detection performance. Extensive validation experiments on the ISBI Localization Challenge Dataset, as well as real image reconstructions, demonstrate the good performance of our algorithm.

Overcoming species boundaries in peptide identification with Bayesian information criterion-driven error-tolerant peptide search (BICEPS).

Currently, the reliable identification of peptides and proteins is only feasible when thoroughly annotated sequence databases are available. Although sequencing capacities continue to grow, many organisms remain without reliable, fully annotated reference genomes required for proteomic analyses. Standard database search algorithms fail to identify peptides that are not exactly contained in a protein database. De novo searches are generally hindered by their restricted reliability, and current error-tolerant search strategies are limited by global, heuristic tradeoffs between database and spectral information. We propose a Bayesian information criterion-driven error-tolerant peptide search (BICEPS) and offer an open source implementation based on this statistical criterion to automatically balance the information of each single spectrum and the database, while limiting the run time. We show that BICEPS performs as well as current database search algorithms when such algorithms are applied to sequenced organisms, whereas BICEPS only uses a remotely related organism database. For instance, we use a chicken instead of a human database corresponding to an evolutionary distance of more than 300 million years (International Chicken Genome Sequencing Consortium (2004) Sequence and comparative analysis of the chicken genome provide unique perspectives on vertebrate evolution. Nature 432, 695-716). We demonstrate the successful application to cross-species proteomics with a 33% increase in the number of identified proteins for a filarial nematode sample of Litomosoides sigmodontis.

Visualizing single-cell data with the neighbor embedding spectrum.

The two-dimensional embedding methods t-SNE and UMAP are ubiquitously used for visualizing single-cell data. Recent theoretical research in machine learning has shown that, despite their very different formulation and implementation, t-SNE and UMAP are closely connected, and a single parameter suffices to interpolate between them. This leads to a whole spectrum of visualization methods that focus on different aspects of the data. Along the spectrum, this focus changes from representing local structures to representing continuous ones. In single-cell context, this leads to a trade-off between highlighting rare cell types or continuous variation, such as developmental trajectories. Visualizing the entire spectrum as an animation can provide a more nuanced understanding of the high-dimensional dataset than individual visualizations with either t-SNE or UMAP.

Scalable Optical Nose Realized with a Chemiresistively Modulated Light-Emitter Array.

Biological olfaction relies on a large number of receptors that function as sensors to detect gaseous molecules. It is challenging to realize artificial olfactory systems that contain similarly large numbers of sensory materials. It is shown that combinatorial materials processing with vapor deposition can be used to fabricate large arrays of distinct chemiresistive sensing materials. By combining these with light-emitting diodes, an array of chemiresistively-modulated light-emitting diodes, or ChemLEDs, that permit a simultaneous optical read-out in response to an analyte is obtained. The optical nose uses a common voltage source and ground for all sensing elements and thus eliminates the need for complex wiring of individual sensors. This optical nose contains one hundred ChemLEDs and generates unique light patterns in response to gases and their mixtures. Optical pattern recognition methods enable the quantitative prediction of the corresponding concentrations and compositions, thereby paving the way for massively parallel artificial olfactory systems. ChemLEDs open the possibility to explore demanding gas sensing applications, including in environmental, food quality monitoring, and potentially diagnostic settings.

Active learning for convenient annotation and classification of secondary ion mass spectrometry images.

Digital staining for the automated annotation of mass spectrometry imaging (MSI) data has previously been achieved using state-of-the-art classifiers such as random forests or support vector machines (SVMs). However, the training of such classifiers requires an expert to label exemplary data in advance. This process is time-consuming and hence costly, especially if the tissue is heterogeneous. In theory, it may be sufficient to only label a few highly representative pixels of an MS image, but it is not known a priori which pixels to select. This motivates active learning strategies in which the algorithm itself queries the expert by automatically suggesting promising candidate pixels of an MS image for labeling. Given a suitable querying strategy, the number of required training labels can be significantly reduced while maintaining classification accuracy. In this work, we propose active learning for convenient annotation of MSI data. We generalize a recently proposed active learning method to the multiclass case and combine it with the random forest classifier. Its superior performance over random sampling is demonstrated on secondary ion mass spectrometry data, making it an interesting approach for the classification of MS images.

SIMA: simultaneous multiple alignment of LC/MS peak lists.

MOTIVATION: Alignment of multiple liquid chromatography/mass spectrometry (LC/MS) experiments is a necessity today, which arises from the need for biological and technical repeats. Due to limits in sampling frequency and poor reproducibility of retention times, current LC systems suffer from missing observations and non-linear distortions of the retention times across runs. Existing approaches for peak correspondence estimation focus almost exclusively on solving the pairwise alignment problem, yielding straightforward but suboptimal results for multiple alignment problems. RESULTS: We propose SIMA, a novel automated procedure for alignment of peak lists from multiple LC/MS runs. SIMA combines hierarchical pairwise correspondence estimation with simultaneous alignment and global retention time correction. It employs a tailored multidimensional kernel function and a procedure based on maximum likelihood estimation to find the retention time distortion function that best fits the observed data. SIMA does not require a dedicated reference spectrum, is robust with regard to outliers, needs only two intuitive parameters and naturally incorporates incomplete correspondence information. In a comparison with seven alternative methods on four different datasets, we show that SIMA yields competitive and superior performance on real-world data. AVAILABILITY: A C++ implementation of the SIMA algorithm is available from http://hci.iwr.uni-heidelberg.de/MIP/Software.

Using spatial prior knowledge in the spectral fitting of MRS images.

We propose a Bayesian smoothness prior in the spectral fitting of MRS images which can be used in addition to commonly employed prior knowledge. By combining a frequency-domain model for the free induction decay with a Gaussian Markov random field prior, a new optimization objective is derived that encourages smooth parameter maps. Using a particular parameterization of the prior, smooth damping, frequency and phase maps can be obtained whilst preserving sharp spatial features in the amplitude map. A Monte Carlo study based on two sets of simulated data demonstrates that the variance of the estimated parameter maps can be reduced considerably, even below the Cramér-Rao lower bound, when using spatial prior knowledge. Long-TE (1)H MRSI at 1.5 T of a patient with a brain tumor shows that the use of the spatial prior resolves the overlapping peaks of choline and creatine when a single voxel method fails to do so. Improved and detailed metabolic maps can be derived from high-spatial-resolution, short-TE (1)H MRSI at 3 T. Finally, the evaluation of four series of long-TE brain MRSI data with various signal-to-noise ratios shows the general benefit of the proposed approach.

Visualizing a homogeneous blend in bulk heterojunction polymer solar cells by analytical electron microscopy.

To increase efficiency of bulk heterojunctions for photovoltaic devices, the functional morphology of active layers has to be understood, requiring visualization and discrimination of materials with very similar characteristics. Here we combine high-resolution spectroscopic imaging using an analytical transmission electron microscope with nonlinear multivariate statistical analysis for classification of multispectral image data. We obtain a visual representation showing homogeneous phases of donor and acceptor, connected by a third composite phase, depending in its extent on the way the heterojunction is fabricated. For the first time we can correlate variations in nanoscale morphology determined by material contrast with measured solar cell efficiency. In particular we visualize a homogeneously blended phase, previously discussed to diminish charge separation in solar cell devices.

Seipin forms a flexible cage at lipid droplet formation sites.

Lipid droplets (LDs) form in the endoplasmic reticulum by phase separation of neutral lipids. This process is facilitated by the seipin protein complex, which consists of a ring of seipin monomers, with a yet unclear function. Here, we report a structure of S. cerevisiae seipin based on cryogenic-electron microscopy and structural modeling data. Seipin forms a decameric, cage-like structure with the lumenal domains forming a stable ring at the cage floor and transmembrane segments forming the cage sides and top. The transmembrane segments interact with adjacent monomers in two distinct, alternating conformations. These conformations result from changes in switch regions, located between the lumenal domains and the transmembrane segments, that are required for seipin function. Our data indicate a model for LD formation in which a closed seipin cage enables triacylglycerol phase separation and subsequently switches to an open conformation to allow LD growth and budding.

Temporal control of the integrated stress response by a stochastic molecular switch.

Stress granules (SGs) are formed in the cytosol as an acute response to environmental cues and activation of the integrated stress response (ISR), a central signaling pathway controlling protein synthesis. Using chronic virus infection as stress model, we previously uncovered a unique temporal control of the ISR resulting in recurrent phases of SG assembly and disassembly. Here, we elucidate the molecular network generating this fluctuating stress response by integrating quantitative experiments with mathematical modeling and find that the ISR operates as a stochastic switch. Key elements controlling this switch are the cooperative activation of the stress-sensing kinase PKR, the ultrasensitive response of SG formation to the phosphorylation of the translation initiation factor eIF2α, and negative feedback via GADD34, a stress-induced subunit of protein phosphatase 1. We identify GADD34 messenger RNA levels as the molecular memory of the ISR that plays a central role in cell adaptation to acute and chronic stress.