Image Reconstruction Based on Compressed Sensing with Split Bregman Algorithm and Fuzzy Bases

Article Preview

Abstract:

When original data is not complete or image degenerates, image reconstruction and recovery will be very important. In order to acquire reconstruction or recovery image with good quality, compressed sensing provides the possibility of achieving, and an image reconstruction algorithm based on compressed sensing with split Bregman method and fuzzy bases sparse representation is proposed, split strategy is applied in split Bregman algorithm in order to accelerate convergence speed; At the same time, discrete cosine transform and dual orthogonal wavelet transform are treated as bases to represent image sparsely, and image is reconstructed by using split Bregman algorithm. Experiments show that the proposed algorithm can improve convergence speed and reconstruction image quality.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

80-83

Citation:

Online since:

April 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. Chen, D. Donoho, M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Review, 2001, vol. 43, no. 1, pp.129-159.

DOI: 10.1137/s003614450037906x

Google Scholar

[2] C. Johnson, J. Seidel, A. Sofer, Interior point methodology for 3-D PET reconstruction, IEEE Transaction on Medical Imaging, 2000, vol. 19, no. 4, pp.271-285.

DOI: 10.1109/42.848179

Google Scholar

[3] R. Tibshirani, Regression shrinkage and selection via the LASSO, Journal of the Royal Statistical Society, 1996, vol. 58, pp.267-288.

DOI: 10.1111/j.2517-6161.1996.tb02080.x

Google Scholar

[4] B. Efron, T. Hastie, Least angle regression, The Annals of Statistics, 2004, vol. 32, no. 2, pp.407-499.

Google Scholar

[5] I. Daubechies, M. Defrise, C. D. Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, 2004, vol. 57, no. 11, pp.1413-1457.

DOI: 10.1002/cpa.20042

Google Scholar

[6] W. Yin, S. Osher, D. Goldfarb, Bregman iterative algorithms for l1-minimization with applications to compressed sensing, SIAM J. Imaging Science, 2008, vol. 1, no. 1, pp.143-168.

DOI: 10.1137/070703983

Google Scholar

[7] S. Osher, Y. Mao, B. Dong, Fast linearized Bregman iteration for compressive sensing and sparse denoising, Tech. Report, Department of Computational and applied mathematices, Rice University, 2008, pp.3-21.

DOI: 10.21236/ada497867

Google Scholar

[8] J. Cai, S. Osher, Z. Shen, Linear Bregman iterations for compressed sensing, UCLA CAM Report, Department of Mathematics, University of California, 2008, pp.1-18.

Google Scholar