Share Email Print

Journal of Electronic Imaging

Real-time mosaic using sequential graph
Author(s): Dae-Woong Kim; Ki-Sang Hong
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper Abstract

To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in regularly spaced grid features. We use a specific graph structure called a sequential graph defined in each grid and propose a new shortest-path search algorithm to find exact matchings in a sequential manner. Using a sequential structure, the search range to find matchings can be reduced, and the new sequential shortest-path search algorithm reduces the number of block matchings. Also, by introducing uncertainty information of the point feature, we use regularly spaced grids efficiently instead of using corner features and line structures. The framework presented here has an efficient structure for implementation in real time because it is fast, sequential, and consistent in computation time and system memory.

Paper Details

Date Published: 1 April 2006
PDF: 13 pages
J. Electron. Imaging. 15(2) 023005 doi: 10.1117/1.2194488
Published in: Journal of Electronic Imaging Volume 15, Issue 2
Show Author Affiliations
Dae-Woong Kim, Pohang Univ. of Science and Technology (South Korea)
Ki-Sang Hong, Pohang Univ. of Science and Technology (South Korea)

© SPIE. Terms of Use
Back to Top