An Evaluation of Recent Graph Matching Algorithms

摘要：

Graph matching is a fundamental problem in computer vision and image processing and is widely used in object detection. Recently,many methods formulate it as integer quadratic programming problem to find inexact solutions by relaxing it in continuous domain. In this paper we classify these methods in 3 categories based on the relaxed constraints,hypothesis,solving methods,and convergence properties separately. For evaluation purpose we modify these methods and add some toy modifications to compare the detail configuration of these algorithms under different situations. Finally we try to give some explanation based on experimental results.

关键词： inexact matching graph matching integer quadratic programming

作者: Yu Tian Yuncai Liu

作者单位: Department of Automation,Shanghai Jiao Tong University. No. 800 Dongchuan Road,Shanghai,200240 P. R. Department of Automation,Shanghai Jiao Tong University. No.800 Dongchuan Road,Shanghai,200240 P. R.

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 2336-2340

在线出版日期: 2011-12-23（万方平台首次上网日期，不代表论文的发表时间）