Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Galinsky, V. L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Galinsky, V. L.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 14 2003
Pages 1824-1831
© 2003 Oxford University Press

Automatic registration of microarray images. I. Rectangular grid

Vitaly L. Galinsky

Illumina, Inc., 9885 Towne Centre Dr., San Diego CA 92121, USA and ECE Department, University of California, San Diego, 9500 Gilman Dr., MC 407, La Jolla, CA 92093-0407, USA

Received on January 8, 2003 ; revised on April 24, 2003 ; accepted on April 25, 2003

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

Contact: vit{at}ucsd.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Toxicol SciHome page
N. Zidek, J. Hellmann, P.-J. Kramer, and P. G. Hewitt
Acute Hepatotoxicity: A Predictive Model Based on Focused Illumina Microarrays
Toxicol. Sci., September 1, 2007; 99(1): 289 - 302.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Q. Li, C. Fraley, R. E. Bumgarner, K. Y. Yeung, and A. E. Raftery
Donuts, scratches and blanks: robust model-based segmentation of microarray images
Bioinformatics, June 15, 2005; 21(12): 2875 - 2882.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
K. L. Gunderson, S. Kruglyak, M. S. Graige, F. Garcia, B. G. Kermani, C. Zhao, D. Che, T. Dickinson, E. Wickham, J. Bierle, et al.
Decoding Randomly Ordered DNA Arrays
Genome Res., May 1, 2004; 14(5): 870 - 877.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.