1. An Automated Segmentation Method for Microarray Image Analysis Wei-Bang Chen 1, Chengcui Zhang 1 and Wen-Lin Liu 2 1 Department of Computer and Information Sciences 2 Dept. of Management, Marketing, and Industrial Distribution University of Alabama at Birmingham March 17, 2006

2. What is microarray? DNA microarray was introduced in 1999 by Patrick Brown and Vishwanath Iyer. [1] Microarray allows biologists to monitor gene expression level in parallel. [1] V. R. Iyer, et al. "The transcriptional program in the response of human fibroblasts to serum," Science, v283, pp. 83-7, 1999.

3. Problems and motivations Uneven background a result of improper counterstain Inner holes (a donut, comet, or overlap) manufacturing quality of the slide. Scratch Touching the spots area accidentally Noises Inadequate washing

4. A typical microarray slide

5. Three-step approach Background identification and noise removal  Background identification  Noise removal Fully automatic gridding Spot segmentation

6. Three-step approach Background identification and noise removal  Background identification  Noise removal Fully automatic gridding Spot segmentation

7. Step 1.1 Background identification

8. To deal with the uneven background problem, we firstly divide the entire slide into small areas.

9. Step 1.1 Background identification For global threshold, we use the matrix of mean values of all pixel intensities in the small area to represent the slide.

10. Step 1.1 Background identification For local threshold, we find the minimum intensity values of each row and columns

11. Step 1.2 Noise removal

12. Three-step approach Background identification and noise removal Fully automatic gridding  Finding margins  Detecting blocks  Gridding Spot segmentation

13. Step 2.1 Finding margins

14. Step 2.2 Detecting blocks

15. Step 2.3 Gridding

17. Three-step approach Background identification and noise removal Fully automatic gridding Spot segmentation

18. Step 3 Spot segmentation where, N is the total number of pixels which pre-labeled as signals N th is the number of pixels in the white class (> th ) m b is the mean of the ‘black’ class m w is the mean of the ‘white’ class To minimize the intra class, we want to find a threshold th to maximize the follow formula

19. Step 3 Spot segmentation N th = N All pixels pre-labeled as ‘foreground’ are real signals. N th < N Part of the ‘foreground’ pixels belong to noise, inner holes, or outer rims.  ( N th / N) ≤ φ Pixels identified as white are considered as noise  ( N th / N) > φ Only pixels in the ‘white’ class is considered as real signals

20. Experimental results Background removal and Noise elimination (a)Before applying background removal and noise elimination method (b)After applying background removal and noise elimination method

21. Experimental results Segmentation results

22. Experimental results Block boundary detection and gridding results  Block boundary detection 5 slides (48blocks for each slide) Recall value: 93% Precision value: 100%  Gridding 1 slide (48 blocks) Recall value: 99.97% Precision value: 100%

23. Experimental results Segmentation results

24. Conclusions Our proposed method is a fully automatic and highly parallelizable method  Handle uneven background and severe noise  Detect block boundaries  Generate grids  Extract spots simply and effectively  Highly parallelizable method

25. Thank you !!