Distributed field reconstruction with model-robust basis pursuit

We study the use of distributed average consensus and compressed sensing to perform decentralized estimation of a field measured by networked sensors. We examine field reconstruction of multiple acoustic sources from isotropic magnitude measurements. Compressed projections of global network observations are spread throughout the network using consensus, after which all nodes may invert the source field using ℓ1 recovery methods. To approximate the problem as a discrete linear system, the space of source locations is quantized, introducing model error. We propose a model-robust adaptation to basis pursuit to control for the error arising from the spatial quantization. We show conditions for stability of the robust estimator, providing bounds on the reconstruction error based on perturbation constants, source magnitudes, and mutual coherence. Experiments show that the two types of robust estimators successfully address infeasibility and consistency issues that arise in basis pursuit for spatially quantized acoustic sources.

[1]  Georgios B. Giannakis,et al.  Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling , 2010, IEEE Transactions on Signal Processing.

[2]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[4]  Joel A. Tropp,et al.  Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

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

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

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

[8]  Alexandros G. Dimakis,et al.  Order-Optimal Consensus Through Randomized Path Averaging , 2010, IEEE Transactions on Information Theory.

[9]  Alfred O. Hero,et al.  Energy-based sensor network source localization via projection onto convex sets , 2006, IEEE Trans. Signal Process..

[10]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

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

[12]  José M. F. Moura,et al.  A distributed sensor fusion algorithm for the inversion of sparse fields , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[13]  James A. Bucklew,et al.  Robust decentralized source localization via averaging , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

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