返回
Graphical models for graph matching: Approximate models and optimal algorithms
DOI:10.1016/j.patrec.2004.10.022.png)
摘要
En 中文
Comparing scene, pattern or object models to structures in images or determining the correspondence between two point sets are examples of attributed graph matching. In this paper we show how such problems can be posed as one of inference over hidden Markov random fields. We review some well known inference methods studied over past decades and show how the Junction Tree framework from Graphical Models leads to algorithms that outperform traditional relaxation-based ones. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
attributed graph matching
hidden Markov random fields
relaxation labeling
Junction Tree algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION关于语音识别中的隐马尔可夫模型和选定应用的教程
PROCEEDINGS OF THE IEEE
IF25.9
Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm通过隐马尔可夫随机场模型和期望最大化算法分割脑部MR图像

