<title>Computation-efficient algorithms for image registration</title>
Lists
Only you see this
Abstract
Two computation-efficient algorithms are presented for automatically generating matching pixels for image registration. The first algorithm is an efficient Sequential Spatial Search Algorithm. A window selection and searching approach incorporated with a post-processing technique are used for restricting the image search area in order to increase reliability of pixel matching. The second method is the Hierarchical Fuzzy C-varieties-based algorithm. The translation and rotation between two images are estimated based on a combination of the closest match both in the centroid value and the membership count. Through a match-and- search procedure, the linear transformation is determined between images. Both methods resulted in good image mosaicking quality even for large rotation and translation.
BibTeX
@inproceedings{qiu1994lt,
author = {Xin Qiu and C. Chong and Chien-Min Huang and Christopher M. U. Neale},
title = {{\<title\>Computation-efficient algorithms for image registration\</title\>}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {1994},
doi = {10.1117/12.185912},
}Loading related content...