Fast Image Mosaicing Based on Histograms
Fast Image Mosaicing Based on Histograms
复制标题
DOI：
10.1093/ietisy/e91-d.11.2701
复制
发表时间：
2008-11
期刊：
影响因子：
--
通讯作者：
Akihiro Mori;S. Uchida
中科院分区：
文献类型：
--
作者：
Akihiro Mori;S. Uchida
本文介绍了一种快速图像拼接技术，该技术不需要在图像域上进行昂贵的搜索（如图像域上的像素间对应搜索）和几何变换参数的迭代优化（如基于梯度的优化、迭代优化和随机优化）。所提出的技术以两步的方式组织。这两步都充分利用了直方图，提高了计算效率。第一步，利用像素特征值直方图检测具有相同稀有特征值的像素对作为相应像素对的候选者。第二步，利用变换参数值直方图确定最可靠的变换参数值。实验结果表明，该方法在大多数情况下都能提供合理的拼接结果，且计算非常可行。
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.