首页> 美国卫生研究院文献>other >Efficient Video Panoramic Image Stitching Based on an Improved Selection of Harris Corners and a Multiple-Constraint Corner Matching
【2h】

Efficient Video Panoramic Image Stitching Based on an Improved Selection of Harris Corners and a Multiple-Constraint Corner Matching

机译:基于改进的Harris角选择和多约束角匹配的高效视频全景图像拼接

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Video panoramic image stitching is extremely time-consuming among other challenges. We present a new algorithm: (i) Improved, self-adaptive selection of Harris corners. The successful stitching relies heavily on the accuracy of corner selection. We fragment each image into numerous regions and select corners within each region according to the normalized variance of region grayscales. Such a selection is self-adaptive and guarantees that corners are distributed proportional to region texture information. The possible clustering of corners is also avoided. (ii) Multiple-constraint corner matching. The traditional Random Sample Consensus (RANSAC) algorithm is inefficient, especially when handling a large number of images with similar features. We filter out many inappropriate corners according to their position information, and then generate candidate matching pairs based on grayscales of adjacent regions around corners. Finally we apply multiple constraints on every two pairs to remove incorrectly matched pairs. By a significantly reduced number of iterations needed in RANSAC, the stitching can be performed in a much more efficient manner. Experiments demonstrate that (i) our corner matching is four times faster than normalized cross-correlation function (NCC) rough match in RANSAC and (ii) generated panoramas feature a smooth transition in overlapping image areas and satisfy real-time human visual requirements.
机译:视频全景图像拼接在其他挑战中非常耗时。我们提出了一种新算法:(i)哈里斯角的改进的自适应选择。成功的拼接很大程度上取决于转角选择的准确性。我们将每个图像分成多个区域,并根据区域灰度的标准化方差选择每个区域内的角。这样的选择是自适应的,并且保证角与区域纹理信息成比例地分布。也避免了角的可能聚类。 (ii)多约束角匹配。传统的随机样本共识(RANSAC)算法效率低下,尤其是在处理大量具有相似特征的图像时。我们根据位置不正确的角过滤掉许多不适当的角,然后基于角附近相邻区域的灰度生成候选匹配对。最后,我们对每两对应用多个约束,以删除不正确匹配的对。通过大大减少RANSAC中所需的迭代次数,可以以更加有效的方式执行拼接。实验表明,(i)我们的角点匹配比RANSAC中的归一化互相关函数(NCC)粗略匹配快四倍,并且(ii)生成的全景图在重叠的图像区域具有平滑的过渡,并满足实时人类视觉需求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号