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

2012 ◽  
Vol 508 ◽  
pp. 80-83
Author(s):  
Jian Jiang Cui ◽  
Xu Jia ◽  
Jing Liu ◽  
Qi Li

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.

2021 ◽  
Vol 11 (4) ◽  
pp. 1435
Author(s):  
Xue Bi ◽  
Lu Leng ◽  
Cheonshik Kim ◽  
Xinwen Liu ◽  
Yajun Du ◽  
...  

Image reconstruction based on sparse constraints is an important research topic in compressed sensing. Sparsity adaptive matching pursuit (SAMP) is a greedy pursuit reconstruction algorithm, which reconstructs signals without prior information of the sparsity level and potentially presents better reconstruction performance than other greedy pursuit algorithms. However, SAMP still suffers from being sensitive to the step size selection at high sub-sampling ratios. To solve this problem, this paper proposes a constrained backtracking matching pursuit (CBMP) algorithm for image reconstruction. The composite strategy, including two kinds of constraints, effectively controls the increment of the estimated sparsity level at different stages and accurately estimates the true support set of images. Based on the relationship analysis between the signal and measurement, an energy criterion is also proposed as a constraint. At the same time, the four-to-one rule is improved as an extra constraint. Comprehensive experimental results demonstrate that the proposed CBMP yields better performance and further stability than other greedy pursuit algorithms for image reconstruction.


2018 ◽  
Vol 12 (3) ◽  
pp. 234-244
Author(s):  
Qiang Yang ◽  
Huajun Wang

Super-resolution image reconstruction can achieve favorable feature extraction and image analysis. This study first investigated the image’s self-similarity and constructed high-resolution and low-resolution learning dictionaries; then, based on sparse representation and reconstruction algorithm in compressed sensing theory, super-resolution reconstruction (SRSR) of a single image was realized. The proposed algorithm adopted improved K-SVD algorithm for sample training and learning dictionary construction; additionally, the matching pursuit algorithm was improved for achieving single-image SRSR based on image’s self-similarity and compressed sensing. The experimental results reveal that the proposed reconstruction algorithm shows better visual effect and image quality than the degraded low-resolution image; moreover, compared with the reconstructed images using bilinear interpolation and sparse-representation-based algorithms, the reconstructed image using the proposed algorithm has a higher PSNR value and thus exhibits more favorable super-resolution image reconstruction performance.


2014 ◽  
Vol 556-562 ◽  
pp. 4835-4838 ◽  
Author(s):  
Hai Xia Yan ◽  
Yan Jun Liu ◽  
Yu Ming Sun

In order to improve the speed of compressed sensing image reconstruction algorithm, a two step rapid gradient projection for sparse reconstruction in medical image reconstruction is proposed. in traditional gradient projection for sparse reconstruction algorithm, the searching direction is alternate between the negative gradient direction when the direction is ill, the searching speed is slow. Now we search with two step gradient projection, the speed is increased when meets the ill-condition. Compared with the original GPSR algorithm, the TSGPSR algorithm not only accelerate the speed of operation, but also improves the accuracy of the reconstruction. and exhibits higher robustness under different noise intensities.


2017 ◽  
Vol 37 (4) ◽  
pp. 0411003
Author(s):  
张煜林 Zhang Yulin ◽  
孔慧华 Kong Huihua ◽  
潘晋孝 Pan Jinxiao ◽  
韩焱 Han Yan

2014 ◽  
Vol 530-531 ◽  
pp. 443-446
Author(s):  
Hai Xia Yan ◽  
Yan Jun Liu

In order to improve the speed of compressed sensing image reconstruction algorithm, a rapid gradient projection algorithm for image reconstruction is proposed. In traditional Gradient Projection algorithm, the pursuit direction is alternating, in rapid gradient projection algorithm, we use the Newton's method to calculate the gradient descent direction, thus the constraints conditions of gradient projection is satisfied. And the target function is updated in each iteration computing. The effect of approximation matrix to target function is reduced. The iteration computing times is reduced, because the algorithm works in accurate search direction. Experiment results show that, compared with the GPSR algorithm, the RGPSR algorithm improves the signals reconstruction accuracy, improves PSNR of reconstruction signals, and exhibits higher robustness under different noise intensities.


2014 ◽  
Vol 602-605 ◽  
pp. 3311-3315
Author(s):  
Lin Zhang ◽  
Xia Ling Zeng

Compressed sensing is referred to as the CS technology; it can realize image compression and reconstruction process in low sample rate. It has great potential to reduce the sampling rate and improve the quality of image processing. In this paper, we introduce the structure prior model into the compressed sensing and image processing, and make the image reconstruction of high dimensional optimization process simplified into a series of low dimensional optimization process, which improves the processing speed and image quality. In order to verify the effectiveness and reliability of the proposed algorithm, this paper uses combined control form of C language and MATLAB software to design the programming of structure prior model, and use the Simulink environment to debug the program. Through the calculation we get the image block and the reconstruction result. It provides the technical reference for the research on image compressed sensing technology.


Sign in / Sign up

Export Citation Format

Share Document