基于貝葉斯壓縮感知的塊狀稀疏信號恢復算法研究
發(fā)布時間:2018-06-01 14:04
本文選題:稀疏貝葉斯學習 + 結構配對層次模型 ; 參考:《電子科技大學》2014年碩士論文
【摘要】:本文主要考慮了塊狀稀疏(block-sparse)信號的恢復問題,利用壓縮感知理論,通過挖掘信號的稀疏特性及塊狀聚類結構特性,基于低維的測量量來恢復高維的信號。這樣的方案可以在保證信號恢復精度的同時,有效的降低恢復信號所需的測量量。本文主要考慮的場景是,稀疏信號的非零系數(shù)是呈塊狀聚類的形式出現(xiàn)的,但是其非零塊的位置和大小是未知的。通過貝葉斯學習的方法,構建層次化高斯先驗模型,來恢復塊狀稀疏信號。本文首先在噪聲方差已知的條件下,采用基于結構配對的層次化高斯先驗模型來表征信號系數(shù)間的統(tǒng)計相關性,采用一組超參數(shù)(hyperparameter)來控制信號的稀疏性。傳統(tǒng)貝葉斯學習方法中,每個超參數(shù)都單獨的控制其對應的信號系數(shù)的性質。與傳統(tǒng)的貝葉斯稀疏學習方法不同,本文中提出的基于結構配對的壓縮感知恢復算法中,每個信號稀疏的先驗分布,不僅與自身對應的超參數(shù)有關,而且與其相鄰系數(shù)的超參數(shù)有關,這樣的基于結構配對的參數(shù)化模型,可以將相鄰系數(shù)關聯(lián)起來,因此,這樣的結構可以有效的促進信號的塊狀聚類特征,挖掘信號塊狀先驗。在這樣的高斯先驗模型下,采用期望最大化(expectation-maximization)算法,通過循環(huán)迭代,恢復塊狀信號。同時,本文還考慮了在噪聲方差未知的情況下的信號恢復,在這種情況下,將信號看做隱藏參數(shù),并同樣采用期望最大化的方法,依次迭代出估計信號及噪聲方差的值,從而實現(xiàn)對稀疏信號的恢復。文中還進一步介紹了一種基于結構配對的改進重加權優(yōu)化算法,這種算法同樣可以在未知信號分塊結構和稀疏度的前提下,挖掘信號內在塊狀聚類信息,利用較少的測量量,有效的恢復信號。文章還進一步研究了時變稀疏信號的恢復,即不再僅僅考慮單一時隙稀疏信號恢復,而是考慮多時隙測量向量的情況。但是與傳統(tǒng)多測量向量的情況不同,本文中考慮的多測量信號的稀疏結構不再是隨時間恒定不變的,因為在很多情況下,稀疏信號的非零系數(shù)位置,是隨時間發(fā)生緩慢變化的,在本文中,我們就研究了這一問題模型下的信號恢復問題,采用的主要方法是將時變稀疏信號模型通過數(shù)學變換,轉化為塊結構未知的塊稀疏信號的恢復問題進行恢復。仿真結果表明通過挖掘信號的稀疏性以及塊狀特征,利用本文提出的基于結構配對的層次化高斯模型,可以有效的恢復塊狀稀疏信號,在噪聲方差已知時,信號可以以很高的概率完全恢復。而在存在噪聲,且噪聲方差未知時,也可以對信號實現(xiàn)有效恢復。對自然數(shù)據(jù),如圖像、聲音數(shù)據(jù)的仿真也表明,自然界的很多信號都具有這樣的塊狀稀疏特征,且可以利用本文提出的算法進行有效恢復。另一方面,對DoA模型中時變信號的恢復,同樣表明本文所提出算法對于時變信號的恢復也具有比較好的效果。
[Abstract]:In this paper, the recovery problem of block-sparsed-block signals is mainly considered. Using the theory of compression perception, the high-dimensional signals are recovered based on low-dimensional measurements by mining the sparse characteristics of the signals and the structural characteristics of block-like clustering. This scheme can effectively reduce the amount of measurement needed to restore the signal while ensuring the accuracy of the signal recovery. The main scenario considered in this paper is that the non-zero coefficients of sparse signals appear in the form of block clustering but the position and size of the non-zero blocks are unknown. A hierarchical Gao Si priori model is constructed to restore block sparse signals by Bayesian learning. In this paper, a hierarchical Gao Si priori model based on structural pairing is used to characterize the statistical correlation between signal coefficients under the condition that the noise variance is known, and a set of hyperparametric parameters are used to control the sparsity of the signal. In the traditional Bayesian learning method, each superparameter controls the properties of the corresponding signal coefficients separately. Different from the traditional Bayesian sparse learning method, the prior distribution of each signal sparse is not only related to its own hyperparameter, but also to the prior distribution of each signal in the proposed algorithm based on structural pairings. Moreover, this parameterized model based on structural pairing can correlate the adjacent coefficients with the superparameters of the adjacent coefficients. Therefore, this structure can effectively promote the block clustering features of signals and mine the block priori of signals. In this Gao Si priori model, the expected maximization algorithm is used to recover the block signal by cyclic iteration. At the same time, this paper also considers the signal recovery when the noise variance is unknown. In this case, the signal is regarded as a hidden parameter, and the expected maximization method is used to iterate out the estimated signal and noise variance in turn. In order to achieve sparse signal recovery. An improved reweighted optimization algorithm based on structural pairing is also introduced in this paper. This algorithm can also mine the inner block clustering information of the signal under the premise of unknown signal block structure and sparse degree, and make use of less measurement quantity. An effective recovery signal. In this paper, the restoration of time-varying sparse signals is further studied, that is, the case of multi-slot measurement vector is not considered only in the case of single slot sparse signal recovery. However, unlike the traditional multi-measurement vector, the sparse structure of the multi-measurement signal considered in this paper is no longer constant with time, because in many cases, the position of the non-zero coefficient of the sparse signal changes slowly with time. In this paper, we study the signal recovery problem under this model. The main method is to transform the time-varying sparse signal model into the block sparse signal recovery problem with unknown block structure by mathematical transformation. The simulation results show that the block sparse signals can be recovered effectively by mining the sparse signals and block features, and using the hierarchical Gao Si model based on structural pairing, when the noise variance is known. The signal can be fully recovered with a high probability. When there is noise and the variance of noise is unknown, the signal can be recovered effectively. The simulation of natural data, such as images and sound data, also shows that many signals in nature have such block sparse features, and can be effectively restored by using the algorithm proposed in this paper. On the other hand, the recovery of time-varying signals in DoA model also shows that the proposed algorithm has a good effect on the recovery of time-varying signals.
【學位授予單位】:電子科技大學
【學位級別】:碩士
【學位授予年份】:2014
【分類號】:TN911.7
,
本文編號:1964438
本文鏈接:http://sikaile.net/kejilunwen/wltx/1964438.html
最近更新
教材專著