scholarly journals Fast signal reconstruction and recognition algorithm based on cascading redundant dictionary and block sparsity for compressed sensing radar receiver

2019 ◽  
Vol 2019 (19) ◽  
pp. 5498-5502
Author(s):  
Chaozhu Zhang ◽  
Peipei Qiu ◽  
Hongyi Xu
Keyword(s):  
Compressed Sensing ◽  
Signal Reconstruction ◽  
Recognition Algorithm ◽  
Redundant Dictionary ◽  
Block Sparsity

An Algorithm Combining Analysis-based Blind Compressed Sensing and Nonlocal Low-rank Constraints for MRI Reconstruction

2019 ◽  
Vol 15 (3) ◽  
pp. 281-291 ◽  
Author(s):  
Mei Sun ◽  
Jinxu Tao ◽  
Zhongfu Ye ◽  
Bensheng Qiu ◽  
Jinzhang Xu ◽  
...  
Keyword(s):  
Compressed Sensing ◽  
Signal Reconstruction ◽  
Low Rank ◽  
Mr Images ◽  
Scanning Time ◽  
Previous State ◽  
Rank Approximation ◽  
Mri Reconstruction ◽  
Magnetic Resonance Imaging Mri ◽  
Rank Constraints

Background: In order to overcome the limitation of long scanning time, compressive sensing (CS) technology exploits the sparsity of image in some transform domain to reduce the amount of acquired data. Therefore, CS has been widely used in magnetic resonance imaging (MRI) reconstruction. </P><P> Discussion: Blind compressed sensing enables to recover the image successfully from highly under- sampled measurements, because of the data-driven adaption of the unknown transform basis priori. Moreover, analysis-based blind compressed sensing often leads to more efficient signal reconstruction with less time than synthesis-based blind compressed sensing. Recently, some experiments have shown that nonlocal low-rank property has the ability to preserve the details of the image for MRI reconstruction. Methods: Here, we focus on analysis-based blind compressed sensing, and combine it with additional nonlocal low-rank constraint to achieve better MR images from fewer measurements. Instead of nuclear norm, we exploit non-convex Schatten p-functionals for the rank approximation. </P><P> Results & Conclusion: Simulation results indicate that the proposed approach performs better than the previous state-of-the-art algorithms.

scholarly journals Gradient Projection with Approximate L0 Norm Minimization for Sparse Reconstruction in Compressed Sensing

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3373 ◽  
Author(s):  
Ziran Wei ◽  
Jianlin Zhang ◽  
Zhiyong Xu ◽  
Yongmei Huang ◽  
Yong Liu ◽  
...  
Keyword(s):  
Image Reconstruction ◽  
Compressed Sensing ◽  
Objective Function ◽  
Signal Reconstruction ◽  
Reconstruction Error ◽  
Sparse Signal ◽  
Reconstruction Accuracy ◽  
L1 Norm ◽  
Function Model ◽  
L2 Norm

In the reconstruction of sparse signals in compressed sensing, the reconstruction algorithm is required to reconstruct the sparsest form of signal. In order to minimize the objective function, minimal norm algorithm and greedy pursuit algorithm are most commonly used. The minimum L1 norm algorithm has very high reconstruction accuracy, but this convex optimization algorithm cannot get the sparsest signal like the minimum L0 norm algorithm. However, because the L0 norm method is a non-convex problem, it is difficult to get the global optimal solution and the amount of calculation required is huge. In this paper, a new algorithm is proposed to approximate the smooth L0 norm from the approximate L2 norm. First we set up an approximation function model of the sparse term, then the minimum value of the objective function is solved by the gradient projection, and the weight of the function model of the sparse term in the objective function is adjusted adaptively by the reconstruction error value to reconstruct the sparse signal more accurately. Compared with the pseudo inverse of L2 norm and the L1 norm algorithm, this new algorithm has a lower reconstruction error in one-dimensional sparse signal reconstruction. In simulation experiments of two-dimensional image signal reconstruction, the new algorithm has shorter image reconstruction time and higher image reconstruction accuracy compared with the usually used greedy algorithm and the minimum norm algorithm.

Distributed Compressed Sensing Based Channel Parameter Estimation for MIMO-FBMC Communications

2021 ◽  
Author(s):  
Han Wang ◽  
Xianpeng Wang
Keyword(s):  
Channel Estimation ◽  
Compressed Sensing ◽  
Signal Reconstruction ◽  
Estimation Method ◽  
Sparse Signal ◽  
Weak Selection ◽  
Sparse Signal Reconstruction ◽  
Distributed Compressed Sensing ◽  
Time Frequency ◽  
Selection Threshold

Abstract For the sparse correlation between channels in multiple input multiple output filter bank multicarrier with offset quadrature amplitude modulation (MIMO-FBMC/OQAM) systems, the distributed compressed sensing (DCS)-based channel estimation approach is studied. A sparse adaptive distributed sparse channel estimation method based on weak selection threshold is proposed. Firstly, the correlation between MIMO channels is utilized to represent a joint sparse model, and channel estimation is transformed into a joint sparse signal reconstruction problem. Then, the number of correlation atoms for inner product operation is optimized by weak selection threshold, and sparse signal reconstruction is realized by sparse adaptation. The experiment results show that proposed DCS-based method not only estimates the multipath channel components accurately but also achieves higher channel estimation performance than classical orthogonal matching pursuit (OMP) method and other traditional DCS methods in the time-frequency dual selective channels.

Compressed Sensing and Its Application in CT and EEG

2017 ◽  
pp. 1126-1149
Author(s):  
Sajib Saha ◽  
Murat Tahtali
Keyword(s):  
Compressed Sensing ◽  
Applied Mathematics ◽  
Signal Reconstruction ◽  
Optimization Technique ◽  
Linear Measurements ◽  
Reconstruction Procedure ◽  
Sparsity Constraints ◽  
Ill Posed ◽  
X Ray Computed ◽  
A New Technique

Compressed sensing, also known as compressive sampling is a new technique being rapidly developed over the last few years. The theory states that when some prior information about the signal is available and appropriately incorporated into the signal reconstruction procedure, a signal can be accurately reconstructed even if the Shannon/ Nyquest sampling requirement is violated. The key idea of compressed sensing is to recover a sparse signal from very few non-adaptive, linear measurements by optimization technique. Following the discovery by Donoho in (2006), that sparsity could enable exact solution of ill-posed problems under certain conditions, there has been a tremendous growth on efficient application of sparsity constraints for solving ill-posed problems. The theoretical foundation of compressed sensing has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. In this chapter we will detail the application of compressed sensing in X-ray computed tomography (CT) and Electroencephalography. Starting from the very basic principles we will provide theoretical justifications on why and how sparsity prior is used in CT and in EEG.

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