Skip to main content
SpringerLink
Log in

Distribution agnostic Bayesian compressive sensing with incremental support estimation

  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

In most compressive sensing algorithms, such as L1-optimization and greedy family techniques, the only a priori information utilized in the reconstruction procedure is the sparsity information. Meanwhile, there exists another family of techniques based on the Bayesian strategy, which considers comprehensive a priori statistical knowledge of the sparse data. This feature resulted in more increased attention to this category of algorithms. One member of the Bayesian-based family of compressive sensing reconstruction algorithms is the support Agnostic Bayesian Matching Pursuit, which is agnostic to support distribution.However, its high computation complexity in determining the set of dominant supports makes this algorithm unfeasible for practical applications such as wireless sensor networks (WSNs). Due to the special conditions of WSNs, consists of limited-power sensors, developed algorithms for them must have the least possible amount of computations. Given this, in this paper, we propose a Bayesian-based method with incremental support detection for distributed sparse signal recovery, which considerably reduces computational complexity. In the proposed method, in a network of sensors, sparse signal reconstruction from noisy measurements is done distributively and in the form of incremental cooperation. So, the number of required computations will be significantly reduced, which will result in a fast approach. The computer simulations show the superior performance of the proposed incremental Bayesian recovery method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Alghunaim, S. A., Yuan, K., & Sayed, A. H. (2019). A proximal diffusion strategy for multi-agent optimization with sparse affine constraints. IEEE Transactions on Automatic Control, 65, 4554–4567.

    Article  Google Scholar 

  • Azarnia, G., & Tinati, M. A. (2015). Steady-state analysis of the deficient length incremental LMS adaptive networks. Circuits, Systems, and Signal Processing, 34(9), 2893–2910.

    Article  MathSciNet  Google Scholar 

  • Azarnia, G., & Tinati, M. A. (2015). Steady-state analysis of the deficient length incremental LMS adaptive networks with noisy links. AEU-International Journal of Electronics and Communications, 69(1), 153–162.

    Google Scholar 

  • Azarnia, G., Tinati, M. A., & Rezaii, T. Y. (2018). Cooperative and distributed algorithm for compressed sensing recovery in WSNs. IET Signal Processing, 12(3), 346–357.

    Article  Google Scholar 

  • Azarnia, G., Tinati, M. A., & Rezaii, T. Y. (2019). Generic cooperative and distributed algorithm for recovery of signals with the same sparsity profile in wireless sensor networks: a non-convex approach. The Journal of Supercomputing, 75(5), 2315–2340.

    Article  Google Scholar 

  • Azarnia, G., Tinati, M. A., Sharifi, A. A., & Shiri, H. (2020). Incremental and diffusion compressive sensing strategies over distributed networks. Digital Signal Processing, 101, 102732.

    Article  Google Scholar 

  • Babacan, S. D., Molina, R., & Katsaggelos, A. K. (2009). Bayesian compressive sensing using laplace priors. IEEE Transactions on Image Processing, 19(1), 53–63.

    Article  MathSciNet  Google Scholar 

  • Chatterjee, S., Sundman, D., & Skoglund, M. (2011). Look ahead orthogonal matching pursuit. In: IEEE international conference on acoustics, speech and signal processing (ICASSP) (pp. 4024–4027). IEEE.

  • Dai, W., & Milenkovic, O. (2009). Subspace pursuit for compressive sensing signal reconstruction. IEEE Transactions on Information Theory, 55(5), 2230–2249.

    Article  MathSciNet  Google Scholar 

  • Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J.-L. (2012). Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit. IEEE transactions on Information Theory, 58(2), 1094–1121.

    Article  MathSciNet  Google Scholar 

  • Heuer, J., Matter, F., Pfetsch, M. E., & Theobald, T. (2020). Block-sparse recovery of semidefinite systems and generalized null space conditions. Linear Algebra and its Applications, 603, 470–495.

    Article  MathSciNet  Google Scholar 

  • Horn, R. A., Mathias, R., & Nakamura, Y. (1991). Inequalities for unitarily invariant norms and bilinear matrix products. Linear and Multilinear Algebra, 30(4), 303–314.

    Article  MathSciNet  Google Scholar 

  • Jain, P., Tewari, A., & Dhillon, I. S. (2011). Orthogonal matching pursuit with replacement. In: Advances in neural information processing systems (pp. 1215–1223).

  • Karahanoglu, N. B., & Erdogan, H. (2013). Compressed sensing signal recovery via forward-backward pursuit. Digital Signal Processing, 23(5), 1539–1548.

    Article  MathSciNet  Google Scholar 

  • Larsson, E. G., & Selén, Y. (2007). Linear regression with a sparse parameter vector. IEEE Transactions on Signal Processing, 55(2), 451–460.

    Article  MathSciNet  Google Scholar 

  • Li, Z., Shi, W., & Yan, M. (2019). A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates. IEEE Transactions on Signal Processing, 67(17), 4494–4506.

    Article  MathSciNet  Google Scholar 

  • Manat, S., & Zhang, Z. (1993). Matching pursuit in a time-frequency dictionary. IEEE Trans Signal Processing, 12, 3397–3451.

    Google Scholar 

  • Masood, M., & Al-Naffouri, T. Y. (2013). Sparse reconstruction using distribution agnostic bayesian matching pursuit. IEEE Transactions on Signal Processing, 61(21), 5298–5309.

    Article  Google Scholar 

  • Needell, D., & Tropp, J. A. (2009). CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis, 26(3), 301–321.

    Article  MathSciNet  Google Scholar 

  • Needell, D., & Vershynin, R. (2010). Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE Journal of Selected Topics in Signal Processing, 4(2), 310–316.

    Article  Google Scholar 

  • Obermeier, R., & Martinez-Lorenzo, J. A. (2017). Sensing matrix design via mutual coherence minimization for electromagnetic compressive imaging applications. IEEE Transactions on Computational Imaging, 3(2), 217–229.

    Article  MathSciNet  Google Scholar 

  • Schniter, P., Potter, L., & Ziniel, J. (2008). Fast Bayesian matching pursuit: Model uncertainty and parameter estimation for sparse linear models. IEEE Transactions on Signal Processing.

  • Stojanovic, V., & Prsic, D. (2020). Robust identification for fault detection in the presence of non-gaussian noises: Application to hydraulic servo drives. Nonlinear Dynamics, 100, 2299–2313.

    Article  Google Scholar 

  • Tao, H., Li, J., Chen, Y., Stojanovic, V., & Yang, H. (2020). Robust point-to-point iterative learning control with trial-varying initial conditions. IET Control Theory & Applications, 14(19), 3344–3350.

    Article  MathSciNet  Google Scholar 

  • Tao, H., Li, X., Paszke, W., Stojanovic, V., & Yang, H. (2021). Robust pd-type iterative learning control for discrete systems with multiple time-delays subjected to polytopic uncertainty and restricted frequency-domain. Multidimensional Systems and Signal Processing, 32(2), 671–692.

    Article  MathSciNet  Google Scholar 

  • Tran, H., & Webster, C. (2019). A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations. Results in Applied Mathematics, 3, 100011.

    Article  MathSciNet  Google Scholar 

  • Tropp, J. A., & Gilbert, A. C. (2007). Signal recovery from random measurements via orthogonal matching pursuit. IEEE Transactions on Information Theory, 53(12), 4655–4666.

    Article  MathSciNet  Google Scholar 

  • Wang, J., Kwon, S., & Shim, B. (2012). Generalized orthogonal matching pursuit. IEEE Transactions on Signal Processing, 60(12), 6202–6216.

    Article  MathSciNet  Google Scholar 

  • Wei, T., Li, X., & Stojanovic, V. (2021). Input-to-state stability of impulsive reaction-diffusion neural networks with infinite distributed delays. Nonlinear Dynamics, 103(2), 1733–1755.

    Article  Google Scholar 

  • Yang, M., & de Hoog, F. (2015). Orthogonal matching pursuit with thresholding and its application in compressive sensing. IEEE Transactions on Signal Processing, 63(20), 5479–5486.

    Article  MathSciNet  Google Scholar 

  • Zhang, Y., Xiang, Y., Zhang, L. Y., Rong, Y., & Guo, S. (2019). Secure wireless communications based on compressive sensing: A survey. IEEE Communications Surveys Tutorials, 21(2), 1093–1111.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Faculty of Khoy, Urmia University, Urmia, Iran

    Ghanbar Azarnia

Authors
  1. Ghanbar Azarnia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ghanbar Azarnia.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Azarnia, G. Distribution agnostic Bayesian compressive sensing with incremental support estimation. Multidim Syst Sign Process 33, 327–340 (2022). https://doi.org/10.1007/s11045-021-00804-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11045-021-00804-w

Keywords

Search

Navigation