A fast projected fixed-point algorithm for large graph matching

We propose a fast algorithm for approximate matching of large graphs. Previous graph matching algorithms suffer from high computational complexity and therefore do not have good scalability. By using a new doubly stochastic projection, for matching two weighted graphs of n nodes, our algorithm has t...

Full description

Bibliographic Details

Published in:	Pattern recognition Vol. 60; pp. 971 - 982
Main Authors:	Lu, Yao, Huang, Kaizhu, Liu, Cheng-Lin
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.12.2016
Subjects:	Feature correspondence Graph matching Large graph algorithm Point matching Projected fixed-point Projected fixed-point Feature correspondence Large graph algorithm Point matching Graph matching
ISSN:	0031-3203, 1873-5142
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!