1 April 2006 Real-time mosaic using sequential graph
Author Affiliations +
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.
© (2006) Society of Photo-Optical Instrumentation Engineers (SPIE)
Dae-Woong Kim, Dae-Woong Kim, Ki-Sang Hong, Ki-Sang Hong, } "Real-time mosaic using sequential graph," Journal of Electronic Imaging 15(2), 023005 (1 April 2006). https://doi.org/10.1117/1.2194488 . Submission:
JOURNAL ARTICLE
13 PAGES


SHARE
RELATED CONTENT

Real time auto white balancing using DWT based multi scale...
Proceedings of SPIE (February 14 2006)
Digital stills
Proceedings of SPIE (March 13 1995)

Back to Top