A distributed sensor fusion algorithm for the inversion of sparse fields

The objective of the Field Inversion by Consensus and Compressed Sensing (FICCS) algorithm is to use local communications for the distributed estimation of a field, observed by a network of sensors.We use a variation of distributed average consensus algorithms to create tailored linear projections that lead to accurate ¿1-inversions of the sensed field. By spreading information throughout the network, we eliminate the need for a fusion center. To demonstrate the algorithm, we use the example of localizing multiple discrete acoustic sources with knowledge of the propagation medium. We show noiseless and noisy inversion performance in simulation as a function of the number of observation projections computed and discuss the scalability of the approach with network size.

[1]  Soummya Kar,et al.  Sensor Networks With Random Links: Topology Design for Distributed Consensus , 2007, IEEE Transactions on Signal Processing.

[2]  E.J. Candes Compressive Sampling , 2022 .

[3]  José M. F. Moura,et al.  Field inversion by consensus and compressed sensing , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[4]  Soummya Kar,et al.  Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes , 2008, IEEE Transactions on Signal Processing.

[5]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[6]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[7]  Soummya Kar,et al.  Topology for Distributed Inference on Graphs , 2006, IEEE Transactions on Signal Processing.

[8]  M. Rabbat,et al.  Decentralized compression and predistribution via randomized gossiping , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[9]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.

[10]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[12]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[13]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.