Bayesian Inference and Compressed Sensing

This chapter provides the use of Bayesian inference in compressive sensing (CS), a method in signal processing. Among the recovery methods used in CS literature, the convex relaxation methods are reformulated again using the Bayesian framework and this method is applied in different CS applications such as magnetic resonance imaging (MRI), remote sensing, and wireless communication systems, specifically on multiple-input multiple-output (MIMO) systems. The robustness of Bayesian method in incorporating prior information like sparse and structure among the sparse entries is shown in this chapter

Bayesian Linear Regression with Cauchy Prior and Its Application in Sparse MIMO Radar

In this paper, a sparse signal recovery algorithm using Bayesian linear regression with Cauchy prior (BLRC) is proposed. Utilizing an approximate expectation maximization(AEM) scheme, a systematic hyper-parameter updating strategy is developed to make BLRC practical in highly dynamic scenarios. Remarkably, with a more compact latent space, BLRC not only possesses essential features of the well-known sparse Bayesian learning (SBL) and iterative reweighted l2 (IR-l2) algorithms but also outperforms them. Using sparse array (SPA) and coprime array (CPA), numerical analyses are first performed to show the superior performance of BLRC under various noise levels, array sizes, and sparsity levels. Applications of BLRC to sparse multiple-input and multiple-output (MIMO) radar array signal processing are then carried out to show that the proposed BLRC can efficiently produce high-resolution images of the targets.Comment: 22 page

Overview of compressed sensing: Sensing model, reconstruction algorithm, and its applications

With the development of intelligent networks such as the Internet of Things, network scales are becoming increasingly larger, and network environments increasingly complex, which brings a great challenge to network communication. The issues of energy-saving, transmission efficiency, and security were gradually highlighted. Compressed sensing (CS) helps to simultaneously solve those three problems in the communication of intelligent networks. In CS, fewer samples are required to reconstruct sparse or compressible signals, which breaks the restrict condition of a traditional Nyquist-Shannon sampling theorem. Here, we give an overview of recent CS studies, along the issues of sensing models, reconstruction algorithms, and their applications. First, we introduce several common sensing methods for CS, like sparse dictionary sensing, block-compressed sensing, and chaotic compressed sensing. We also present several state-of-the-art reconstruction algorithms of CS, including the convex optimization, greedy, and Bayesian algorithms. Lastly, we offer recommendation for broad CS applications, such as data compression, image processing, cryptography, and the reconstruction of complex networks. We discuss works related to CS technology and some CS essentials. © 2020 by the authors