• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Graph-based representations in pattern recognition >Smooth Simultaneous Structural Graph Matching and Point-Set Registration
【24h】

Smooth Simultaneous Structural Graph Matching and Point-Set Registration

机译：平滑的同时结构图匹配和点集套准

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved using the EM algorithm. The solution is then approximated as a succession of assignment problems which are solved, in a smooth way, using Softassign. Our method allows us to detect outliers in both graphs involved in the matching. Unlike the outlier rejectors such as RANSAC and Graph Transformation Matching, our method is able to refine an initial the tentative correspondence-set in a more flexible way than simply removing spurious correspondences. In the experiments, our method shows a good ratio between effectiveness and computational time compared with other methods inside and outside the graphs' field.
机译：我们提出了一种图形匹配方法，该方法既包含结构一致性模型又包含几何变形模型。我们的方法将图匹配问题作为混合建模之一，这是使用EM算法解决的。然后将该解决方案近似为一系列分配问题，使用Softassign可以顺利解决这些分配问题。我们的方法允许我们在匹配中涉及的两个图中检测离群值。与诸如RANSAC和图变换匹配之类的离群值拒绝器不同，我们的方法能够以比简单地删除虚假对应关系更灵活的方式来优化初步的对应关系集。在实验中，与图形领域内外的其他方法相比，我们的方法在有效性和计算时间之间显示出良好的比率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号