Efficient Belief Propagation for Graph Matching

Efe Onaran; Soledad Villar

ICASSP 2020accepted0 citations

Efficient Belief Propagation for Graph Matching

Abstract

In this short note we derive a novel belief propagation algorithm for graph matching and we numerically evaluate it in the context of matching random graphs. The derived algorithm has a lower asymptotic time-complexity without significantly compromising the accuracy compared to leading available algorithms in the literature. An extended version of this article, with further theory and numerical simulations is in preparation.

BibTeX

@inproceedings{icassp2020_efficientbeliefp,
  title = {Efficient Belief Propagation for Graph Matching},
  author = {Efe Onaran and Soledad Villar},
  booktitle = {ICASSP 2020},
  year = {2020}
}