Fast Image Mosaicing Based on Histograms

作者：Mori Akihiro^*; Uchida Seiichi

来源：IEICE Transactions on Information and Systems, 2008, E91D(11): 2701-2708.

DOI：10.1093/ietisy/e91-d.11.2701

• mosaicing
• histogram
• correspondence problem

This paper introduces a fast image mosaicing technique that does not require costly search on image domain (e.g., pixel-to-pixel correspondence search on the image domain) and the iterative optimization (e.g., gradient-based optimization, iterative optimization, and random optimization) of geometric transformation parameter. The proposed technique is organized in a two-step manner. At both steps, histograms are fully utilized for high computational efficiency. At the first step, a histogram of pixel feature values is utilized to detect pairs of pixels with the same rare feature values as candidates of corresponding pixel pairs. At the second step, a histogram of transformation parameter values is utilized to determine the most reliable transformation parameter value. Experimental results showed that the proposed technique can provide reasonable mosaicing results in most cases with very feasible computations.

• 出版日期2008-11