16 September 1994 Computation-efficient algorithms for image registration
Author Affiliations +
Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185912
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xin Qiu, Xin Qiu, Chai Huat Chong, Chai Huat Chong, Chien-Min Huang, Chien-Min Huang, Christopher M. U. Neale, Christopher M. U. Neale, } "Computation-efficient algorithms for image registration", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185912; https://doi.org/10.1117/12.185912
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top