Supervised learning for parameterized Koopmans–Beckmann’s graph matching

•Discusses a novel graph matching model, i.e., parameterized Koopmans–Beckmann’s graph matching (KBGMw).•Proposes a supervised learning method for KBGMw.•Shows the performances of the proposed method and several state-of-the-art graph matching methods.•Summarizes the advantages and disadvantages of...

Full description

Saved in:
Bibliographic Details
Published inPattern recognition letters Vol. 143; pp. 8 - 13
Main Authors Zeng, Shaofeng, Liu, Zhiyong, Yang, Xu
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.03.2021
Elsevier Science Ltd
Subjects
Online AccessGet full text

Cover

Loading…