Share Email Print

Proceedings Paper

Computation-efficient algorithms for image registration
Author(s): Xin Qiu; Chai Huat Chong; Chien-Min Huang; Christopher M. U. Neale
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 16 September 1994
PDF: 12 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185912
Show Author Affiliations
Xin Qiu, Utah State Univ. (United States)
Chai Huat Chong, Utah State Univ. (United States)
Chien-Min Huang, Utah State Univ. (United States)
Christopher M. U. Neale, Utah State Univ. (United States)

Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top