Bright-field cell image segmentation by principal component pursuit with an Ncut penalization

Segmentation of cells in time-lapse bright-field microscopic images is crucial in understanding cell behaviours for oncological research. However, the complex nature of the cells makes it difficult to segment cells accurately. Furthermore, poor contrast, broken cell boundaries and the halo artifact pose additional challenges to this problem. Standard segmentation techniques such as edged-based methods, watershed, or active contours result in poor segmentation. Other existing methods for bright-field images cannot provide good results without localized segmentation steps. In this paper, we present two robust mathematical models to segment bright-field cells automatically for the entire image. These models treat cell image segmentation as a background subtraction problem, which can be formulated as a Principal Component Pursuit (PCP) problem. Our first segmentation model is formulated as a PCP with nonnegative constraints. We exploit the sparse component of the PCP solution for identifying the cell pixels. However, there is no control on the quality of the sparse component and the nonzero entries can scatter all over the image, resulting in a noisy segmentation. The second model is an improvement of the first model by combining PCP with spectral clustering. Seemingly unrelated approaches, we combine the two techniques by incorporating normalized-cut in the PCP as a measure for the quality of the segmentation. These two models have been applied to a set of C2C12 cells obtained from bright-field microscopy. Experimental results demonstrate that the proposed models are effective in segmenting cells from bright-field images.

[1]  Cédric Févotte,et al.  Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[2]  Justin W. L. Wan,et al.  A combined watershed and level set method for segmentation of brightfield cell images , 2009, Medical Imaging.

[3]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[4]  David Wertheim,et al.  Segmentation of microscope images of living cells , 2007, Pattern Analysis and Applications.

[5]  Justin W.L. Wan,et al.  A spectral k-means approach to bright-field cell image segmentation , 2010, 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology.

[6]  Xiaohui Xie,et al.  Split Bregman method for large scale fused Lasso , 2010, Comput. Stat. Data Anal..

[7]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[9]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[10]  Justin W. L. Wan,et al.  A multiscale graph cut approach to bright-field multiple cell image segmentation using a Bhattacharyya measure , 2013, Medical Imaging.

[11]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[12]  Xiaohui Xie,et al.  Efficient variable selection in support vector machines via the alternating direction method of multipliers , 2011, AISTATS.

[13]  W. Gander Least squares with a quadratic constraint , 1980 .

[14]  D. Okada,et al.  Digital Image Processing for Medical Applications , 2009 .

[15]  Wiro J. Niessen,et al.  Advanced Level-Set-Based Cell Tracking in Time-Lapse Fluorescence Microscopy , 2010, IEEE Transactions on Medical Imaging.

[16]  Hyunsoo Kim,et al.  Sparse Non-negative Matrix Factorizations via Alternating Non-negativity-constrained Least Squares , 2006 .

[17]  Jianbo Shi,et al.  Balanced Graph Matching , 2006, NIPS.

[18]  Rongjie Lai,et al.  A Splitting Method for Orthogonality Constrained Problems , 2014, J. Sci. Comput..