图 书 馆
图匹配算法Graph Matching Algorithms |
|
| 课程网址: | http://videolectures.net/mlss05au_caelli_gma/ |
| 主讲教师: | Terry Caelli |
| 开课单位: | 澳大利亚信息通信技术研究中心 |
| 开课时间: | 2007-04-25 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Graph matching plays a key role in many areas of computing from computer vision to networks where there is a need to determine correspondences between the components (vertices and edges) of two attributed structures. In recent years three new approaches to graph matching have emerged as replacements to more traditional heuristic methods. These new methods are: * Least squares - where the optimal correspondence in determined in terms of deriving the best fitting permutation matrix between sets. * Spectral methods - where optimal correspondences are derived via subspace projections in the graph eigenspaces. * Graphical models - where algorithms such as the junction tree algorithm are used to infer the optimal labeling of the nodes of one graph in terms of the other and that satisfy similarity constraints between vertices and edges. In this lecture we review and compare these methods and demonstrate examples where this applies to point set and line matching. |
| 关 键 词: | 图匹配; 光谱方法; 特征空间; 图形化模型; 结树算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-06：zyk |
| 阅读次数: | 63 |