KEYWORDS: Image segmentation, 3D image processing, Image processing algorithms and systems, Visualization, Detection and tracking algorithms, Video, 3D modeling, Data modeling, Computer simulations, Error analysis
Understanding the behavior of cells is an important problem for biologists. Significant research has been done to facilitate this by automating the segmentation of microscopic cellular images. Bright-field images of cells prove to be particularly difficult to segment, due to features such as low contrast, missing boundaries, and broken halos. We present two algorithms for automated segmentation of cellular images. These algorithms are based on a graph-partitioning approach, where each pixel is modeled as a node of a weighted graph. The method combines an effective region force with the Laplacian and total variation boundary forces, respectively, to give the two models. This region force can be interpreted as a conditional probability of a pixel belonging to a certain class (cell or background) given a small set of already labeled pixels. For practicality, we use a small set of only background pixels from the border of cell images as the labeled set. Both algorithms are tested on bright-field images to give good results. Due to faster performance, the Laplacian-based algorithm is also tested on a variety of other datasets, including fluorescent images, phase-contrast images, and 2-D and 3-D simulated images. The results show that the algorithm performs well and consistently across a range of various cell image features, such as the cell shape, size, contrast, and noise levels.
KEYWORDS: Image segmentation, Image processing algorithms and systems, 3D image processing, Detection and tracking algorithms, Image processing, Medical image processing
Understanding the behaviour of cells is an important problem for biologists. Significant research has been done to facilitate this by automating the segmentation of microscopic cellular images. Bright-field images of cells prove to be particularly difficult to segment due to features such as low contrast, missing boundaries and broken halos. In this paper, we present two algorithms for automated segmentation of cellular images. These algorithms are based on a graph-partitioning approach where each pixel is modelled as a node of a weighted graph. The method combines an effective Region Force with the Laplacian and the Total Variation boundary forces, respectively, to give the two models. This region force can be interpreted as a conditional probability of a pixel belonging to a certain class (cell or background) given a small set of already labelled pixels. For practicality, we use a small set of only background pixels from the border of cell images as the labelled set. Both algorithms are tested on bright-field images to give good results. Due to faster performance, the Laplacian-based algorithm is also tested on a variety of other datasets including fluorescent images, phase-contrast images and 2- and 3-D simulated images. The results show that the algorithm performs well and consistently across a range of various cell image features such as the cell shape, size, contrast and noise levels.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.