The signal reconstruction in compressive sensing (CS) requires a large amount of data processing. However the traditional CPU has no advantage on vector calculation. To deal with this issue
we design a parallel computing architecture using CUDA. Based on GPU-CPU parallel programming technology
and we realize three fast and efficient CS image reconstruction algorithms
including OMP
TwIST
and linear Bregman algorithm.
关键词
Keywords
references
Donoho D. Compressed sensing[J]. IEEE Trans Inf Theory, 2006, 52(4): 1289-1306. DOI: 1289
Richard G, Baraniuk. Compressive sensing[J]. IEEE Signal Processing Magazine, 2007, 24(4): 118-224. DOI: 118
Bioucas-Dias J, Figueiredo M. A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration[J]. IEEE Trans Image Process, 2007, 16(12): 2992-3004. DOI: 2992
StanleyOsher, Yu Mao, Bin Dong, et al. Fast linearized Bregman iteration for compressive sensing and sparse denoising[J]. Commun Math Sci, 2010, 8(1): 93-111. DOI: 93
Wotao Yin, Stanley Osher, Donald Goldfarb, aet al. Bregman iterative algorithms for l1-minimization with applications to compressed sensing[J]. SIAM J Imaging Sci, 2008, 1(1): 143-168. DOI: 143
Tropp J A, Gilbert A C. Signal recovery from random measurements via orthogonal matching pursuit[J]. IEEE Transactions on Information Theory 2007, 53(12): 4655-4666. DOI: 4655