Relaxation Labeling for Cell Phase Identification

Gaussian mixture model (GMM) is used in cell phase identification to model the distribution of cell feature vectors. The model parameters, which are mean vectors, covariance matrices and mixture weights, are trained in an unsupervised learning method using the expectation maximization algorithm. Experiments have shown that the GMM is an effective method capable of achieving high identification rate. However, the GMM approach is not always effective because of ambiguity inherently existing in the cell phase data. To enhance the effectiveness of the GMM for solving this specific problem, the relaxation labeling (RL) is proposed to be used with the GMM. The RL algorithm is a parallel algorithm that updates the probabilities of cell phases by using correlation or mutual information between cell phases to reduce uncertainty among GMMs having overlapping properties.

[1]  Biing-Hwang Juang,et al.  Hidden Markov Models for Speech Recognition , 1991 .

[2]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[3]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Hong Yan,et al.  A new probabilistic relaxation method based on probability space partition , 1997, Pattern Recognit..

[5]  C. MacAulay,et al.  A comparison of some quick and simple threshold selection methods for stained cells. , 1988, Analytical and quantitative cytology and histology.

[6]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[7]  T. Mitchison,et al.  Phenotypic screening of small molecule libraries by high throughput cell imaging. , 2003, Combinatorial chemistry & high throughput screening.

[8]  Qin Chen,et al.  Ambiguity reduction by relaxation labeling , 1994, Pattern Recognit..

[9]  Eam Khwang Teoh,et al.  Relaxation labeling using augmented lagrange-hopfield method , 1998, Pattern Recognit..

[10]  Steven W. Zucker,et al.  Radial Projection: An Efficient Update Rule for Relaxation Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Shmuel Peleg,et al.  Determining Compatibility Coefficients for Curve Enhancement Relaxation Processes , 1978 .

[12]  Douglas A. Reynolds,et al.  Speaker identification and verification using Gaussian mixture speaker models , 1995, Speech Commun..

[13]  Yasushi Hiraoka,et al.  Fluorescence imaging of mammalian living cells , 1996, Chromosome Research.

[14]  D. Murphy Fundamentals of Light Microscopy and Electronic Imaging , 2001 .

[15]  J. Y. S. Luh,et al.  Relaxation labeling algorithm for information integration and its convergence , 1995, Pattern Recognit..

[16]  Michael Wagner,et al.  Ambiguity reduction in speaker identification by the relaxation labeling process , 1999, Pattern Recognit..

[17]  Xinhua Zhuang,et al.  A Simplex-Like Algorithm for the Relaxation Labeling Process , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  T. Kanda,et al.  Histone–GFP fusion protein enables sensitive analysis of chromosome dynamics in living mammalian cells , 1998, Current Biology.

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

[20]  Xiaobo Zhou,et al.  Automated segmentation, classification, and tracking of cancer cell nuclei in time-lapse microscopy , 2006, IEEE Transactions on Biomedical Engineering.

[21]  Bidyut Baran Chaudhuri,et al.  An efficient method based on watershed and rule-based merging for segmentation of 3-D histo-pathological images , 2001, Pattern Recognit..

[22]  Stephen T. C. Wong,et al.  TIME-LAPSE CELL CYCLE QUANTITATIVE DATA ANALYSIS USING GAUSSIAN MIXTURE MODELS , 2006 .

[23]  R. Ladner Entropy-constrained Vector Quantization , 2000 .

[24]  Lionel Pelkowitz,et al.  A continuous relaxation labeling algorithm for Markov random fields , 1990, IEEE Trans. Syst. Man Cybern..

[25]  L. Joshua Leon,et al.  Watershed-Based Segmentation and Region Merging , 2000, Comput. Vis. Image Underst..