...
首页> 外文期刊>Mathematical and Computational Applications >A Two-Step Global Alignment Method for Feature-Based Image Mosaicing
【24h】

A Two-Step Global Alignment Method for Feature-Based Image Mosaicing

机译:基于特征的图像拼接的两步全局对准方法

获取原文

摘要

Image mosaicing sits at the core of many optical mapping applications with mobile robotic platforms. As these platforms have been evolving rapidly and increasing their capabilities, the amount of data they are able to collect is increasing drastically. For this reason, the necessity for efficient methods to handle and process such big data has been rising from different scientific fields, where the optical data provides valuable information. One of the challenging steps of image mosaicing is finding the best image-to-map (or mosaic) motion (represented as a planar transformation) for each image while considering the constraints imposed by inter-image motions. This problem is referred to as Global Alignment (GA) or Global Registration, which usually requires a non-linear minimization. In this paper, following the aforementioned motivations, we propose a two-step global alignment method to obtain globally coherent mosaics with less computational cost and time. It firstly tries to estimate the scale and rotation parameters and then the translation parameters. Although it requires a non-linear minimization, Jacobians are simple to compute and do not contain the positions of correspondences. This allows for saving computational cost and time. It can be also used as a fast way to obtain an initial estimate for further usage in the Symmetric Transfer Error Minimization (STEMin) approach. We presented experimental and comparative results on different datasets obtained by robotic platforms for mapping purposes.
机译:图像拼接是移动机器人平台在许多光学测绘应用程序中的核心。随着这些平台的快速发展和功能的增强,它们能够收集的数据量急剧增加。因此,来自不同的科学领域的光学方法提供了有价值的信息,因此需要有效的方法来处理和处理这样的大数据。图像拼接的挑战性步骤之一是为每个图像找到最佳的图像到地图(或马赛克)运动(表示为平面变换),同时考虑图像间运动施加的约束。此问题称为全局对齐(GA)或全局配准,通常需要进行非线性最小化。在本文中,根据上述动机,我们提出了一种两步全局对准方法,以较少的计算成本和时间来获得全局一致的镶嵌图。它首先尝试估计比例和旋转参数,然后估计平移参数。尽管它需要非线性最小化,但是雅可比矩阵易于计算,并且不包含对应位置。这样可以节省计算成本和时间。它也可以用作获取初始估计值的快速方法,以在对称传输错误最小化(STEMin)方法中进一步使用。我们介绍了通过机器人平台获得的不同数据集的实验和比较结果,以进行制图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号