【摘要】：隨著信息技術(shù)的飛速發(fā)展,傳統(tǒng)的Shannon/Nyquist采樣定理已不能滿足日益增長(zhǎng)的海量數(shù)據(jù)的存儲(chǔ)、傳輸、處理等問題,這就需要更強(qiáng)大更高速的信號(hào)處理理論和算法,也需要進(jìn)一步提升硬件設(shè)備的信號(hào)處理能力。近年來,Candes、Donoho和華裔數(shù)學(xué)家Tao等人提出了一種新的信息獲取理論——壓縮感知理論(Compressed Sensing,CS)。該理論的本質(zhì)為可壓縮信號(hào)(在某個(gè)基上具有稀疏描述)的少量隨機(jī)線性投影就包含了該信號(hào)重構(gòu)和處理的隨機(jī)信息,也就是僅僅利用信號(hào)稀疏或可壓縮的先驗(yàn)知識(shí)和少量全局線性測(cè)量就可以獲得信號(hào)的精確重建。 稀疏表示和恢復(fù)算法一直是壓縮感知理論的核心內(nèi)容,因此,本文圍繞稀疏表示和重構(gòu)算法問題做了以下幾方面的工作： 1簡(jiǎn)單介紹了壓縮感知理論的基本框架和流程,針對(duì)壓縮感知理論中信號(hào)的稀疏表示、觀測(cè)矩陣的設(shè)計(jì)以及信號(hào)的重構(gòu)算法等核心問題進(jìn)行了詳細(xì)分析,闡述了壓縮感知理論的初步應(yīng)用,為本文的算法研究奠定了理論基礎(chǔ)。 2針對(duì)信號(hào)的稀疏表示問題,本文提出了基于小波模極大值搜索的信號(hào)稀疏表示方法,以及對(duì)應(yīng)的信號(hào)重構(gòu)算法。首先,該方法在小波變換的基礎(chǔ)上,尋找各層小波系數(shù)的模極大值點(diǎn),并根據(jù)模極大值點(diǎn)的傳播特性對(duì)其進(jìn)一步優(yōu)化處理,使得信號(hào)的稀疏性得到顯著提高。然后,將稀疏化的信號(hào)通過觀測(cè)矩陣得到它的觀測(cè)值,對(duì)觀測(cè)值進(jìn)行熵編碼以實(shí)現(xiàn)數(shù)據(jù)壓縮傳輸。解碼時(shí),采用正交匹配追蹤算法得到模極大值點(diǎn)的估計(jì)值,最后用交替投影算法重構(gòu)出原始信號(hào)。仿真結(jié)果表明,與經(jīng)典壓縮感知算法相比,該算法的信號(hào)重構(gòu)質(zhì)量有較大提高,且由于稀疏度增大,信號(hào)具有更好的可壓縮性,實(shí)驗(yàn)表明本文算法對(duì)復(fù)雜信號(hào)效果更明顯。 3針對(duì)二維信號(hào)的重構(gòu)問題,本文對(duì)基于小波域樹形結(jié)構(gòu)的回溯正交匹配追蹤算法(TBOMP)的搜索小波子樹的部分進(jìn)行改進(jìn),根據(jù)小波樹形結(jié)構(gòu)的特點(diǎn),結(jié)合貪婪樹逼近,提出了倒置小波子樹搜索的方法,使搜索過程更加有效、簡(jiǎn)單,然后通過回溯刪除的思想進(jìn)一步優(yōu)化搜索結(jié)果,最后將該算法應(yīng)用到二維圖像重構(gòu)中。仿真結(jié)果表明,與原有同類壓縮感知算法相比,該算法的信號(hào)重構(gòu)質(zhì)量大大提高。
[Abstract]:With the rapid development of information technology, the traditional Shannon/Nyquist sampling theorem can not meet the growing problems of massive data storage, transmission, processing and so on, which requires more powerful and high-speed signal processing theory and algorithm. It is also necessary to further enhance the signal processing capability of hardware devices. In recent years, Candesus Donoho and Tao et al., a Chinese mathematician, have proposed a new information acquisition theory, the theory of compressed perception (Compressed Sensing,CS). The essence of this theory is that a small number of random linear projections of compressible signals (with sparse descriptions on a basis) contain random information for the reconstruction and processing of the signals. In other words, the accurate reconstruction of the signal can be obtained by using only the prior knowledge of sparse or compressible signal and a few global linear measurements. Sparse representation and restoration algorithms have always been the core of compressed sensing theory, so, In this paper, we focus on sparse representation and reconstruction algorithms in the following aspects: 1 the basic framework and flow of compressed perception theory are briefly introduced, and the sparse representation of signals in compressed sensing theory is discussed. The design of observation matrix and the algorithm of signal reconstruction are analyzed in detail, and the preliminary application of compression sensing theory is expounded, which lays a theoretical foundation for the research of the algorithm in this paper. In this paper, a signal sparse representation method based on wavelet modulus maximum search and corresponding signal reconstruction algorithm are proposed. Firstly, on the basis of wavelet transform, this method finds the modulus maximum points of wavelet coefficients in each layer, and optimizes the processing according to the propagation characteristics of the modulus maximum points, so that the sparsity of signals is improved significantly. Then, the sparse signal is obtained by the observation matrix, and the observed value is encoded by entropy to realize the data compression and transmission. In decoding, the orthogonal matching tracking algorithm is used to obtain the estimation of the modulus maximum, and the original signal is reconstructed by alternating projection algorithm. The simulation results show that compared with the classical compression sensing algorithm, the signal reconstruction quality of this algorithm is improved greatly, and the signal has better compressibility because of the increase of sparsity. Experiments show that the algorithm is more effective for complex signals. 3 aiming at the reconstruction of two-dimensional signals, this paper improves the search of wavelet subtree based on (TBOMP), a backtracking orthogonal matching algorithm based on the tree structure in wavelet domain. According to the characteristics of wavelet tree structure and greedy tree approximation, an inverted wavelet subtree search method is proposed, which makes the search process more efficient and simple. Then the search results are optimized by the idea of backtracking deletion. Finally, the algorithm is applied to 2D image reconstruction. The simulation results show that the signal reconstruction quality of this algorithm is greatly improved compared with the original similar compression sensing algorithm.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN911.7

【參考文獻(xiàn)】

相關(guān)期刊論文 前5條

1 岑翼剛;岑麗輝;;基于峰值變換的信號(hào)稀疏表示及重建[J];電子與信息學(xué)報(bào);2011年02期

2 練秋生;肖瑩;;基于小波樹結(jié)構(gòu)和迭代收縮的圖像壓縮感知算法研究[J];電子與信息學(xué)報(bào);2011年04期

3 岑翼剛,岑麗輝,孫德寶;信號(hào)Lipschitz奇異性的計(jì)算與分析[J];計(jì)算機(jī)工程與應(yīng)用;2004年18期

4 李樹濤;魏丹;;壓縮傳感綜述[J];自動(dòng)化學(xué)報(bào);2009年11期

5 岑翼剛;陳曉方;岑麗輝;陳世明;;基于單層小波變換的壓縮感知圖像處理[J];通信學(xué)報(bào);2010年S1期

，

本文編號(hào)：2207588