Model-based segmentation of nuclei

Abstract A new approach for the segmentation of nuclei observed with an epi-fluorescence microscope is presented. The proposed technique is model based and uses local feature activities in the form of step-edge segments, roof-edge segments, and concave corners to construct a set of initial hypotheses. These local feature activities are extracted using either local or global operators and corresponding hypotheses are expressed as hyperquadrics. A neighborhood function is defined over these features to initiate the grouping process. The search space is expressed as an assignment matrix with an appropriate cost function to ensure local and neighborhood consistency. Each possible configuration of nucleus defines a path and the path with least overall error is selected for final segmentation. The system is interactive to allow rapid localization of large numbers of nuclei. The operator then eliminates a small number of false alarms and errors in the segmentation process.

[1]  Liang Ji,et al.  Intelligent splitting in the chromosome domain , 1989, Pattern Recognit..

[2]  Sim Heng Ong,et al.  Clump splitting through concavity analysis , 1994, Pattern Recognit. Lett..

[3]  Hugues Talbot,et al.  Binary image segmentation using weighted skeletons , 1992, Optics & Photonics.

[4]  Wei Xing Wang,et al.  Binary Image Segmentation Of Aggregates Based On Polygonal Approximation And Classification Of Concavities , 1998, Pattern Recognit..

[5]  Nicholas Ayache,et al.  From voxel to intrinsic surface features , 1992, Image Vis. Comput..

[6]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[7]  Philippe Saint-Marc,et al.  Adaptive Smoothing: A General Tool for Early Vision , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  B. A. Parvin,et al.  Tracking of Tubular Molecules for Scientific Applications , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Alexis Gourdon,et al.  The 3D Marching Lines Algorithm , 1996, CVGIP Graph. Model. Image Process..

[10]  Olivier Faugeras,et al.  From partial derivatives of 3D volumic images to ridge lines , 1992, Computer Vision and Pattern Recognition.

[11]  D. Struik Lectures on classical differential geometry , 1951 .

[12]  William H. Press,et al.  Numerical recipes in C , 2002 .

[13]  Andrew J. Hanson,et al.  Hyperquadrics: Smoothly deformable shapes with convex polyhedral bounds , 1988, Comput. Vis. Graph. Image Process..

[14]  Song Han,et al.  On Recovering Hyperquadrics from Range Data , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Sim Heng Ong,et al.  Decomposition of digital clumps into convex parts by contour tracing and labelling , 1992, Pattern Recognit. Lett..

[16]  Song Han,et al.  Using hyperquadrics for shape recovery from range data , 1993, ICCV.

[17]  Jia-Guu Leu,et al.  Detecting the dislocations in metal crystals from microscopic images , 1990, Pattern Recognit..