A Two-Phase Segmentation of Cell Nuclei Using Fast Level Set-Like Algorithms

An accurate localization of a cell nucleus boundary is inevitable for any further quantitative analysis of various subnuclear structures within the cell nucleus. In this paper, we present a novel approach to the cell nucleus segmentation in fluorescence microscope images exploiting the level set framework. The proposed method works in two phases. In the first phase, the image foreground is separated from the background using a fast level set-like algorithm by Nilsson and Heyden [1]. A binary mask of isolated cell nuclei as well as their clusters is obtained as a result of the first phase. A fast topology-preserving level set-like algorithm by Maska and Matula [2] is applied in the second phase to delineate individual cell nuclei within the clusters. The potential of the new method is demonstrated on images of DAPI-stained nuclei of a lung cancer cell line A549 and promyelocytic leukemia cell line HL60.

[1]  Thomas Boudier,et al.  Smart 3D‐fish: Automation of distance analysis in nuclei of interphase cells by image processing , 2005, Cytometry. Part A : the journal of the International Society for Analytical Cytology.

[2]  Wolfgang Effelsberg,et al.  Fast Implicit Active Contour Models , 2002, DAGM-Symposium.

[3]  Anders Heyden,et al.  A fast algorithm for level set-like active contours , 2003, Pattern Recognit. Lett..

[4]  Roman Goldenberg,et al.  Fast Geodesic Active Contours , 1999, Scale-Space.

[5]  H. Netten,et al.  FISH and chips: automation of fluorescent dot counting in interphase cell nuclei. , 1997, Cytometry.

[6]  H. Netten,et al.  Fluorescent dot counting in interphase cell nuclei , 1996 .

[7]  R. Malladi,et al.  Segmentation of nuclei and cells using membrane related protein markers , 2001, Journal of microscopy.

[8]  D. Chopp.  Computing Minimal Surfaces via Level Set Curvature Flow , 1993 .

[9]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[11]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[12]  Jiangwen Deng,et al.  A fast level set method for segmentation of low contrast noisy biomedical images , 2002, Pattern Recognit. Lett..

[13]  C Wählby,et al.  Combining intensity, edge and shape information for 2D and 3D segmentation of cell nuclei in tissue sections , 2004, Journal of microscopy.

[14]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[15]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[16]  Pavel Matula,et al.  A Fast Level Set-Like Algorithm with Topology Preserving Constraint , 2009, CAIP.

[17]  W. Clem Karl,et al.  A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution , 2008, IEEE Transactions on Image Processing.

[18]  Ross T. Whitaker,et al.  A Level-Set Approach to 3D Reconstruction from Range Data , 1998, International Journal of Computer Vision.

[19]  J J Vaquero,et al.  Applying watershed algorithms to the segmentation of clustered nuclei. , 1998, Cytometry.