Title :
A distributed deterministic approximation algorithm for data association
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., Seoul, South Korea
Abstract :
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 distributed version of the algorithm. The performance of the proposed algorithm is evaluated in simulation.
Keywords :
approximation theory; computational complexity; sensor fusion; statistical analysis; correlation decay; data association; distributed deterministic approximation algorithm; polynomial-time approximation algorithm; statistical physics; Approximation algorithms; Approximation methods; Correlation; Density measurement; Distributed databases; Partitioning algorithms; Polynomials;
Conference_Titel :
Distributed Computing in Sensor Systems and Workshops (DCOSS), 2011 International Conference on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4577-0512-0
Electronic_ISBN :
978-1-4577-0511-3
DOI :
10.1109/DCOSS.2011.5982153