Automatic analysis of DNA microarray images using mathematical morphology

MOTIVATION: DNA microarrays are an experimental technology which consists in arrays of thousands of discrete DNA sequences that are printed on glass microscope slides. Image analysis is an important aspect of microarray experiments. The aim of this step is to reduce an image of spots into a table with a measure of the intensity for each spot. Efficient, accurate and automatic analysis of DNA spot images is essential in order to use this technology in laboratory routines. RESULTS: We present an automatic non-supervised set of algorithms for a fast and accurate spot data extraction from DNA microarrays using morphological operators which are robust to both intensity variation and artefacts. The approach can be summarised as follows. Initially, a gridding algorithm yields the automatic segmentation of the microarray image into spot quadrants which are later individually analysed. Then the analysis of the spot quadrant images is achieved in five steps. First, a pre-quantification, the spot size distribution law is calculated. Second, the background noise extraction is performed using a morphological filtering by area. Third, an orthogonal grid provides the first approach to the spot locus. Fourth, the spot segmentation or spot boundaries definition is carried out using the watershed transformation. And fifth, the outline of detected spots allows the signal quantification or spot intensities extraction; in this respect, a noise model has been investigated. The performance of the algorithm has been compared with two packages: ScanAlyze and Genepix, showing its robustness and precision.     

Segmentation and intensity estimation of microarray images using a gamma-t mixture model

MOTIVATION: We present a new approach to the analysis of images for complementary DNA microarray experiments. The image segmentation and intensity estimation are performed simultaneously by adopting a two-component mixture model. One component of this mixture corresponds to the distribution of the background intensity, while the other corresponds to the distribution of the foreground intensity. The intensity measurement is a bivariate vector consisting of red and green intensities. The background intensity component is modeled by the bivariate gamma distribution, whose marginal densities for the red and green intensities are independent three-parameter gamma distributions with different parameters. The foreground intensity component is taken to be the bivariate t distribution, with the constraint that the mean of the foreground is greater than that of the background for each of the two colors. The degrees of freedom of this t distribution are inferred from the data but they could be specified in advance to reduce the computation time. Also, the covariance matrix is not restricted to being diagonal and so it allows for nonzero correlation between R and G foreground intensities. This gamma-t mixture model is fitted by maximum likelihood via the EM algorithm. A final step is executed whereby nonparametric (kernel) smoothing is undertaken of the posterior probabilities of component membership. The main advantages of this approach are: (1) it enjoys the well-known strengths of a mixture model, namely flexibility and adaptability to the data; (2) it considers the segmentation and intensity simultaneously and not separately as in commonly used existing software, and it also works with the red and green intensities in a bivariate framework as opposed to their separate estimation via univariate methods; (3) the use of the three-parameter gamma distribution for the background red and green intensities provides a much better fit than the normal (log normal) or t distributions; (4) the use of the bivariate t distribution for the foreground intensity provides a model that is less sensitive to extreme observations; (5) as a consequence of the aforementioned properties, it allows segmentation to be undertaken for a wide range of spot shapes, including doughnut, sickle shape and artifacts. RESULTS: We apply our method for gridding, segmentation and estimation to cDNA microarray real images and artificial data. Our method provides better segmentation results in spot shapes as well as intensity estimation than Spot and spotSegmentation R language softwares. It detected blank spots as well as bright artifact for the real data, and estimated spot intensities with high-accuracy for the synthetic data. AVAILABILITY: The algorithms were implemented in Matlab. The Matlab codes implementing both the gridding and segmentation/estimation are available upon request. SUPPLEMENTARY INFORMATION: Supplementary material is available at Bioinformatics online.     

A hill-climbing approach for automatic gridding of cDNA microarray images

Image and statistical analysis are two important stages of cDNA microarrays. Of these, gridding is necessary to accurately identify the location of each spot while extracting spot intensities from the microarray images and automating this procedure permits high-throughput analysis. Due to the deficiencies of the equipment used to print the arrays, rotations, misalignments, high contamination with noise and artifacts, and the enormous amount of data generated, solving the gridding problem by means of an automatic system is not trivial. Existing techniques to solve the automatic grid segmentation problem cover only limited aspects of this challenging problem and require the user to specify the size of the spots, the number of rows and columns in the grid, and boundary conditions. In this paper, a hill-climbing automatic gridding and spot quantification technique is proposed which takes a microarray image (or a subgrid) as input and makes no assumptions about the size of the spots, rows, and columns in the grid. The proposed method is based on a hill-climbing approach that utilizes different objective functions. The method has been found to effectively detect the grids on microarray images drawn from databases from GEO and the Stanford genomic laboratories.     

Evaluating the performance of microarray segmentation algorithms

MOTIVATION: Although numerous algorithms have been developed for microarray segmentation, extensive comparisons between the algorithms have acquired far less attention. In this study, we evaluate the performance of nine microarray segmentation algorithms. Using both simulated and real microarray experiments, we overcome the challenges in performance evaluation, arising from the lack of ground-truth information. The usage of simulated experiments allows us to analyze the segmentation accuracy on a single pixel level as is commonly done in traditional image processing studies. With real experiments, we indirectly measure the segmentation performance, identify significant differences between the algorithms, and study the characteristics of the resulting gene expression data. RESULTS: Overall, our results show clear differences between the algorithms. The results demonstrate how the segmentation performance depends on the image quality, which algorithms operate on significantly different performance levels, and how the selection of a segmentation algorithm affects the identification of differentially expressed genes. AVAILABILITY: Supplementary results and the microarray images used in this study are available at the companion web site http://www.cs.tut.fi/sgn/csb/spotseg/     

A Combinational Clustering Based Method for cDNA Microarray Image Segmentation

Microarray technology plays an important role in drawing useful biological conclusions by analyzing thousands of gene expressions simultaneously. Especially, image analysis is a key step in microarray analysis and its accuracy strongly depends on segmentation. The pioneering works of clustering based segmentation have shown that k-means clustering algorithm and moving k-means clustering algorithm are two commonly used methods in microarray image processing. However, they usually face unsatisfactory results because the real microarray image contains noise, artifacts and spots that vary in size, shape and contrast. To improve the segmentation accuracy, in this article we present a combination clustering based segmentation approach that may be more reliable and able to segment spots automatically. First, this new method starts with a very simple but effective contrast enhancement operation to improve the image quality. Then, an automatic gridding based on the maximum between-class variance is applied to separate the spots into independent areas. Next, among each spot region, the moving k-means clustering is first conducted to separate the spot from background and then the k-means clustering algorithms are combined for those spots failing to obtain the entire boundary. Finally, a refinement step is used to replace the false segmentation and the inseparable ones of missing spots. In addition, quantitative comparisons between the improved method and the other four segmentation algorithms--edge detection, thresholding, k-means clustering and moving k-means clustering--are carried out on cDNA microarray images from six different data sets. Experiments on six different data sets, 1) Stanford Microarray Database (SMD), 2) Gene Expression Omnibus (GEO), 3) Baylor College of Medicine (BCM), 4) Swiss Institute of Bioinformatics (SIB), 5) Joe DeRisi’s individual tiff files (DeRisi), and 6) University of California, San Francisco (UCSF), indicate that the improved approach is more robust and sensitive to weak spots. More importantly, it can obtain higher segmentation accuracy in the presence of noise, artifacts and weakly expressed spots compared with the other four methods.     

Donuts, scratches and blanks: robust model-based segmentation of microarray images

MOTIVATION: Inner holes, artifacts and blank spots are common in microarray images, but current image analysis methods do not pay them enough attention. We propose a new robust model-based method for processing microarray images so as to estimate foreground and background intensities. The method starts with a very simple but effective automatic gridding method, and then proceeds in two steps. The first step applies model-based clustering to the distribution of pixel intensities, using the Bayesian Information Criterion (BIC) to choose the number of groups up to a maximum of three. The second step is spatial, finding the large spatially connected components in each cluster of pixels. The method thus combines the strengths of the histogram-based and spatial approaches. It deals effectively with inner holes in spots and with artifacts. It also provides a formal inferential basis for deciding when the spot is blank, namely when the BIC favors one group over two or three. RESULTS: We apply our methods for gridding and segmentation to cDNA microarray images from an HIV infection experiment. In these experiments, our method had better stability across replicates than a fixed-circle segmentation method or the seeded region growing method in the SPOT software, without introducing noticeable bias when estimating the intensities of differentially expressed genes. AVAILABILITY: spotSegmentation, an R language package implementing both the gridding and segmentation methods is available through the Bioconductor project (http://www.bioconductor.org). The segmentation method requires the contributed R package MCLUST for model-based clustering (http://cran.us.r-project.org). CONTACT: fraley@stat.washington.edu.     

Biological Image Segmentation Using Region-Scalable Fitting Energy with B-Spline Level Set Implementation and Watershed

ObjectivesImage segmentation plays an important role in the analysis and understanding of the cellular process. However, this task becomes difficult when there is intensity inhomogeneity between regions, and it is more challenging in the presence of the noise and clustered cells. The goal of the paper is propose an image segmentation framework that tackles the above cited problems.Material and methodsA new method composed of two steps is proposed: First, segment the image using B-spline level set with Region-Scalable Fitting (RSF) active contour model, second apply the Watershed algorithm based on new object markers to refine the segmentation and separate clustered cells. The major contributions of the paper are: 1) Use of a continuous formulation of the level set in the B-spline basis, 2) Develop the energy function and its derivative by introducing the RSF model to deal with intensity inhomogeneity, 3) For the Watershed, propose a relevant choice of markers that considers the cell properties.ResultsExperimental results are performed on widely used synthetic images, in addition to simulated and real biological images, without and with additive noise. They attest the high quality of segmentation of the proposed method in terms of quantitative and qualitative evaluation.ConclusionThe proposed method is able to tackle many difficulties at the same time: overlapped intensities, noise, different cell sizes and clustered cells. It provides an efficient tool for image segmentation especially biological ones.     

Segmentation of cDNA microarray spots using markov random field modeling

Motivation: Spot segmentation is a critical step in microarraygene expression data analysis. Therefore, the performance ofsegmentation may substantially affect the results of subsequentstages of the analysis, such as the detection of differentiallyexpressed genes. Several methods have been developed to segmentmicroarray spots from the surrounding background. In this study,we have proposed a new approach based on Markov random field(MRF) modeling and tested its performance on simulated and realmicroarray images against a widely used segmentation methodbased on Mann–Whitney test adopted by QuantArray software(Boston, MA). Spot addressing was performed using QuantArray.We have also devised a simulation method to generate microarrayimages with realistic features. Such images can be used as goldstandards for the purposes of testing and comparing differentsegmentation methods, and optimizing segmentation parameters. Results: Experiments on simulated and 14 actual microarray imagesets show that the proposed MRF-based segmentation method candetect spot areas and estimate spot intensities with higheraccuracy. Availability: The algorithms were implemented in Matlab^TM (TheMathworks, Inc., Natick, MA) environment. The codes for MRF-basedsegmentation and image simulation methods are available uponrequest. Contact: demirkaya{at}ieee.org     

Preprocessing of 2-Dimensional Gel Electrophoresis Images Applied to Proteomic Analysis: A Review

Various methods and specialized software programs are available for processing twodimensional gel electrophoresis(2-DGE)images.However,due to the anomalies present in these images,a reliable,automated,and highly reproducible system for 2-DGE image analysis has still not been achieved.The most common anomalies found in 2-DGE images include vertical and horizontal streaking,fuzzy spots,and background noise,which greatly complicate computational analysis.In this paper,we review the preprocessing techniques applied to 2-DGE images for noise reduction,intensity normalization,and background correction.We also present a quantitative comparison of non-linear?ltering techniques applied to synthetic gel images,through analyzing the performance of the?lters under speci?c conditions.Synthetic proteins were modeled into a two-dimensional Gaussian distribution with adjustable parameters for changing the size,intensity,and degradation.Three types of noise were added to the images:Gaussian,Rayleigh,and exponential,with signal-to-noise ratios(SNRs)ranging 8–20 decibels(d B).We compared the performanceof wavelet,contourlet,total variation(TV),and wavelet-total variation(WTTV)techniques using parameters SNR and spot ef?ciency.In terms of spot ef?ciency,contourlet and TV were more sensitive to noise than wavelet and WTTV.Wavelet worked the best for images with SNR ranging 10–20 d B,whereas WTTV performed better with high noise levels.Wavelet also presented the best performance with any level of Gaussian noise and low levels(20–14 d B)of Rayleigh and exponential noise in terms of SNR.Finally,the performance of the non-linear?ltering techniques was evaluated using a real 2-DGE image with previously identi?ed proteins marked.Wavelet achieved the best detection rate for the real image.     

Automatic Region-Based Brain Classification of MRI-T1 Data

Image segmentation of medical images is a challenging problem with several still not totally solved issues, such as noise interference and image artifacts. Region-based and histogram-based segmentation methods have been widely used in image segmentation. Problems arise when we use these methods, such as the selection of a suitable threshold value for the histogram-based method and the over-segmentation followed by the time-consuming merge processing in the region-based algorithm. To provide an efficient approach that not only produce better results, but also maintain low computational complexity, a new region dividing based technique is developed for image segmentation, which combines the advantages of both regions-based and histogram-based methods. The proposed method is applied to the challenging applications: Gray matter (GM), White matter (WM) and cerebro-spinal fluid (CSF) segmentation in brain MR Images. The method is evaluated on both simulated and real data, and compared with other segmentation techniques. The obtained results have demonstrated its improved performance and robustness.     

Largest contour segmentation: a tool for the localization of spots in confocal images

An accurate determination of the 3-D positions of multiple spots in images obtained by confocal microscopy is essential for the investigation of the spatial distribution of specific components or processes in biological specimens. The position of the centroid, as an estimator for the position of a spot, can be calculated on the basis of all voxels that belong to the domain of the spot. For this calculation a domain that defines which voxels belong to the spot must be delimited. To create a boundary for a domain we developed a 3-D image segmentation procedure: the largest contour segmentation (LCS). This procedure is based on an iterative region-growing procedure around each local maximum of intensity. By means of this procedure the position of each spot was determined accurately and automatically. Qualities of the procedure were evaluated by means of simulated test-images as well as 3-D images of real biological specimens.     

Automatic registration of microarray images. II. Hexagonal grid

MOTIVATION: In the first part of this paper the author presented an efficient, robust and completely automated algorithm for spot and block indexing in microarray images with rectangular grids. Although the rectangular grid is currently the most common type of grouping the probes on microarray slides, there is another microarray technology based on bundles of optical fibers where the probes are packed in hexagonal grids. The hexagonal grid provides both advantages and drawbacks over the standard rectangular packing and of course requires adaptation and/or modification of the algorithm of spot indexing presented in the first part of the paper. RESULTS: In the second part of the paper the author presents a version of the spot indexing algorithm adapted for microarray images with spots packed in hexagonal structures. The algorithm is completely automated, works with hexagonal grids of different types and with different parameters of grid spacing and rotation as well as spot sizes. It can successfully trace the local and global distortions of the grid, including non-orthogonal transformations. Similar to the algorithm from part I, it scales linearly with the grid size, the time complexity is O(M), where M is total number of grid points in hexagonal grid. The algorithm has been tested both on CCD and scanned images with spot expression rates as low as 2%. The processing time of an image with about 50 000 hex grid points was less than a second. For images with high expression rates ( approximately 90%) the registration time is even smaller, around a quarter of a second. Supplementary information: http://fleece.ucsd.edu/~vit/Registration_Supplement.pdf     

MASQOT-GUI: spot quality assessment for the two-channel microarray platform

MASQOT-GUI provides an open-source, platform-independent software pipeline for two-channel microarray spot quality control. This includes gridding, segmentation, quantification, quality assessment and data visualization. It hosts a set of independent applications, with interactions between the tools as well as import and export support for external software. The implementation of automated multivariate quality control assessment, which is a unique feature of MASQOT-GUI, is based on the previously documented and evaluated MASQOT methodology. Further abilities of the application are outlined and illustrated. AVAILABILITY: MASQOT-GUI is Java-based and licensed under the GNU LGPL. Source code and installation files are available for download at http://masqot-gui.sourceforge.net/     

Automatic registration of microarray images. I. Rectangular grid

MOTIVATION: The analysis of high-throughput experiment data provided by microarrays becomes increasingly more and more important part of modern biological science. Microarrays allow to conduct genotyping or gene expression experiments on hundreds of thousands of test genes in parallel. Because of the large and constantly growing amount of experimental data the necessity of efficiency, robustness and complete automation of microarray image analysis algorithms is gaining significant attention in the field of microarray processing. RESULTS: The author presents here an efficient and completely automatic image registration algorithm (that is an algorithm for spots and blocks indexing) that allows to process a wide variety of microarray slides with different parameters of grid and block spacing as well as spot sizes. The algorithm scales linearly with the grid size, the time complexity is O(M), where M is number of rows x number of columns. It can successfully cope with local and global distortions of the grid, such as focal distortions and non-orthogonal transformations. The algorithm has been tested both on CCD and scanned images and showed very good performance-the processing time of a single slide with 44 blocks of 200 x 200 grid points (or 1 760 000 grid points total) was about 10 s. AVAILABILITY: The test implementation of the algorithm will be available upon request for academics. Supplementary information: http://fleece.ucsd.edu/~vit/Registration_Supplement.pdf     

Probabilistic segmentation and intensity estimation for microarray images

We describe a probabilistic approach to simultaneous image segmentation and intensity estimation for complementary DNA microarray experiments. The approach overcomes several limitations of existing methods. In particular, it (a) uses a flexible Markov random field approach to segmentation that allows for a wider range of spot shapes than existing methods, including relatively common 'doughnut-shaped' spots; (b) models the image directly as background plus hybridization intensity, and estimates the two quantities simultaneously, avoiding the common logical error that estimates of foreground may be less than those of the corresponding background if the two are estimated separately; and (c) uses a probabilistic modeling approach to simultaneously perform segmentation and intensity estimation, and to compute spot quality measures. We describe two approaches to parameter estimation: a fast algorithm, based on the expectation-maximization and the iterated conditional modes algorithms, and a fully Bayesian framework. These approaches produce comparable results, and both appear to offer some advantages over other methods. We use an HIV experiment to compare our approach to two commercial software products: Spot and Arrayvision.     

A minimal descriptor of an ancestral recombinations graph

Background

Processing cDNA microarray images is a crucial step in gene expression analysis, since any errors in early stages affect subsequent steps, leading to possibly erroneous biological conclusions. When processing the underlying images, accurately separating the sub-grids and spots is extremely important for subsequent steps that include segmentation, quantification, normalization and clustering.

Results

We propose a parameterless and fully automatic approach that first detects the sub-grids given the entire microarray image, and then detects the locations of the spots in each sub-grid. The approach, first, detects and corrects rotations in the images by applying an affine transformation, followed by a polynomial-time optimal multi-level thresholding algorithm used to find the positions of the sub-grids in the image and the positions of the spots in each sub-grid. Additionally, a new validity index is proposed in order to find the correct number of sub-grids in the image, and the correct number of spots in each sub-grid. Moreover, a refinement procedure is used to correct possible misalignments and increase the accuracy of the method.

Conclusions

Extensive experiments on real-life microarray images and a comparison to other methods show that the proposed method performs these tasks fully automatically and with a very high degree of accuracy. Moreover, unlike previous methods, the proposed approach can be used in various type of microarray images with different resolutions and spot sizes and does not need any parameter to be adjusted.     

Microarray segmentation methods significantly influence data precision

Little consideration has been given to the effect of different segmentation methods on the variability of data derived from microarray images. Previous work has suggested that the significant source of variability from microarray image analysis is from estimation of local background. In this study, we used Analysis of Variance (ANOVA) models to investigate the effect of methods of segmentation on the precision of measurements obtained from replicate microarray experiments. We used four different methods of spot segmentation (adaptive, fixed circle, histogram and GenePix) to analyse a total number of 156 172 spots from 12 microarray experiments. Using a two-way ANOVA model and the coefficient of repeatability, we show that the method of segmentation significantly affects the precision of the microarray data. The histogram method gave the lowest variability across replicate spots compared to other methods, and had the lowest pixel-to-pixel variability within spots. This effect on precision was independent of background subtraction. We show that these findings have direct, practical implications as the variability in precision between the four methods resulted in different numbers of genes being identified as differentially expressed. Segmentation method is an important source of variability in microarray data that directly affects precision and the identification of differentially expressed genes.     

A Framework for White Blood Cell Segmentation in Microscopic Blood Images Using Digital Image Processing

Evaluation of blood smear is a commonly clinical test these days. Most of the time, the hematologists are interested on white blood cells (WBCs) only. Digital image processing techniques can help them in their analysis and diagnosis. For example, disease like acute leukemia is detected based on the amount and condition of the WBC. The main objective of this paper is to segment the WBC to its two dominant elements: nucleus and cytoplasm. The segmentation is conducted using a proposed segmentation framework that consists of an integration of several digital image processing algorithms. Twenty microscopic blood images were tested, and the proposed framework managed to obtain 92% accuracy for nucleus segmentation and 78% for cytoplasm segmentation. The results indicate that the proposed framework is able to extract the nucleus and cytoplasm region in a WBC image sample.     

Software package for automatic microarray image analysis (MAIA)

Although various software solutions are currently available for microarray image analysis, one would still expect to develop algorithms ensuring higher level of intelligence and robustness. We present a fully functional software package for automatic processing of the two-color microarray images including spot localization, quantification and quality control. The developed algorithms aim at making ratio estimates more resistant to array contamination and offer automatic tools to evaluate spot quality. Availability: A demo version of the software can be downloaded from http://bioinfo.curie.fr/projects/maia. A full version is freely available to non-commercial users upon request from the authors.