Lagrangian relaxation graph matching

作者：

Highlights：

• We present a graph matching method based on Lagrangian relaxation model.

• Our model incorporates affine mapping and discrete constraints simultaneously.

• Experimental results show the effectiveness of our matching method.

摘要

Highlights•We present a graph matching method based on Lagrangian relaxation model.•Our model incorporates affine mapping and discrete constraints simultaneously.•Experimental results show the effectiveness of our matching method.

论文关键词：Graph matching,Integer quadratic programming,Lagrangian relaxation,Multiplicative update

论文评审过程：Received 9 January 2016, Revised 14 May 2016, Accepted 12 July 2016, Available online 14 July 2016, Version of Record 10 August 2016.

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