.png){kind=icon}
返回
A dynamic generating graphical model for point-sets matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.07.031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models are quite robust to noise but are susceptible to the effects of outliers. We investigated the influences of separators on point-sets matching in inference of graphical models theoretically and found that the separators that consist of outliers will interfere with message-passing, which will directly lead to failure of the existing methods. Because of this, in order to minimize the outliers in the separators, we propose a new algorithm for generating a graphical model and a corresponding Junction Tree for point-sets matching. A bi-mapping algorithm is also introduced to solve the problem of multi-mapping caused by outliers. Experiments were carried out on both synthetical data and real-world data with point-sets extracted by the Harris corner detector. The results show that the proposed algorithm is significantly more stable and possesses higher accuracy of point-sets matching, which can overcome the limitation of the sensitivity of outliers in the existing graphical models. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
pattern recognition
graphical model
point-sets matching
outliers
Junction Tree
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A graph distance metric combining maximum common subgraph and minimum common supergraph结合最大公共子图和最小公共超图的图距离度量
PREAI
分享收藏
分享收藏
查看更多内容