Data fusion with minimal communication

Two sensors obtain data vectors x and y, respectively, and transmit real vectors m/spl I.oarr//sub 1/(x) and m/spl I.oarr//sub 2/(y), respectively, to a fusion center. The authors obtain tight lower bounds on the number of messages (the sum of the dimensions of m/spl I.oarr//sub 1/ and m/spl I.oarr//sub 2/) that have to be transmitted for the fusion center to be able to evaluate a given function f/spl I.oarr/(x,y). When the function f/spl I.oarr/ is linear, they show that these bounds are effectively computable. Certain decentralized estimation problems can be cast in the framework and are discussed in some detail. In particular, the authors consider the case where x and y are random variables representing noisy measurements and f/spl I.oarr/(x,y)=E[z|x,y], where z is a random variable to be estimated. Furthermore, it is established that a standard method for combining decentralized estimates of Gaussian random variables has nearly optimal communication requirements. >

[1]  S. Reiter,et al.  The informational size of message spaces , 1974 .

[2]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[3]  L. Hurwicz Studies in Resource Allocation Processes: Optimality and informational efficiency in resource allocation processes , 1977 .

[4]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[5]  Jason Speyer,et al.  Computation and transmission requirements for a decentralized linear-quadratic-Gaussian control problem , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[6]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[7]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[8]  J. Speyer Computation and transmission requirements for a decentralized linear-quadratic-Gaussian control problem , 1979 .

[9]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.

[10]  Christos H. Papadimitriou,et al.  Communication complexity , 1982, STOC '82.

[11]  A. Willsky,et al.  Combining and updating of local estimates and regional maps along sets of one-dimensional tracks , 1982 .

[12]  Joseph JáJá The VLSI Complexity of Selected Graph Problems , 1984, JACM.

[13]  Joseph Ja' Ja',et al.  The VLSI Complexity of Selected Graph Problems , 1984 .

[14]  John N. Tsitsiklis,et al.  Communication complexity of convex optimization , 1986, 1986 25th IEEE Conference on Decision and Control.

[15]  Sumit Roy,et al.  Decentralized structures for parallel Kalman filtering , 1988 .

[16]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[17]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[18]  Z. Luo Communication Complexity of Computing a Collection of Rational Functions , 1990, ICCI.

[19]  Subhasish Subhasish,et al.  Decentralized linear estimation in correlated measurement noise , 1991 .

[20]  John N. Tsitsiklis,et al.  On the Communication Complexity of Solving a Polynomial Equation , 1989, SIAM J. Comput..

[21]  John N. Tsitsiklis,et al.  On the communication complexity of distributed algebraic computation , 1993, JACM.