Search PubMed⌕ Search

Biomedical subjects

Vitaly L Galinsky

Publications and source records attributed to Vitaly L Galinsky.

2 recordsLinked to original sources
PubMed2003

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

Algorithms↗
PubMed2003

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

Algorithms↗