scholarly journals Compressed Sensing Of Complex Sinusoids Off The Grid

2015 ◽  
Vol 66 (4) ◽  
pp. 238-240 ◽  
Author(s):  
Cheng Ping ◽  
Shi Liu ◽  
Zhao Jiaqun
Keyword(s):  
Compressed Sensing ◽  
Reconstruction Algorithm ◽  
Coordinate Descent ◽  
Linear Estimator ◽  
Iteration Algorithm ◽  
Reconstruction Problem

Abstract To solve off-grid problem in compressed sensing, a new reconstruction algorithm for complex sinusoids is proposed. The compressed sensing reconstruction problem is transformed into a joint optimized problem. Based on coordinate descent approach and linear estimator, a new iteration algorithm is proposed. The results of experiments verify the effectiveness of the proposed method.

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

scholarly journals Compressed Sensing-Based DOA Estimation with Unknown Mutual Coupling Effect

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 424 ◽  
Author(s):  
Peng Chen ◽  
Zhenxin Cao ◽  
Zhimin Chen ◽  
Linxi Liu ◽  
Man Feng
Keyword(s):  
Compressed Sensing ◽  
Mutual Coupling ◽  
Linear Array ◽  
State Of The Art ◽  
Coupling Effect ◽  
Estimation Method ◽  
Doa Estimation ◽  
System Model ◽  
Reconstruction Problem ◽  
Uniform Linear Array

The performance of a direction-finding system is significantly degraded by the imperfection of an array. In this paper, the direction-of-arrival (DOA) estimation problem is investigated in the uniform linear array (ULA) system with the unknown mutual coupling (MC) effect. The system model with MC effect is formulated. Then, by exploiting the signal sparsity in the spatial domain, a compressed-sensing (CS)-based system model is proposed with the MC coefficients, and the problem of DOA estimation is converted into that of a sparse reconstruction. To solve the reconstruction problem efficiently, a novel DOA estimation method, named sparse-based DOA estimation with unknown MC effect (SDMC), is proposed, where both the sparse signal and the MC coefficients are estimated iteratively. Simulation results show that the proposed method can achieve better performance of DOA estimation in the scenario with MC effect than the state-of-the-art methods, and improve the DOA estimation performance about 31.64 % by reducing the MC effect by about 4 dB.

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 Sparse Recovery Algorithm for Compressed Sensing Using Smoothed l0 Norm and Randomized Coordinate Descent

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 834
Author(s):  
Jin ◽  
Yang ◽  
Li ◽  
Liu
Keyword(s):  
Compressed Sensing ◽  
Image Denoising ◽  
Signal To Noise Ratio ◽  
Sparse Recovery ◽  
Coordinate Descent ◽  
Sparse Signal ◽  
Sparse Signal Recovery ◽  
Signal Recovery ◽  
Recovery Algorithm ◽  
Core Concepts

Compressed sensing theory is widely used in the field of fault signal diagnosis and image processing. Sparse recovery is one of the core concepts of this theory. In this paper, we proposed a sparse recovery algorithm using a smoothed l0 norm and a randomized coordinate descent (RCD), then applied it to sparse signal recovery and image denoising. We adopted a new strategy to express the (P0) problem approximately and put forward a sparse recovery algorithm using RCD. In the computer simulation experiments, we compared the performance of this algorithm to other typical methods. The results show that our algorithm possesses higher precision in sparse signal recovery. Moreover, it achieves higher signal to noise ratio (SNR) and faster convergence speed in image denoising.

Sign in / Sign up

Export Citation Format

Share Document