.png){kind=icon}
返回
A non-iterative probabilistic method for contextual correspondence matching
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(98)00142-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
matching
object recognition
Bayesian reasoning
probabilistic reasoning
real-time implementation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
