Robust diagnostics for Bayesian compressive sensing with applications to structural health monitoring

In structural health monitoring (SHM) systems for civil structures, signal compression is often important to reduce the cost of data transfer and storage because of the large volumes of data generated from the monitoring system. Compressive sensing is a novel data compressing method whereby one does not measure the entire signal directly but rather a set of related ("projected") measurements. The length of the required compressive-sensing measurements is typically much smaller than the original signal, therefore increasing the efficiency of data transfer and storage. Recently, a Bayesian formalism has also been employed for optimal compressive sensing, which adopts the ideas in the relevance vector machine (RVM) as a decompression tool, such as the automatic relevance determination prior (ARD). Recently publications illustrate the benefits of using the Bayesian compressive sensing (BCS) method. However, none of these publications have investigated the robustness of the BCS method. We show that the usual RVM optimization algorithm lacks robustness when the number of measurements is a lot less than the length of the signals because it can produce sub-optimal signal representations; as a result, BCS is not robust when high compression efficiency is required. This induces a tradeoff between efficiently compressing data and accurately decompressing it. Based on a study of the robustness of the BCS method, diagnostic tools are proposed to investigate whether the compressed representation of the signal is optimal. With reliable diagnostics, the performance of the BCS method can be monitored effectively. The numerical results show that it is a powerful tool to examine the correctness of reconstruction results without knowing the original signal.

[1]  George Eastman House,et al.  Sparse Bayesian Learning and the Relevan e Ve tor Ma hine , 2001 .

[2]  Richard G. Baraniuk,et al.  1-Bit compressive sensing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[3]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[4]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Michael E. Tipping,et al.  Fast Marginal Likelihood Maximisation for Sparse Bayesian Models , 2003 .

[6]  Gaurav S. Sukhatme,et al.  Networked Sensing for Structural Health Monitoring , 2004 .

[7]  Michael E. Tipping Bayesian Inference: An Introduction to Principles and Practice in Machine Learning , 2003, Advanced Lectures on Machine Learning.

[8]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[9]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[10]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[11]  Yunfeng Zhang,et al.  Wavelet-based vibration sensor data compression technique for civil infrastructure condition monitoring , 2006 .

[12]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.

[13]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[14]  J. Beck Bayesian system identification based on probability logic , 2010 .

[15]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[16]  Lawrence Carin,et al.  Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing , 2009, IEEE Transactions on Signal Processing.

[17]  A. Kiremidjian,et al.  Power-Efficient Data Management for a Wireless Structural Monitoring System , 2003 .

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

[19]  Michael E. Tipping,et al.  Analysis of Sparse Bayesian Learning , 2001, NIPS.

[20]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[21]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[22]  Richard G. Baraniuk,et al.  Distributed Compressive Sensing , 2009, ArXiv.

[23]  D. Donoho For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .