...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >A non-iterative probabilistic method for contextual correspondence matching
【24h】

A non-iterative probabilistic method for contextual correspondence matching

机译:上下文对应匹配的非迭代概率方法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we develop a framework for non-iterative structural matching using contextual information. It is based on Bayesian reasoning and involves the explicit modelling of the binary relations between the objects. The difference between this and previously developed theories of the kind lies in the assumption that the binary relations used are derivable from the unary measurements that refer to individual objects. This leads to a non-iterative formula for probabilistic reasoning which is amenable to real-time implementation and produces good results. The theory is demonstrated using two applications, one on stereo matching of linear features and the other on automatic map registration. The breaking points of the theory are also identified experimentally and the situations under which the proposed algorithm is applicable are discussed. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. [References: 40]
机译:在本文中,我们开发了一个使用上下文信息进行非迭代结构匹配的框架。它基于贝叶斯推理,涉及对象之间二元关系的显式建模。这种理论与先前开发的这种理论之间的区别在于,假设所用的二进制关系可从引用单个对象的一元测量值推导而来。这导致了概率推理的非迭代公式,该公式适合实时实施并产生良好的结果。使用两个应用程序演示了该理论,一个应用程序是线性特征的立体匹配,另一个应用程序是自动地图配准。实验还确定了该理论的突破点,并讨论了该算法适用的情况。 (C)1998模式识别学会。由Elsevier Science Ltd.出版。保留所有权利。 [参考:40]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号