DocumentCode
650838
Title
Compressive sensing image reconstruction using universal Hidden Markov Tree model
Author
Xiuping Yang ; Pingping Xu ; Hongyun Chu
Author_Institution
Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China
fYear
2013
fDate
24-26 Oct. 2013
Firstpage
1
Lastpage
5
Abstract
For images, the conventional compressive sensing reconstruction algorithms assume no particular structure aside from the sparsity of them. Although some model-based recovery algorithms take the structure into account, they cost a large amount of computation when computing the model parameters. In this paper, we propose a new recovery algorithm which enables fast and accurate reconstruction of real-world images. We analyze the feasibility of using the wavelet universal Hidden Markov Tree model which fixes the parameters directly to characterize images, and combine iterative reweighted l1 norm minimization with this model. Moreover, we give a novel weighting scheme for reweighted l1 minimization to obtain better reconstruction quality. Experimental results demonstrate that our proposed method outperforms the previously proposed model-based image recovery algorithms as well as conventional recovery algorithms.
Keywords
compressed sensing; hidden Markov models; image reconstruction; iterative methods; minimisation; trees (mathematics); compressive sensing image reconstruction algorithms; iterative reweighted l1 norm minimization; model parameter computation; model-based recovery algorithms; novel weighting scheme; reconstruction quality; wavelet universal hidden Markov tree model; Compressive sensing; Reweighted l1 norm minimization; Universal hidden markov tree model; Weighting scheme;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications & Signal Processing (WCSP), 2013 International Conference on
Conference_Location
Hangzhou
Type
conf
DOI
10.1109/WCSP.2013.6677088
Filename
6677088
Link To Document