GA-based parallel image registration on parallel clusters

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transformation between two images, of the same location with slightly different orientation, produced by moving spaceborne remote sensing instruments. In this paper, we have developed sequential and coarse-grained parallel image registration algorithms using GA as an optimization mechanism. In its first phase the algorithm finds a small set of good solutions using low-resolution versions of the images. Based on the results from the first phase, the algorithm uses full resolution image data to refine the final registration results in the second phase. Experimental results are presented and we found that our algorithms yield very accurate registration results and the parallel algorithm scales quite well on the Beowulf parallel cluster.

Cite

CITATION STYLE

APA

Chalermwat, P., E1-Ghazawi, T., & Lemoigne, J. (1999). GA-based parallel image registration on parallel clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1586, pp. 257–265). Springer Verlag. https://doi.org/10.1007/BFb0097907

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free