Efficient Belief Propagation For Graph Matching

This video program is a part of the Premium package:

Efficient Belief Propagation For Graph Matching


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Efficient Belief Propagation For Graph Matching

0 views
  • Share
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
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