Distributed fusion in sensor networks

This paper presents an overview of research conducted to bridge the rich field of graphical models with the emerging field of data fusion for sensor networks. Both theoretical issues and prototyping applications are discussed in addition to suggesting new lines of reasoning.

[1]  John W. Fisher,et al.  Loopy Belief Propagation: Convergence and Effects of Message Errors , 2005, J. Mach. Learn. Res..

[2]  Martin J. Wainwright,et al.  Tree-based reparameterization framework for analysis of sum-product and related algorithms , 2003, IEEE Trans. Inf. Theory.

[3]  P.K. Varshney,et al.  Channel-aware distributed detection in wireless sensor networks , 2006, IEEE Signal Processing Magazine.

[4]  H. Vincent Poor,et al.  Distributed learning in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[5]  William T. Freeman,et al.  Nonparametric belief propagation , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[6]  Martin J. Wainwright,et al.  Data association based on optimization in graphical models with application to sensor networks , 2006, Math. Comput. Model..

[7]  M. Vetterli,et al.  Sensing reality and communicating bits: a dangerous liaison , 2006, IEEE Signal Processing Magazine.

[8]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[9]  G.B. Giannakis,et al.  Distributed compression-estimation using wireless sensor networks , 2006, IEEE Signal Processing Magazine.

[10]  Frank R. Kschischang.  Codes defined on graphs , 2003, IEEE Commun. Mag..

[11]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[12]  Martin J. Wainwright,et al.  A new class of upper bounds on the log partition function , 2002, IEEE Transactions on Information Theory.

[13]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.

[14]  Nils F. Sandell,et al.  Distributed data association for Multi-target tracking in sensor networks , 2008, 2008 47th IEEE Conference on Decision and Control.

[15]  Juan R. Vasquez,et al.  Optimization and control for military applications , 2006, Math. Comput. Model..

[16]  Sebastian Thrun,et al.  Affine Structure From Sound , 2005, NIPS.

[17]  David J. Spiegelhalter,et al.  Probabilistic Networks and Expert Systems , 1999, Information Science and Statistics.

[18]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[19]  M. Alanyali,et al.  Search and discovery in an uncertain networked world , 2006, IEEE Signal Processing Magazine.

[20]  Alexander T. Ihler,et al.  Inference in sensor networks: graphical models and particle methods , 2005 .

[21]  Martin J. Wainwright,et al.  A variational principle for graphical models , 2005 .

[22]  Terrence J. Sejnowski,et al.  A Variational Principle for Graphical Models , 2007 .

[23]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[24]  John W. Fisher,et al.  Nonparametric belief propagation for self-localization of sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[25]  Martin J. Wainwright,et al.  MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.

[26]  A.S. Willsky,et al.  An approximate dynamic programming approach to a communication constrained sensor management problem , 2005, 2005 7th International Conference on Information Fusion.

[27]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[28]  Alan S. Willsky,et al.  A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields , 2008, IEEE Transactions on Image Processing.

[29]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[30]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[31]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[32]  Randolph L. Moses,et al.  A Self-Localization Method for Wireless Sensor Networks , 2003, EURASIP J. Adv. Signal Process..

[33]  Dmitry M. Malioutov,et al.  Walk-Sum Interpretation and Analysis of Gaussian Belief Propagation , 2005, NIPS.

[34]  Alan S. Willsky,et al.  Inference with Minimal Communication: a Decision-Theoretic Variational Approach , 2005, NIPS.

[35]  William T. Freeman,et al.  Efficient Multiscale Sampling from Products of Gaussian Mixtures , 2003, NIPS.

[36]  John W. Fisher,et al.  Using Sample-based Representations Under Communications Constraints , 2004 .

[37]  Martin J. Wainwright,et al.  MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.

[38]  Martin J. Wainwright,et al.  Tree consistency and bounds on the performance of the max-product algorithm and its generalizations , 2004, Stat. Comput..