2 research outputs found

    3D time series analysis of cell shape using Laplacian approaches

    Get PDF
    Background: Fundamental cellular processes such as cell movement, division or food uptake critically depend on cells being able to change shape. Fast acquisition of three-dimensional image time series has now become possible, but we lack efficient tools for analysing shape deformations in order to understand the real three-dimensional nature of shape changes. Results: We present a framework for 3D+time cell shape analysis. The main contribution is three-fold: First, we develop a fast, automatic random walker method for cell segmentation. Second, a novel topology fixing method is proposed to fix segmented binary volumes without spherical topology. Third, we show that algorithms used for each individual step of the analysis pipeline (cell segmentation, topology fixing, spherical parameterization, and shape representation) are closely related to the Laplacian operator. The framework is applied to the shape analysis of neutrophil cells. Conclusions: The method we propose for cell segmentation is faster than the traditional random walker method or the level set method, and performs better on 3D time-series of neutrophil cells, which are comparatively noisy as stacks have to be acquired fast enough to account for cell motion. Our method for topology fixing outperforms the tools provided by SPHARM-MAT and SPHARM-PDM in terms of their successful fixing rates. The different tasks in the presented pipeline for 3D+time shape analysis of cells can be solved using Laplacian approaches, opening the possibility of eventually combining individual steps in order to speed up computations

    Fast random walker for neutrophil cell segmentation in 3D

    No full text
    The random walker method [1] has many nice characteristics for 3D image segmentation. However, it is computational expensive and slow due to a massive linear system to be solved. In this work, we take advantage of the probabilistic output from the random walker method applied to a small downsampled image. By using the original image and seeds information, a novel edge-preserving method is introduced to upsample the probability, which is used for final segmentation. The running time is significantly reduced, taking less than one second to segment a 180Γ—283Γ—12 image stack on a normal laptop. Furthermore, the proposed method performs better when dealing with noisy boundaries than the original random walker method and the level set method
    corecore