首页> 外文期刊>Journal of software >A Coarse-to-Fine Registration Method Based on Geometric Constraints and Parallel Architecture
【24h】

A Coarse-to-Fine Registration Method Based on Geometric Constraints and Parallel Architecture

机译:基于几何约束和并行架构的粗到细配准方法

获取原文
           

摘要

Aiming at solving lengthy time-consuming registration and mismatch problems caused by images which have feature simliarity of local region in the traditional SIFT (Scale Invariant Feature Transform) registration method, a fine registration method based on geometric constraints and parallel architecture is put forward. First, in order to provide geometric constraints for block and fine registration, we use SIFT algorithm parallelly extract feature points to calculate initial transform matrix. Then, segment the overlapping region of original image pairs into several blocks. Finally, to achieve fine registration, blockwise SIFT matching and eliminate the mismatch through geometric constraints are implemented on parallel architecture. During the fine registration, we use geometric constraints and affine invariance of Mahalanobis distance to screen feature points and eliminate duplicate matches and mismatches. The experimental results show that this method has eliminated the mismatch generated by same local features. Moreover, registration accuracy and speed have been improved, the proposed approach has practical value.
机译:针对传统SIFT(尺度不变特征变换)配准方法中图像局部区域相似的图像配准问题,提出了一种耗时费力的配准方法,提出了一种基于几何约束和并行架构的精细配准方法。首先,为了给块和精细配准提供几何约束,我们使用SIFT算法并行提取特征点来计算初始变换矩阵。然后,将原始图像对的重叠区域分割为几个块。最后,为了实现精细配准,在并行体系结构上实现了逐块SIFT匹配并通过几何约束消除不匹配。在精细配准过程中,我们使用几何约束和Mahalanobis距离的仿射不变性来筛选特征点,并消除重复的匹配和不匹配。实验结果表明,该方法消除了相同局部特征产生的不匹配现象。而且,提高了配准的准确性和速度,该方法具有实用价值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号