Computational spectral imaging based on random modulation and compressed sensing reconstruction algorithm

2016 ◽  
Author(s):  
Jianrong Wu ◽  
Zhentao Liu ◽  
Shiyu Tan ◽  
Enrong Li ◽  
Xia Shen ◽  
...  
Keyword(s):  
Compressed Sensing ◽  
Spectral Imaging ◽  
Reconstruction Algorithm ◽  
Random Modulation

Ultrasonic Block Compressed Sensing Imaging Reconstruction Algorithm Based on Wavelet Sparse Representation

2020 ◽  
Vol 16 (3) ◽  
pp. 262-272
Author(s):  
Guangzhi Dai ◽  
Zhiyong He ◽  
Hongwei Sun
Keyword(s):  
Compressed Sensing ◽  
Sparse Representation ◽  
Linear Array ◽  
Imaging System ◽  
Ultrasonic Imaging ◽  
Large Data ◽  
Reconstruction Algorithm ◽  
Array Transducer ◽  
Total Data ◽  
Block Compressed Sensing

Background: This study is carried out targeting the problem of slow response time and performance degradation of imaging system caused by large data of medical ultrasonic imaging. In view of the advantages of CS, it is applied to medical ultrasonic imaging to solve the above problems. Objective: Under the condition of satisfying the speed of ultrasound imaging, the quality of imaging can be further improved to provide the basis for accurate medical diagnosis. Methods: According to CS theory and the characteristics of the array ultrasonic imaging system, block compressed sensing ultrasonic imaging algorithm is proposed based on wavelet sparse representation. Results: Three kinds of observation matrices have been designed on the basis of the proposed algorithm, which can be selected to reduce the number of the linear array channels and the complexity of the ultrasonic imaging system to some extent. Conclusion: The corresponding simulation program is designed, and the result shows that this algorithm can greatly reduce the total data amount required by imaging and the number of data channels required for linear array transducer to receive data. The imaging effect has been greatly improved compared with that of the spatial frequency domain sparse algorithm.

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.

An lp-based reconstruction algorithm for compressed sensing radar imaging

2016 ◽  
Author(s):  
Le Zheng ◽  
Arian Maleki ◽  
Quanhua Liu ◽  
Xiaodong Wang ◽  
Xiaopeng Yang
Keyword(s):  
Compressed Sensing ◽  
Reconstruction Algorithm ◽  
Radar Imaging

Optimization of matching coded aperture with detector based on compressed sensing spectral imaging technology

2020 ◽  
Vol 13 (2) ◽  
pp. 290-301
Author(s):  
刘铭鑫 LIU Ming-xin ◽  
张 新 ZHANG Xin ◽  
王灵杰 WANG Ling-jie ◽  
史广维 SHI Guang-wei ◽  
吴洪波 WU Hong-bo ◽  
...  
Keyword(s):  
Compressed Sensing ◽  
Spectral Imaging ◽  
Coded Aperture ◽  
Imaging Technology

scholarly journals A New Regularized Reconstruction Algorithm Based on Compressed Sensing for the Sparse Underdetermined Problem and Applications of One-Dimensional and Two-Dimensional Signal Recovery

Algorithms ◽  
2019 ◽  
Vol 12 (7) ◽  
pp. 126 ◽  
Author(s):  
Bin Wang ◽  
Li Wang ◽  
Hao Yu ◽  
Fengming Xin
Keyword(s):  
Compressed Sensing ◽  
Reconstruction Algorithm ◽  
Steepest Descent Method ◽  
Signal Recovery ◽  
Two Dimensional ◽  
Reconstruction Algorithms ◽  
Experimental Conditions ◽  
One Dimensional ◽  
Recovery Algorithm ◽  
Reconstruction Performance

The compressed sensing theory has been widely used in solving undetermined equations in various fields and has made remarkable achievements. The regularized smooth L0 (ReSL0) reconstruction algorithm adds an error regularization term to the smooth L0(SL0) algorithm, achieving the reconstruction of the signal well in the presence of noise. However, the ReSL0 reconstruction algorithm still has some flaws. It still chooses the original optimization method of SL0 and the Gauss approximation function, but this method has the problem of a sawtooth effect in the later optimization stage, and the convergence effect is not ideal. Therefore, we make two adjustments to the basis of the ReSL0 reconstruction algorithm: firstly, we introduce another CIPF function which has a better approximation effect than Gauss function; secondly, we combine the steepest descent method and Newton method in terms of the algorithm optimization. Then, a novel regularized recovery algorithm named combined regularized smooth L0 (CReSL0) is proposed. Under the same experimental conditions, the CReSL0 algorithm is compared with other popular reconstruction algorithms. Overall, the CReSL0 algorithm achieves excellent reconstruction performance in terms of the peak signal-to-noise ratio (PSNR) and run-time for both a one-dimensional Gauss signal and two-dimensional image reconstruction tasks.

Gravity anomaly reconstruction based on nonequispaced Fourier transform

Geophysics ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. G83-G92
Author(s):  
Ya Xu ◽  
Fangzhou Nan ◽  
Weiping Cao ◽  
Song Huang ◽  
Tianyao Hao
Keyword(s):  
Fourier Transform ◽  
Compressed Sensing ◽  
Gravity Data ◽  
Signal Reconstruction ◽  
Gaussian Function ◽  
Reconstruction Algorithm ◽  
Data Reconstruction ◽  
Reconstruction Method ◽  
Grid Data ◽  
2D Data

Irregular sampled gravity data are often interpolated into regular grid data for convenience of data processing and interpretation. The compressed sensing theory provides a signal reconstruction method that can recover a sparse signal from far fewer samples. We have introduced a gravity data reconstruction method based on the nonequispaced Fourier transform (NFT) in the framework of compressed sensing theory. We have developed a sparsity analysis and a reconstruction algorithm with an iterative cooling thresholding method and applied to the gravity data of the Bishop model. For 2D data reconstruction, we use two methods to build the weighting factors: the Gaussian function and the Voronoi method. Both have good reconstruction results from the 2D data tests. The 2D reconstruction tests from different sampling rates and comparison with the minimum curvature and the kriging methods indicate that the reconstruction method based on the NFT has a good reconstruction result even with few sampling data.

scholarly journals WSNs Compressed Sensing Signal Reconstruction Based on Improved Kernel Fuzzy Clustering and Discrete Differential Evolution Algorithm

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Zhou-zhou Liu ◽  
Shi-ning Li
Keyword(s):  
Compressed Sensing ◽  
Differential Evolution ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Signal Reconstruction ◽  
Differential Evolution Algorithm ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Evolution Algorithm ◽  
Discrete Differential Evolution

To reconstruct compressed sensing (CS) signal fast and accurately, this paper proposes an improved discrete differential evolution (IDDE) algorithm based on fuzzy clustering for CS reconstruction. Aiming to overcome the shortcomings of traditional CS reconstruction algorithm, such as heavy dependence on sparsity and low precision of reconstruction, a discrete differential evolution (DDE) algorithm based on improved kernel fuzzy clustering is designed. In this algorithm, fuzzy clustering algorithm is used to analyze the evolutionary population, which improves the pertinence and scientificity of population learning evolution while realizing effective clustering. The differential evolutionary particle coding method and evolutionary mechanism are redefined. And the improved fuzzy clustering discrete differential evolution algorithm is applied to CS reconstruction algorithm, in which signal with unknown sparsity is considered as particle coding. Then the wireless sensor networks (WSNs) sparse signal is accurately reconstructed through the iterative evolution of population. Finally, simulations are carried out in the WSNs data acquisition environment. Results show that compared with traditional reconstruction algorithms such as StOMP, the reconstruction accuracy of the algorithm proposed in this paper is improved by 36.4-51.9%, and the reconstruction time is reduced by 15.1-31.3%.

Sign in / Sign up

Export Citation Format

Share Document