Probabilistic Graph and Hypergraph MatchingRon Zass and Amnon Shashua
School of Computer Science and EngineeringThe Hebrew University of Jerusalem
zass,shashua@cs.huji.ac.ilAbstractWe consider the problem of finding a matching between
two sets of features, given complex relations among them,
going beyond pairwise. Each feature set is modeled by
a hypergraph where the complex relations are represented
by hyper-edges. A match between the feature sets is then
modeled as a hypergraph matching proble
