scholarly journals Shearlet‐based compressed sensing with non‐local similarity for MRI breast image reconstruction

2021 ◽  
Author(s):  
Xiaotao Shao ◽  
Caike Wei ◽  
Yi Xie ◽  
Zhongli Wang ◽  
Yan Shen
Keyword(s):  
Image Reconstruction ◽  
Compressed Sensing ◽  
Local Similarity ◽  
Breast Image ◽  
Non Local

scholarly journals Group-Based Sparse Representation for Compressed Sensing Image Reconstruction with Joint Regularization

Electronics ◽  
2022 ◽  
Vol 11 (2) ◽  
pp. 182
Author(s):  
Rongfang Wang ◽  
Yali Qin ◽  
Zhenbiao Wang ◽  
Huan Zheng
Keyword(s):  
Image Reconstruction ◽  
Compressed Sensing ◽  
Sparse Representation ◽  
Structural Similarity ◽  
Block Matching ◽  
Reconstructed Image ◽  
Local Similarity ◽  
Iterative Thresholding ◽  
Regularization Term

Achieving high-quality reconstructions of images is the focus of research in image compressed sensing. Group sparse representation improves the quality of reconstructed images by exploiting the non-local similarity of images; however, block-matching and dictionary learning in the image group construction process leads to a long reconstruction time and artifacts in the reconstructed images. To solve the above problems, a joint regularized image reconstruction model based on group sparse representation (GSR-JR) is proposed. A group sparse coefficients regularization term ensures the sparsity of the group coefficients and reduces the complexity of the model. The group sparse residual regularization term introduces the prior information of the image to improve the quality of the reconstructed image. The alternating direction multiplier method and iterative thresholding algorithm are applied to solve the optimization problem. Simulation experiments confirm that the optimized GSR-JR model is superior to other advanced image reconstruction models in reconstructed image quality and visual effects. When the sensing rate is 0.1, compared to the group sparse residual constraint with a nonlocal prior (GSRC-NLR) model, the gain of the peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) is up to 4.86 dB and 0.1189, respectively.

Remote Sensing Image Reconstruction Method Based on Non-Local Similarity and Low Rank Matrix

2016 ◽  
Vol 36 (6) ◽  
pp. 0611002
Author(s):  
黄芝娟 Huang Zhijuan ◽  
唐超影 Tang Chaoying ◽  
陈跃庭 Chen Yueting ◽  
李奇 Li Qi ◽  
徐之海 Xu Zhihai ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Image Reconstruction ◽  
Remote Sensing Image ◽  
Low Rank ◽  
Reconstruction Method ◽  
Local Similarity ◽  
Rank Matrix ◽  
Image Reconstruction Method ◽  
Non Local ◽  
Low Rank Matrix

Compressed Sensing Image Reconstruction Based on Improved Particle Swarm Optimization Algorithm

2014 ◽  
Vol 599-601 ◽  
pp. 1453-1456
Author(s):  
Ju Wang ◽  
Yin Liu ◽  
Wei Juan Zhang ◽  
Kun Li
Keyword(s):  
Particle Swarm Optimization ◽  
Image Reconstruction ◽  
Compressed Sensing ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Matching Pursuit ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The reconstruction algorithm has a hot research in compressed sensing. Matching pursuit algorithm has a huge computational task, when particle swarm optimization has been put forth to find the best atom, but it due to the easy convergence to local minima, so the paper proposed a algorithm ,which based on improved particle swarm optimization. The algorithm referred above combines K-mean and particle swarm optimization algorithm. The algorithm not only effectively prevents the premature convergence, but also improves the K-mean’s local. These findings indicated that the algorithm overcomes premature convergence of particle swarm optimization, and improves the quality of image reconstruction.

scholarly journals Constrained Backtracking Matching Pursuit Algorithm for Image Reconstruction in Compressed Sensing

2021 ◽  
Vol 11 (4) ◽  
pp. 1435
Author(s):  
Xue Bi ◽  
Lu Leng ◽  
Cheonshik Kim ◽  
Xinwen Liu ◽  
Yajun Du ◽  
...  
Keyword(s):  
Image Reconstruction ◽  
Compressed Sensing ◽  
Matching Pursuit ◽  
Reconstruction Algorithm ◽  
Energy Criterion ◽  
Step Size ◽  
Relationship Analysis ◽  
Support Set ◽  
Reconstruction Performance ◽  
Sparsity Level

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.

scholarly journals Compressed sensing image restoration algorithm based on improved SURF operator

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 1033-1045
Author(s):  
Guodong Zhou ◽  
Huailiang Zhang ◽  
Raquel Martínez Lucas
Keyword(s):  
Compressed Sensing ◽  
Image Restoration ◽  
Feature Vector ◽  
Optimization Method ◽  
Image Feature ◽  
Diffusion Method ◽  
Local Similarity ◽  
Weighting Method ◽  
Data Smoothing ◽  
Restoration Algorithm

Abstract Aiming at the excellent descriptive ability of SURF operator for local features of images, except for the shortcoming of global feature description ability, a compressed sensing image restoration algorithm based on improved SURF operator is proposed. The SURF feature vector set of the image is extracted, and the vector set data is reduced into a single high-dimensional feature vector by using a histogram algorithm, and then the image HSV color histogram is extracted.MSA image decomposition algorithm is used to obtain sparse representation of image feature vectors. Total variation curvature diffusion method and Bayesian weighting method perform image restoration for data smoothing feature and local similarity feature of texture part respectively. A compressed sensing image restoration model is obtained by using Schatten-p norm, and image color supplement is performed on the model. The compressed sensing image is iteratively solved by alternating optimization method, and the compressed sensing image is restored. The experimental results show that the proposed algorithm has good restoration performance, and the restored image has finer edge and texture structure and better visual effect.

Sign in / Sign up

Export Citation Format

Share Document