A wavelet-based modification of the Markov random field (WMRF) model is proposed for segmenting complementary DNA (cDNA) microarray images. For evaluation purposes, five simulated and a set of five real microarray images were used. The one-level stationary wavelet transform (SWT) of each microarray image was used to form two images, a denoised image, using hard thresholding filter, and a magnitude image, from the amplitudes of the horizontal and vertical components of SWT. Elements from these two images were suitably combined to form the WMRF model for segmenting spots from their background. The WMRF was compared against the conventional MRF and the Fuzzy C means (FCM) algorithms on simulated and real microarray images and their performances were evaluated by means of the segmentation matching factor (SMF) and the coefficient of determination (r2). Additionally, the WMRF was compared against the SPOT and SCANALYZE, and performances were evaluated by the mean absolute error (MAE) and the coefficient of variation (CV). The WMRF performed more accurately than the MRF and FCM (SMF: 92.66, 92.15, and 89.22, r2 : 0.92, 0.90, and 0.84, respectively) and achieved higher reproducibility than the MRF, SPOT, and SCANALYZE (MAE: 497, 1215, 1180, and 503, CV: 0.88, 1.15, 0.93, and 0.90, respectively).

The objective of this paper was to investigate the segmentation ability of the fuzzy Gaussian mixture model (FGMM) clustering algorithm, applied on complementary DNA (cDNA) images. Following a standard established procedure, a simulated microarray image of 1600 cells, each containing one spot, was produced. For further evaluation of the algorithm, three real microarray images were also used, each containing 6400 spots. For the task of locating spot borders and surrounding background (BG) in each cell, an automatic gridding process was developed and applied on microarray images. The FGMM and the Gaussian mixture model (GMM) algorithms were applied to each cell with the purpose of discriminating foreground (FG) from BG. The segmentation abilities of both algorithms were evaluated by means of the segmentation matching factor, coefficient of determination, and concordance correlation, in respect to the actual classes (FG-BG pixels) of the simulated spots. Pairwise correlation and mean absolute error of the real images among replicates were also calculated. The FGMM was found to perform better and with equal processing time, as compared to the GMM, rendering the FGMM algorithm an efficient alternative for segmenting cDNA microarray images.

MOTIVATION: One of the major factors that complicate the task of microarray image analysis is that microarray images are distorted by various types of noise. In this study a robust framework is proposed, designed to take into account the effect of noise in microarray images in order to assist the demanding task of microarray image analysis. The proposed framework, incorporates in the microarray image processing pipeline a novel combination of spot adjustable image analysis and processing techniques and consists of the following stages: (1) gridding for facilitating spot identification, (2) clustering (unsupervised discrimination between spot and background pixels) applied to spot image for automatic local noise assessment, (3) modeling of local image restoration process for spot image conditioning (adjustable wiener restoration using an empirically determined degradation function), (4) automatic spot segmentation employing seeded-region-growing, (5) intensity extraction and (6) assessment of the reproducibility (real data) and the validity (simulated data) of the extracted gene expression levels. RESULTS: Both simulated and real microarray images were employed in order to assess the performance of the proposed framework against well-established methods implemented in publicly available software packages (Scanalyze and SPOT). Regarding simulated images, the novel combination of techniques, introduced in the proposed framework, rendered the detection of spot areas and the extraction of spot intensities more accurate. Furthermore, on real images the proposed framework proved of better stability across replicates. Results indicate that the proposed framework improves spots' segmentation and, consequently, quantification of gene expression levels. AVAILABILITY: All algorithms were implemented in Matlab (The Mathworks, Inc., Natick, MA, USA) environment. The codes that implement microarray gridding, adaptive spot restoration and segmentation/intensity extraction are available upon request. Supplementary results and the simulated microarray images used in this study are available for download from: ftp://users:[email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

In this paper, the challenging problem of robust mean-signal estimation of a single-step microparticle bioaffinity assay is investigated. For this purpose, a density estimation-based robust algorithm (DER) was developed. The DER algorithm was comparatively evaluated with four other parameter estimation methods (mean value, median filtering, least square estimation, Welsch robust m-estimator). Two important questions were raised and investigated: 1) Which of the five methods can robustly estimate the mean bioaffinity signal? and 2) How many microparticles need to be measured in order to obtain an accurate estimate of the mean signal value? To answer the questions, bootstrap and coefficient of variation (CV) analyses were performed. In the CV analysis, the DER algorithm gave the best results: The CV ranged from 0.8% to 4.9% when the number of microparticles used for the mean signal estimation varied from 800 to 30. In the bootstrap analysis of the standard error, the DER algorithm had the smallest variance. As a conclusion, it can be underlined that: 1) of all methods tested, the DER algorithm gave the most consistent and reproducible results according to the bootstrap and CV analysis; 2) using the DER algorithm accurate estimates could be calculated based on 80-100 particles, corresponding to a typical assay measurement time of 1 min; and 3) the investigated bioaffinity signals contained a large number of outliers (observations that severely deviate from the majority of data) and therefore robust techniques were necessary for the mean signal estimation tasks.

A computer-aided diagnosis system was developed for assisting brain astrocytomas malignancy grading. Microscopy images from 140 astrocytic biopsies were digitized and cell nuclei were automatically segmented using a Probabilistic Neural Network pixel-based clustering algorithm. A decision tree classification scheme was constructed to discriminate low, intermediate and high-grade tumours by analyzing nuclear features extracted from segmented nuclei with a Support Vector Machine classifier. Nuclei were segmented with an average accuracy of 86.5%. Low, intermediate, and high-grade tumours were identified with 95%, 88.3%, and 91% accuracies respectively. The proposed algorithm could be used as a second opinion tool for the histopathologists.