- Research article
- Open access
- Published:

# A fully automatic gridding method for cDNA microarray images

*BMC Bioinformatics*
**volumeÂ 12**, ArticleÂ number:Â 113 (2011)

## Abstract

### 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.

## Background

Microarrays are one of the most important technologies used in molecular biology to massively explore how the genes express themselves into proteins and other molecular machines responsible for the different functions in an organism. These expressions are monitored in cells and organisms under specific conditions, and have many applications in medical diagnosis, pharmacology, disease treatment, just to mention a few. We consider cDNA microarrays which are produced on a chip (slide) by hybridizing sample DNA on the slide, typically in two channels. Scanning the slides at a very high resolution produces images composed of sub-grids of spots. Image processing and analysis are two important aspects of microarrays, since the aim of the whole experimental procedure is to obtain meaningful biological conclusions, which depends on the accuracy of the different stages, mainly those at the beginning of the process. The first task in the sequence is gridding [1â€“5], which if done correctly, substantially improves the efficiency of the subsequent tasks that include segmentation [6], quantification, normalization and data mining. When producing cDNA microarrays, many parameters are specified, such as the number and size of spots, number of sub-grids, and even their exact locations. However, many physicochemical factors produce noise, misalignment, and even deformations in the sub-grid template that it is virtually impossible to know the exact location of the spots after scanning, at least with the current technology, without performing complex procedures. Roughly speaking, gridding consists of determining the spot locations in a microarray image (typically, in a sub-grid). The gridding process requires the knowledge of the sub-girds in advance in order to proceed (sub-gridding).

Many approaches have been proposed for sub-gridding and spot detection. The Markov random field (MRF) is a well known approach that applies different constraints and heuristic criteria [1, 7]. Mathematical morphology is a technique used for analysis and processing geometric structures, based on set theory, topology, and random functions. It helps remove peaks and ridges from the topological surface of the images, and has been used for gridding the microarray images [8]. Jain's [9], Katzer's [10], and Stienfath's [11] models are integrated systems for microarray gridding and quantitative analysis. A method for detecting spot locations based on a Bayesian model has been recently proposed, and uses a deformable template to fit the grid of spots using a posterior probability model for which the parameters are learned by means of a simulated-annealing-based algorithm [1, 3]. Another method for finding spot locations uses a hill-climbing approach to maximize the energy, seen as the intensities of the spots, which are fit to different probabilistic models [5]. Fitting the image to a mixture of Gaussians is another technique that has been applied to gridding microarray images by considering radial and perspective distortions [4]. A Radon-transform-based method that separates the sub-grids in a cDNA microarray image has been proposed in [12]. That method applies the Radon transform to find possible rotations of the image and then finds the sub-grids by smoothing the row or column sums of pixel intensities; however, that method does not automatically find the correct number of sub-grids, and the process is subject to data-dependent parameters.

Another approach for cDNA microarray gridding is a gridding method that performs a series of steps including rotation detection and compares the row or column sums of the top-most and bottom-most parts of the image [13, 14]. This method, which detects rotation angles with respect to one of the axes, either *x* or *y*, has not been tested on images having regions with high noise (e.g., the bottom-most of the image is quite noisy).

Another method for gridding cDNA microarray images uses an evolutionary algorithm to separate sub-grids and detect the positions of the spots [15]. The approach is based on a genetic algorithm that discovers parallel and equidistant line segments, which constitute the grid structure. Thereafter, a refinement procedure is applied to further improve the existing grid structure, by slightly modifying the line segments. Using maximum margin is another method for automatic gridding of cDNA microarray images based on maximizing the margin between rows and columns of spots [16]. Initially, a set of grid lines is placed on the image in order to separate each pair of consecutive rows and columns of the selected spots. Then, the optimal positions of the lines are obtained by maximizing the margin between these rows and columns using a maximum margin linear classifier. For this, a SVM-based gridding method was used in [17]. In that method, the positions of the spots on a cDNA microarray image are first detected using image analysis operations. A set of soft-margin linear SVM classifiers is used to find the optimal layout of the grid lines in the image. Each grid line corresponds to the separating line produced by one of the SVM classifiers, which maximizes the margin between two consecutive rows or columns of spots.

## Results and Discussion

For testing the proposed method (called Optimal Multi-level Thresholding Gridding or OMTG), three different kinds of cDNA microarray images have been used. The images have been selected from different sources, and have different scanning resolutions, in order to study the flexibility of the proposed method to detect sub-grids and spots with different sizes and features.

The first test suite consists of a set of images drawn from the Stanford Microarray Database (SMD), and corresponds to a study of the global transcriptional factors for hormone treatment of *Arabidopsis thaliana* samples. The images can be downloaded from smd.stanford.edu, by selecting "Hormone treatment" as category and "Transcription factors" as subcategory. Ten images were selected, which correspond to channels 1 and 2 for experiments IDs 20385, 20387, 20391, 20392 and 20395. The images have been named using AT (which stands for *Arabidopsis thaliana*), followed by the experiment ID and the channel number (1 or 2).

The second test suite consists of a set of images from Gene Expression Omnibus (GEO) and corresponds to an Atlantic salmon head kidney study. The images can be downloaded from ncbi.nlm.nih.gov, by selecting "GEO Datasets" as category and searching the name of the image. Eight images were selected, which correspond to channels 1 and 2 for experiments IDs GSM16101, GSM16389 and GSM16391, and also channel 1 of GSM15898 and channel 2 of GSM15898. The images have been named using GSM followed by the experiment ID, and the channel number (1 or 2).

The third test suite consists of two images, obtained from a dilution experiment (DILN) and correspond to channels experiments IDs Diln4-3.3942.01A and Diln4-3.3942.01B [18]. The specifications of the cDNA microarray images for each of these three test suites are summarized in Table 1.

To assess the performance of the proposed method, we consider the percentage of the grid lines that separate sub-grids/spots incorrectly, marginally and perfectly. These quantities were found by visually analyzing the result of the gridding produced by our method. For SMD and GEO, our gridding was not compared with the gridding currently available in these databases. For DILN, apart from the visual analysis, we also apply segmentation and quantification by computing the volume of log of intensity and relate these to the rate of dilution in the biological experiment. For the implementation, we used Matlab2010 on a Windows 7 platform and an Intel core i7 870 cpu with 8GB of memory. The average processing times for sub-grid and spot detections are shown in Table 2.

### Sub-grid and Spot Detection Accuracy

Table 3 shows the results of applying the proposed method, OMTG, for spot detection on the SMD dataset. With the proposed method, spot locations can be detected very efficiently with an average accuracy of 98.06% for this dataset. The same sets of experiments were repeated for the GEO dataset and the results are shown in Table 4. Again, the spot locations are detected very efficiently with an average accuracy of 99.26%. The experiments were repeated for the DILN dataset and the results are shown in Table 5. Although the sizes of the spots in each sub-grid are different in this dataset, the spot locations are detected very efficiently with an average accuracy of 97.95%. In most of the images, the performance of the method is more than 98% and incorrectly and marginally aligned rates are less than 1%. Only in a few images with noticeable noise and defects, the accuracy of the method is less than 98%, while incorrectly aligned rates increase to more than 2%. This shows the flexibility and power of the proposed method. For all the images, in the sub-grid detection phase, the incorrect and marginal gridding rates are both 0%, yielding an accuracy of 100%. This means the proposed method works perfectly in sub-grid detection for this case. One of the reasons for the lower accuracy in spot detection is that the distance between spots is smaller than the distance between sub-grids. In all three datasets, there are approximately eight pixels between spots, and approximately 30 pixels horizontally and 100 pixels vertically between sub-grids in the SMD dataset, 200 pixels in the GEO dataset and 25 pixels horizontally, and 200 pixels vertically in the DILN dataset. Another possible reason for this behavior is that the number of pixels in each sub-grid is far lower than that of a microarray image (around 1/50). Thus, the noise present in the image affects the spot detection phase much more than the sub-grid extraction stage. It is important to highlight, however, that because of the relatively large distance between sub-grids, the detection process is not affected by the presence of noise.

Additionally, to evaluate the effectiveness of the refinement procedure, we tested the accuracy of the proposed method with and without applying the refinement procedure. The results are shown in Table 6. For simplicity, we only include those images in which there is a change in accuracy. We observe that applying the refinement procedure slightly improve the efficiency of the method in all the images in the table.

To analyze the results from a different perspective, we have also performed a visual analysis. Figure 1 shows the detected sub-grids in the AT-20387-ch2 image (left) and the detected spots in one of the sub-grids (right). Also, Figure 2 shows the sub-grids detected in the GSM16101-ch1 image (left) and the detected spots in one of the sub-grids (right), while Figure 3 shows the sub-grids detected in the Diln4-3.3942B image (left) and the detected spots in one of the sub-grids (right). As shown in the all three figures, the proposed method finely detects the sub-grid locations first, and in the next stage, each sub-grid is divided precisely into the corresponding spots with the same method. The robustness of OMTG is so high that spots in sub-grids can be detected very well even in noisy conditions, such as those observable in the selected sub-grid in Figure 1. The ability to detect sub-grids and spots in different microarray images with different resolutions and spacing is another important feature of the proposed method.

As mentioned earlier, deformations, noise and artifacts can affect the accuracy of the proposed method. Figure 4 shows an example in which the proposed method fails to detect some spot regions due to the extremely contaminated regions with noise and artifacts. In this particular sub-grid, noisy regions tend to be confused with spots. Also, most spots have low intensities that are confused with the background. After testing other methods on this image, we observed that they also fail to detect the correct gridding in these regions.

To further analyze the efficiency of the proposed method to automatically detect the correct number of spots and sub-grids, we show in Figures 5, 6 and 7 the plots for the indices of validity against the number of sub-grids for AT-20387-ch2, GSM16101-ch1 and Diln4-3.3942B respectively. The plots on top of the figures represent the values of the index functions (*y* axis) for detecting the horizontal lines for the *I*, *A* and *Î±* indices respectively, while the plots of the indices for the vertical separating lines are shown at the bottom of the figures. We observe that it would be rather difficult to find the correct number of sub-grids using the *I* index or the *A* index, while the *Î±* index clearly reveals the correct number of horizontal and vertical sub-grids by producing an almost flat curve with pronounced peaks at 4 and 12 respectively for SMD and GEO images, and pronounced peaks at 2 and 5 respectively for DILN images. For example, it is clearly observable at the bottom plots in Figures 5 and 6 that the *I* index misses the correct number of sub-grids, 12, by showing a higher peak at 13, while the Î± index finds the correct number of vertical sub-grids accurately.

### Rotation Adjustment Accuracy

To test the effect of the Radon transform we rotate two of the images 5,10,15,20 and 25 degrees in both clockwise and counter-clockwise directions. Figure 8 shows the images rotated by -20, -10, 10 and 20 degrees (left) and the result of the adjustment after applying the Radon transform (right). Also, Table 7 shows the accuracy of the proposed method on two of the rotated images. In all cases, the adjustment method works accurately and corrects the rotations in both directions. Moreover, as shown in Table 7, the accuracy of the method remains nearly constant for all cases regardless of the degree of rotation. This shows the effectiveness and robustness of the proposed method in significantly rotated images.

### Comparison with other methods

A conceptual comparison between the proposed method, OMTG, and other microarray image griding methods based on their features is shown in Table 8. The methods included in the comparison are the following: (i) Radon transform sub-gridding (RTSG) [12], (ii) Bayesian simulated annealing gridding (BSAG) [3], (iii) genetic-algorithm-based gridding (GABG) [15], (iv) hill-climbing gridding (HCG) [5], (v) maximum margin microarray gridding (*M*^{3}*G*) [16], and the proposed method, OMTG. As shown in the table, as opposed to other methods, OMTG does not need any number-based parameter, and hence making it much more powerful than the previous ones. One could argue, however, that the index or thresholding criterion can be considered as a "parameter". We have "fixed" these two on the *Î± index* and the *between class* criterion, and experimentally shown the efficiency of OMTG on various cDNA microarray images with different configurations.

An experimental comparison of the proposed method with GABG and HCG is shown in Table 9. As opposed to the proposed method that needs no parameters, GABG needs to set several parameters such as the mutation rate, *Î¼*, the crossover rate, *c*, the maximum threshold probability, *p*_{
max
} , the minimum threshold probability, *p*_{
low
} , the percentage of lines with low probability to be a part of the grid, *f*_{
max
} and the refinement threshold, *T*_{
p
} . Also, HCG needs to set some parameters such as *Î»* and *Ïƒ*. As shown in the table, the accuracy of our method is much higher than GABG and HCG. Since GABG and HCG use several parameters, to obtain good results for the SMD, GEO and DILN datasets, all the parameters must be set manually and separately for each dataset. If the same parameters for one of datasets were used for the others, unpredictable and poor results would be obtained - the accuracy of both methods could decrease to as low as 50%. This makes these methods fully dependent on the parameters, which have to be set manually and for specific datasets. The proposed method, however, does not need any parameter at all, and works exceptionally well in different kinds of images with different resolutions and noisy conditions.

### Biological Analysis

In order to assess the proposed method on its suitability to perform in accordance with the biological problem, we analyze the quantification results and their relationships with the dilution experiment on the DILN dataset. To compute the volume intensity of each spot, first, we use *Sobel* method to detect the edge of each spot and then the region within the edge is defined as the primary region of each spot. In the next step, a set of morphological dilation and erosion operators are used to decrease the noise and artifacts in the region identified for each spot. Finally, the summation of all pixel intensities in the spot are used as the level of expression of the gene associated with that spot; this summation represents the *volume* of the spot. Table 10 shows the volume intensity of each dilution step for images A and B respectively. As shown in the table, the proposed method estimates the average intensities of dilution steps very well with near linear decreasing steps. Also, Figure 9 shows log-plots of the dilution steps for all 80 cases and the mean of them with a red line. The reference line with slope -1 is also shown in black. As shown in this figure, in most parts of the dilution experiment, the estimated intensities of each case follow a linear relationship. In step 4 of the dilution steps, there is an irregularity in the linearity of the red curve as shown in Table 10 and Figure 9. The reason for this irregularity is that, in some sub-grids of Diln4-3.3942.01A and Diln4-3.3942.01B, the intensities of the spots in step 4 are smaller than those of step 5. One example of this can be seen in the third and last rows of the sub-grids in Figure 10. As shown in Figure 10(b), this decrease in the intensity of the spots causes a slight nonlinearity in step 4 of the dilution steps. In general, we observe that the proposed method is able to capture the nonlinear relationships present in the dilution experiments. This is observable in the log-plots of Figure 9, as the black line follows the array of logs of spot volumes.

## Conclusions

A new method for separating sub-grids and spot centers in cDNA microarray images is proposed. The method performs four main steps involving the Radon transform for detecting rotations with respect to the *x* and *y* axes, the use of polynomial-time optimal multilevel thresholding to find the correct positions of the lines separating sub-grids and spots, a new index for detecting the correct number of sub-grids and spots and, finally, a refinement procedure to increase the accuracy of the detection.

The proposed method has been tested on real-life, high-resolution microarray images drawn from three sources, the SMD, GEO and DILN. The results show that (i) the rotations are effectively detected and corrected by affine transformations, (ii) the sub-grids are accurately detected in all cases, even in abnormal conditions such as extremely noisy areas present in the images, (iii) the spots in each sub-grid are accurately detected using the same method, (iv) using the refinement procedure increases the accuracy of the method, and (v) because of using an algorithm free of parameters, this method can be used for different microarray images in various situations, and also for images with various spot sizes and configurations effectively. The results have also been biologically validated on dilution experiments.

## Methods

A cDNA microarray image typically contains a number of sub-grids, and each sub-grid contains a number of spots arranged in rows and columns. The aim is to perform a two-stage process in such a way that the sub-grid locations are found in the first stage, and then spots locations within a sub-grid can be found in the second stage. Consider an image (matrix) *A* = {*a*_{i,j}}, *i* = 1, ..., *n* and *j* = 1, ..., *m*, where *a*_{
ij
} âˆˆ â„¤^{+}, and *A* is a sub-grid of a cDNA microarray image. The method is first applied to a microarray image that contains a template of rows and columns of sub-grids (usually, *a*_{
ij
} is in the range [0..65,535] in a TIFF image). The aim of the first stage, sub-gridding, is to obtain vectors, **h** = [*h*_{1}, ...*h*_{p-1}] ^{t} and **v** = [*v*_{1}, ...*v*_{q-1}]^{t}, where *v*_{
i
} âˆˆ[1, *m*], *h*_{
j
} âˆˆ [1, *n*] and *p* and *q* are the number of horizontal and vertical sub-grids respectively. These horizontal and vertical vectors are used to separate the sub-grids.

Ones the sub-grids are obtained, the gridding process, namely finding the locations of the spots in a sub-grid, can be defined analogously. The rectangular area between two adjacent horizontal vectors *h*_{
j
} and *h*_{j+1}, and two adjacent vertical vectors *v*_{
i
} and *v*_{i+1}delimit the area corresponding to a spot (spot region). The aim of gridding is to find the corresponding spot locations given by the horizontal and vertical adjacent vectors. Post-processing or refinement allows us to find a spot region for each spot, which is enclosed by four lines.

To perform the gridding procedure our method may not need to know the number of sub-grids or spots. Although in many cases, based on the layout of the printer pins, the number of sub-grids or spots are known, due to misalignments, deformations, artifacts or noise during producing the microarray images, these numbers may not be accurate or unavailable. On the other hand, the optimal multi-level thresholding method needs the number of thresholds (sub-grids or spots) to be specified. Thus, we use an iterative approach to find the gridding for every possible number of thresholds, and then evaluate it with the proposed *Î±* index to find the best number of thresholds.

The sub-grids in a microarray image are detected by applying the Radon transform as a pre-processing phase and then using optimal multilevel thresholding in the next stage. By combining the optimal multilevel thresholding method and the Î± index (12), the correct number of thresholds (sub-grids) can be found. Figure 11 depicts the process of finding the sub-grids in a microarray image and the spots in a sub-grid. The input to the Radon transform is a cDNA microarray image and the output of the whole process is the location (and partitioning) of the sub-grids. Analogously, the locations of the spots in each sub-grid are found by using optimal multilevel thresholding combined with the proposed Î± index to find the best number of rows and columns of spots. The input for this process is a sub-grid (already extracted from the sub-gridding step) and the output is the partitioning of the sub-grids into spots (spot regions).

### Rotation Adjustment

Rotations of the images are seen in two different directions, with respect to the *x* and *y* axes. To find two independent angles of rotation for an affine transformation, the Radon transform is applied. Given an image *A* = {*a*_{
x,y
} }, the Radon transform performs the following transformation:

where *p* is the slope and *t* its intercept. The rotation angle of the image with respect to the slope *p* is given by *Ï•* = arctan *p*. For the sake of the notation, *R*(*Ï•*, *t*) is used to denote the Radon transform of image *A*. Each rotation angle *Ï•* gives a different one-dimensional function, and the aim is to obtain the angle that gives the best alignment with the lines. This will occur when the lines are *parallel* to the *y*-axis. The best alignment will occur at the angle *Ï•*_{
min
} that minimizes the *entropy* as follows [1]:

*R*(*Ï•*, *t*) is normalized into *R'*(*Ï•*, *t*), such that Î£_{
t
}*R'*(*Ï•*, *t*) = 1. The positions of the pixels in the new image,[*uv*], are obtained as follows:

where and are the best angles of rotation found by the Radon transform.

### Optimal Multilevel Thresholding

Image thresholding is one of the most widely-used techniques that has many applications in image processing, including segmentation, classification and object recognition. Given a sub-grid, we compute the row or column sums of pixel intensities, obtaining a discrete one dimensional function, where the domain is given by the positions of the rows/columns of pixels. In this work, that function is considered as a histogram in which each bin represents one column (or row respectively), and the row or column sum of intensities corresponds to the frequency of that bin. We use the terms "histogram" or "sum" indistinctly. The frequencies are then normalized in order to be considered as probabilities of the corresponding bins. Figure 12 depicts a typical cDNA microarray image (AT-20387-ch2) that contains 12 Ã— 4 sub-grids, along with the corresponding row or column sums. Also, Figure 13 depicts one of its sub-grids along with the corresponding row and column sums. Each row or column sum is then processed (see below) to obtain the optimal thresholding that will determine the locations of the sub-grids (spots).

Although various parametric and non-parametric thresholding methods and criteria have been proposed, the three most important streams are Otsu's method, which aims to maximize the separability of the classes measured by means of the sum of between-class variances [19], the one that uses information theoretic measures in order to maximize the separability of the classes [20], and the minimum error criterion [21]. In this work, we use the between-class variance criterion [19].

Consider a histogram *H*, an ordered set {1, 2, ..., *n* - 1, *n*}, where the *i* th value corresponds to the *i* th bin and has a probability, *p*_{
i
} . Given an image, *A* = {*a*_{
i,j
} }, as discussed earlier, *H* can be obtained by means of the horizontal (vertical) sum as follows: . We also consider a threshold set *T*, defined as an ordered set *T* = {*t*_{0}, *t*_{1}, ..., *t*_{
k
} , *t*_{k+1}}, where 0 = *t*_{0} < *t*_{1} < ... < *t*_{
k
}< *t*_{k+1}= *n* and *t*_{
i
} âˆˆ {0} âˆª *H*. The problem of multilevel thresholding consists of finding a threshold set, *T* *, in such a way that a function *f* : *H*^{k} Ã— [0, 1] ^{n} â†’ *R*^{+} is maximized/minimized. Using this threshold set, *H* is divided into *k* + 1 classes: Î¶_{1} = {1, 2, ..., *t*_{1}}, Î¶_{2} = {*t*_{1} + 1, *t*_{1} + 2, ..., *t*_{2}}, ..., Î¶ _{
k
} = {*t*_{k-1}+ 1, *t*_{k-1}+ 2, ..., *t*_{
k
}}, Î¶_{k+1}= {*t*_{
k
}+ 1, *t*_{
k
}+ 2, ..., *n*}. The between class variance criterion is given by:

where ,

We use the dynamic programming algorithm for *optimal* multilevel thresholding proposed in [22], which is an extension for irregularly sampled histograms. To implement the between-class variance criterion, Î¨_{BC}(*T*) is expressed as follows: , where . We consider the temporary variables *a* and *b* ,which are computed as follows:

Since from (5) and (6), a and b are known, then , for the next step, can be re-computed as follows in Î˜(1) time:

Full details of the algorithm, whose worst-case time complexity is *O*(*kn*^{2}), can be found in [22].

### Automatic Detection of the Number of Sub-grids and Spots

Finding the correct number of sub-grids and spots in each sub-grid is one of the most challenging issues in sub-grid and spot detection. This stage is crucial in order to fully automate the whole process. Multi-level thresholding uses the number of sub-grids (spots) as a single parameter. Thus, we need to determine the correct number of sub-grids (spots) prior to using multi-level thresholding methods. For this, we resort on validity indices used for clustering. By analyzing the traditional indices for clustering validity and their suitability to be combined with our measure, we propose a new index of validity for this specific problem. From the different indices of validity for clustering (cf. [23, 24]), we consider the *I* index as the basis of the proposed index. The *I* index is defined as follows:

where , , *n* is the total number of points in the dataset (bins in the histogram), and *z*_{
k
} is the center of the *k* th cluster. We also consider the average frequency value of the thresholds in a histogram, which is computed as follows:

where *t*_{
i
} is the *i* th threshold found by optimal multilevel thresholding and *p*(*t*_{
i
} ) is the corresponding probability value in the histogram.

The proposed index, *Î±*(*x*), is the result of a combination of *A*(*K*), (11) and the *I* index, (10), as follows:

For maximizing *I*(*K*) and minimizing *A*(*K*), the value of *Î±*(*K*) must be maximized. Thus, the best number of thresholds *K** based on the *Î±* index is given by:

To find the best number of thresholds, *K* *, we perform an exhaustive search on all positive values of *K* from 1 to *Î´* and find the value of *k* that maximizes the *Î±* index. In our experiment we set *Î´* to (cf. [25]).

### The Refinement Procedure

In some cases, the detected grid or sub-grid may not separate spots completely or may separate them marginally. In these cases, a refinement procedure can be used to boost the performance of method. For this, each horizontal or vertical line is replaced with a new line. Consider two horizontal lines *h*_{
j
} and *h*_{j+1}where *j* âˆˆ[1, *K** ] and a vertical line *v*_{
i
} where *i* [1, *K**], and *v*_{
i
} is bounded between *h*_{
j
} and *h*_{j+1}. Given *A* = {*a*_{
ij
} }, line *v*_{
i
} can be moved to left and right in such way that is minimized. In other words, the vertical line *v*_{
i
} can be replaced with a new vertical line, *v*_{
r
} , in such a way that:

Analogously, this procedure can be applied to each horizontal line. Figure 14 shows an example in which a vertical line is replaced by a new one during the refinement procedure. As shown in the figure, the vertical line *v*_{
i
} is originally located in the wrong place and does not separate two adjacent spots correctly. By moving it to left and right, the new line *v*_{
r
} is found in such way that those adjacent spots are separated correctly.

Figure 15 shows the detected spots in one of the sub-grids of 20387-ch2 of SMD before and after using the refinement procedure. It is clear that there are some misalignments in separating the adjacent spots in the top part of the sub-grid before using the refinement procedure. After the refinement, all the spots are separated precisely as shown in the figure.

## References

Antoniol G, Ceccarelli M: A Markov Random Field Approach to Microarray Image Gridding. Proc. of the 17th International Conference on Pattern Recognition 2004, 550â€“553.

Brandle N, Bischof H, Lapp H: Robust DNA microarray image analysis. Machine Vision and Applications 2003, 15: 11â€“28. 10.1007/s00138-002-0114-x

Ceccarelli B, Antoniol G: A Deformable Grid-matching Approach for Microarray Images. IEEE Transactions on Image Processing 2006, 15(10):3178â€“3188.

Qi F, Luo Y, Hu D: Recognition of Perspectively Distorted Planar Grids. Pattern Recognition Letters 2006, 27(14):1725â€“1731. 10.1016/j.patrec.2006.04.014

Rueda L, Vidyadharan V: A Hill-climbing Approach for Automatic Gridding of cDNA Microarray Images. IEEE Transactions on Computational Biology and Bioinformatics 2006, 3: 72â€“83. 10.1109/TCBB.2006.3

Qin L, Rueda L, Ali A, Ngom A: Spot Detection and Image Segmentation in DNA Microarray Data. Applied Bioinformatics 2005, 4: 1â€“12. 10.2165/00822942-200504010-00001

Katzer M, Kummer F, Sagerer G: A Markov Random Field Model of Microarray Gridding. Proceeding of the 2003 ACM Symposium on Applied Computing 2003, 72â€“77.

Angulo J, Serra J: Automatic Analysis of DNA Microarray Images Using Mathematical Morphology. Bioinformatics 2003, 19(5):553â€“562. 10.1093/bioinformatics/btg057

Jain A, Tokuyasu T, Snijders A, Segraves R, Albertson D, Pinkel D: Fully Automatic Quantification of Microarray Data. Genome Research 2002, 12(2):325â€“332. 10.1101/gr.210902

Katzer M, Kummert F, Sagerer G: Automatische Auswertung von Mikroarraybildern. Proc. Of Workshop Bildverarbeitung fÃ¼r die Medizin 2002.

Steinfath M, Wruck W, Seidel H: Automated Image Analysis for Array Hybridization Experiments. Bioinformatics 2001, 17(7):634â€“641. 10.1093/bioinformatics/17.7.634

Rueda L: Sub-grid Detection in DNA Microarray Images. Proceedings of the IEEE Pacific-RIM Symposium on Image and Video Technology 2007, 248â€“259.

Wang Y, Ma M, Zhang K, Shih F: A Hierarchical Refinement Algorithm for Fully Automatic Gridding in Spotted DNA Microarray Image Processing. Information Sciences 2007, 177(4):1123â€“1135. 10.1016/j.ins.2006.07.004

Wang Y, Shih F, Ma M: Precise Gridding of Microarray Images by Detecting and Correcting Rotations in Subarrays. Proceedings of the 8th Joint Conference on Information Sciences 2005, 1195â€“1198.

Zacharia E, Maroulis D: Micoarray Image Gridding Via an Evolutionary Algorithm. IEEE International Conference on Image Processing 2008, 1444â€“1447.

Bariamis D, Maroulis D, Iakovidis D: M

^{3}G : Maximum Margin Microarray Gridding. BMC Bioinformatics 2010, 11: 49. 10.1186/1471-2105-11-49Bariamis D, Maroulis D, Iakovidis D: Unsupervised SVM-based gridding for DNA microarray images. Computerized Medical Imaging and Graphics 2010, 34(6):418â€“425. 10.1016/j.compmedimag.2009.09.005

Ramdas L, Coombes KR, Baggerly K, Abruzzo L, Highsmith WE, Krogmann T, Hamilton SR, Zhang W: Sources of nonlinearity in cDNA microarray expression measurements. Genome Biology 2001., 2(11):

Otsu N: A Threshold Selection Method from Gray-level Histograms. IEEE Trans. on Systems, Man and Cybernetics 1979, SMC-9: 62â€“66.

Kapur J, Sahoo P, Wong A: A New Method for Gray-level Picture Thresholding Using the Entropy of the Histogram. Computer Vision Graphics and Image Processing 1985, 29: 273â€“285. 10.1016/0734-189X(85)90125-2

Kittler J, Illingworth J: Minimum Error Thresholding. Pattern Recognition 1986, 19: 41â€“47. 10.1016/0031-3203(86)90030-0

Rueda L: An Efficient Algorithm for Optimal Multilevel Thresholding of Irregularly Sampled Histograms. Proceedings of the 7th International Workshop on Statistical Pattern Recognition 2008, 612â€“621.

Maulik U, Bandyopadhyay S: Performance Evaluation of Some Clustering Algorithms and Validity Indices. IEEE Trans. on Pattern Analysis and Machine Intelligence 2002, 24(12):1650â€“1655. 10.1109/TPAMI.2002.1114856

Theodoridis S, Koutroumbas K: Pattern Recognition. 4th edition. Elsevier Academic Press; 2008.

Duda R, Hart P, Stork D: Pattern Classification. 2nd edition. New York, NY: John Wiley and Sons, Inc; 2000.

## Acknowledgements

This work has been partially supported by NSERC, the Natural Sciences and Engineering Research Council of Canada. The authors would like to thank L. Ramdas for providing the cDNA microarray images for the dilution experiments, the DILN dataset. The authors also thank the anonymous reviewers for their feedback.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Authors' contributions

LR and IR conceived the gridding model, performed the data analysis, and elaborated the corresponding discussions. IR implemented the algorithms and conducted the experiments. Both authors have read and approved the final manuscript.

## Authorsâ€™ original submitted files for images

Below are the links to the authorsâ€™ original submitted files for images.

## Rights and permissions

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Rueda, L., Rezaeian, I. A fully automatic gridding method for cDNA microarray images.
*BMC Bioinformatics* **12**, 113 (2011). https://doi.org/10.1186/1471-2105-12-113

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1471-2105-12-113