1 April 2006 Real-time mosaic using sequential graph
Author Affiliations +
J. of Electronic Imaging, 15(2), 023005 (2006). doi:10.1117/1.2194488
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.
Dae-Woong Kim, Ki-Sang Hong, "Real-time mosaic using sequential graph," Journal of Electronic Imaging 15(2), 023005 (1 April 2006). http://dx.doi.org/10.1117/1.2194488
JOURNAL ARTICLE
13 PAGES


SHARE
KEYWORDS
Image registration

Cameras

Seaborgium

Computing systems

Digital imaging

Algorithm development

Algorithms

RELATED CONTENT

Stop-motion microphotography of laser-driven plates
Proceedings of SPIE (October 14 1994)
High-resolution CCD camera for industrial imaging
Proceedings of SPIE (May 20 1993)
Geometric model for camera-based object tracking
Proceedings of SPIE (January 04 1995)
Windowed motion compensation
Proceedings of SPIE (November 01 1991)

Back to Top