A fast projected fixed-point algorithm for large graph matching

作者：

Highlights：

• Low time complexity O(n3)/iteration for two graphs of n nodes.

• Super-logarithm convergence guarantee.

• Large graph matching experiments.

摘要

Highlights•Low time complexity O(n3)/iteration for two graphs of n nodes.•Super-logarithm convergence guarantee.•Large graph matching experiments.

论文关键词：Graph matching,Projected fixed-point,Large graph algorithm,Feature correspondence,Point matching

论文评审过程：Received 10 June 2014, Revised 3 February 2016, Accepted 7 July 2016, Available online 9 July 2016, Version of Record 29 July 2016.

论文官网地址：https://doi.org/10.1016/j.patcog.2016.07.015