1. Home
  2. Premium
  3. IEEE ICASSP 2020 Virtual Conference May 2020
  4. Efficient Belief Propagation For Graph Matching

Efficient Belief Propagation For Graph Matching

Collection:
IEEE ICASSP 2020 Virtual Conference May 2020
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 t
  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Videos in this product

Efficient Belief Propagation For Graph Matching

00:16:36
0 views
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 t