Point correspondence by a new third order graph matching algorithm
作者：
Highlights：
• An adjacency tensor based third order graph matching algorithm is proposed.
• It enjoys a much lower storage complexity than affinity tensor based high order algorithms.
• Instead of spectral decomposition based optimization, it adopts gradient based optimization.
• Experiments on synthetic and real-world data witness its state-of-the-art performance.
摘要
Highlights•An adjacency tensor based third order graph matching algorithm is proposed.•It enjoys a much lower storage complexity than affinity tensor based high order algorithms.•Instead of spectral decomposition based optimization, it adopts gradient based optimization.•Experiments on synthetic and real-world data witness its state-of-the-art performance.
论文关键词：Graph matching,Point correspondence,High order constraints,Adjacency tensor
论文评审过程：Received 17 June 2015, Revised 9 December 2016, Accepted 10 December 2016, Available online 13 December 2016, Version of Record 27 December 2016.
论文官网地址：https://doi.org/10.1016/j.patcog.2016.12.006
