Real-time mosaic using sequential graph

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

• Type: Journal
• Year: 2006
• Where: JEI
• Authors: Dae Woong Kim, Ki-Sang Hong
• Keywords: JEI 2006, Sequential, Sequential Block, Sequential Shortest-path Search