Double-level Binary Tree Bayesian Compressed Sensing for Block Sparse Image

被引:0
作者
Qian, Yongqing [1 ]
Chen, Weizhen [1 ]
机构
[1] Wuhan Polytech Univ, Sch Elect & Elect Engn, Wuhan, Peoples R China
来源
PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017) | 2017年
关键词
Bayesian compressed sensing; block sparse image; double-level binary tree; SIGNAL RECOVERY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Based on the fact that some image signals possess the block sparsity in practical application environment, a novel Compressed Sensing (CS) algorithm for block sparse image is proposed in this paper. Namely, a Double-level Binary Tree (DBT) Bayesian model is proposed for the block sparse image at the same time the relationship of the root node and the leaf node of this DBT structure is defined as "genetic characteristic". Then, the block clustering for the block sparse image can be executed successfully and effectively by utilizing Markov Chain Monte Carlo (MCMC) method. The simulation results prove that, our proposed method for the block sparse image signal can get better recovery results with less computation time.
引用
收藏
页码:453 / 457
页数:5
相关论文
共 17 条
[1]   Compressive sensing [J].
Baraniuk, Richard G. .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) :118-+
[2]   Model-Based Compressive Sensing [J].
Baraniuk, Richard G. ;
Cevher, Volkan ;
Duarte, Marco F. ;
Hegde, Chinmay .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) :1982-2001
[3]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[4]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[5]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[6]   Iteratively reweighted algorithms for compressive sensing [J].
Chartrand, Rick ;
Yin, Wotao .
2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, :3869-+
[7]  
Chen SSB, 2001, SIAM REV, V43, P129, DOI [10.1137/S003614450037906X, 10.1137/S1064827596304010]
[8]   Iteratively Re-weighted Least Squares minimization:: Proof of faster than linear rate for sparse recovery [J].
Daubechies, Ingrid ;
DeVore, Ronald ;
Fornasier, Massimo ;
Guentuerk, Sinan .
2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, :26-+
[9]   Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit [J].
Donoho, David L. ;
Tsaig, Yaakov ;
Drori, Iddo ;
Starck, Jean-Luc .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (02) :1094-1121
[10]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306