首页> 外文会议>NATO advanced research workshop on multisensor data fusion >ROBUST MULTISENSOR IMAGE REGISTRATION WITH PARTIAL DISTANCE MERITS
【24h】

ROBUST MULTISENSOR IMAGE REGISTRATION WITH PARTIAL DISTANCE MERITS

机译:具有部分距离优点的强大多用户图像配准

获取原文

摘要

We have analyzed the problems in the visible and far-infrared battlefield image registration. We adopted the contour-based approach, which permits to incorporate the powerful computer vision approaches for edge detection, edge saliency and curve matching. We have implemented multi-scale hierarchical edges detection and edge focusing and salience measure for extracting horizon lines. To deal with the feature inconsistency problems we used the transformation space searching methods with the partial Hausdorff distance merit, and demonstrated free-form curve matching using 1) Image quadtree partition technique to the local Hausdorff distance matching, that dramatically reduces the size of the search space into that of the search for translations which minimize the Hausdorff distance between corresponding sub images, 2) Adaptive partial Hausdorff distance hill climbing, which is much faster than the search in the entire affine transformation space. 3) The iterative closest point algorithm using an efficient segment-list Voronoi transform and distance transform and again the mean square partial distance merit. All the three algorithms match the maps of curve features without looking for correspondence and show a large tolerance to outlier features. The condition for application of those three approaches is that the transformation should be known a priori and the initial match should be established as a start point for the optimization. Those conditions are fulfilled in our application. The key issue for the successful image registration is still the extraction of salient features from the real world images using local, regional and global information and appropriate salience measures, and an efficient curve matching against outliers.
机译:我们分析了在可见光和远红外战场图像配准的问题。我们采用基于轮廓的方法,允许合并对边缘检测,边缘的显着性和曲线拟合功能强大的计算机视觉的方法。我们已经实现了多尺度层次的边缘检测和边缘聚焦和显着性措施用于提取天际线。为了解决我们使用利用1)图像四叉树分割技术来局部Hausdorff距离匹配的变换空间搜索与部分Hausdorff距离优点方法,并表现出自由曲线匹配的特征不一致的问题,能够显着降低搜索的大小空间划分成所述搜索翻译其最小化对应的子图像,2)的自适应部分Hausdorff距离爬坡,这比在整个仿射变换空间中的搜索快得多之间的Hausdorff距离的。 3)使用高效的片段列表中的Voronoi的迭代最近点算法变换和距离变换,并再次均方部分距离的优点。所有这三种算法匹配的曲线特征的地图不找对应,并显示出较大的耐受性异常特征。对于那些三种方法的应用的条件是改造的,应事先知道的,初始匹配应建立为起点的优化。这些条件都满足我们的应用程序。对于成功的图像配准的关键问题仍然是显着的特征,从使用本地,区域和全球信息和相应的显着性的措施,并针对异常高效的曲线拟合真实的世界图像的提取。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号