A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The data association problem appears in many applications and is considered as the most challenging problem in intelligent systems. In this paper, we consider the Bayesian formulation of data association problems and present a deterministic polynomial-time approximation algorithm with guaranteed error bounds using correlation decay from statistical physics. We then show that the proposed algorithm naturally partitions a complex problem into a set of local problems and develop a distributeddoi:10.1109/dcoss.2011.5982153 dblp:conf/dcoss/Oh11 fatcat:5xxp25hf5vfr5e4mti6kdpdg4q