A POCS-based graph matching algorithm

被引：41
作者：
van Wyk, BJ [1 ]
van Wyk, MA [1 ]
机构：
[1] Tshwane Univ Technol, French S African Tech Inst Elect, ZA-0001 Pretoria, South Africa
来源：
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 2004年 / 26卷 / 11期
关键词：
graph matching; subgraph matching; contextual correspondence matching; projection onto convex sets;
D O I：
10.1109/TPAMI.2004.95
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A novel Projections Onto Convex Sets (POCS) graph matching algorithm is presented. Two-way assignment constraints are enforced without using elaborate penalty terms, graduated nonconvexity, or sophisticated annealing mechanisms to escape from poor local minima. Results indicate that the presented algorithm is robust and compares favorably to other well-known algorithms.
引用
收藏
页码：1526 / 1530
页数：5
相关论文
共 30 条
123