Graphical methods for quantifying macromolecules through bright field imaging

Bright field imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to fibroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quantified by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of sample preparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method: (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions and (iv) has a superior computing performance. contact: hchang@lbl.gov

[1]  C. Tomasi Estimating Gaussian Mixture Densities with EM – A Tutorial , 2004 .

[2]  Qing Yang,et al.  Harmonic cut and regularized centroid transform for localization of subcellular structures , 2003, IEEE Transactions on Biomedical Engineering.

[3]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Yuan Gao,et al.  Improving molecular cancer class discovery through sparse non-negative matrix factorization , 2005 .

[5]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[6]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[7]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[8]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  George Nikiforidis,et al.  A novel spectral microscope system: application in quantitative pathology , 2003, IEEE Transactions on Biomedical Engineering.

[10]  Sen-Ren Jan,et al.  Primitive spatial relations based on SKIZ , 2000, Image Vis. Comput..

[11]  Serge J. Belongie,et al.  Unsupervised Color Decomposition Of Histologically Stained Tissue Samples , 2003, NIPS.

[12]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[13]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.