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...
Saved in:
Published in | Pattern recognition letters Vol. 143; pp. 8 - 13 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
01.03.2021
Elsevier Science Ltd |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!