Wideband LFM Signal Parameter Estimation Based on Compressed Sensing Theory

2014 ◽  
Vol 548-549 ◽  
pp. 1160-1165 ◽  
Author(s):  
Ning Ma ◽  
Jian Xin Wang
Keyword(s):  
Parameter Estimation ◽  
Compressed Sensing ◽  
Sampling Theorem ◽  
Signal Spectrum ◽  
Reconstruction Algorithms ◽  
Edge Information ◽  
Compressed Sampling ◽  
Novel Method ◽  
Estimation Precision ◽  
Sampling And Reconstruction

Compressed sensing (CS) theory breaks through the limitations of the traditional Nyquist sampling theorem, and accomplishes the compressed sampling and reconstruction of signals based on sparsity or compressibility. In this paper, CS theory is used to do the parameter estimation of wideband Linear Frequency Modulated (LFM) signal in order to decrease the sampling pressure. A novel method that reconstructs the edge information of the LFM spectrum based on wavelet transform and CS theory is proposed. On the basis that the wideband LFM signal has approximate rectangular spectrum, the wavelet-based edge detection is introduced to provide sparse representation for the signal spectrum. The edges of the spectrum can be reconstructed by the CS reconstruction algorithms. Consequently, the initial frequency and final frequency of wideband LFM signal can be estimated with high estimation precision. The effectiveness of the proposed method is confirmed with numerical simulation.

scholarly journals Overview of Compressed Sensing: Sensing Model, Reconstruction Algorithm, and Its Applications

2020 ◽  
Vol 10 (17) ◽  
pp. 5909
Author(s):  
Lixiang Li ◽  
Yuan Fang ◽  
Liwei Liu ◽  
Haipeng Peng ◽  
Jürgen Kurths ◽  
...  
Keyword(s):  
Compressed Sensing ◽  
Reconstruction Algorithm ◽  
Transmission Efficiency ◽  
Sampling Theorem ◽  
Reconstruction Algorithms ◽  
Intelligent Networks ◽  
Shannon Sampling Theorem ◽  
Sensing Model ◽  
Block Compressed Sensing ◽  
The Internet Of Things

With the development of intelligent networks such as the Internet of Things, network scales are becoming increasingly larger, and network environments increasingly complex, which brings a great challenge to network communication. The issues of energy-saving, transmission efficiency, and security were gradually highlighted. Compressed sensing (CS) helps to simultaneously solve those three problems in the communication of intelligent networks. In CS, fewer samples are required to reconstruct sparse or compressible signals, which breaks the restrict condition of a traditional Nyquist–Shannon sampling theorem. Here, we give an overview of recent CS studies, along the issues of sensing models, reconstruction algorithms, and their applications. First, we introduce several common sensing methods for CS, like sparse dictionary sensing, block-compressed sensing, and chaotic compressed sensing. We also present several state-of-the-art reconstruction algorithms of CS, including the convex optimization, greedy, and Bayesian algorithms. Lastly, we offer recommendation for broad CS applications, such as data compression, image processing, cryptography, and the reconstruction of complex networks. We discuss works related to CS technology and some CS essentials.

scholarly journals HOLBP: Remote Sensing Image Registration Based on Histogram of Oriented Local Binary Pattern Descriptor

2021 ◽  
Vol 13 (12) ◽  
pp. 2328
Author(s):  
Yameng Hong ◽  
Chengcai Leng ◽  
Xinyue Zhang ◽  
Zhao Pei ◽  
Irene Cheng ◽  
...  
Keyword(s):  
Image Registration ◽  
Local Binary Pattern ◽  
Computational Time ◽  
Rotation Invariant ◽  
Edge Information ◽  
Important Research Topic ◽  
New Construction ◽  
Novel Method ◽  
Direction Information ◽  
Angle Calculation

Image registration has always been an important research topic. This paper proposes a novel method of constructing descriptors called the histogram of oriented local binary pattern descriptor (HOLBP) for fast and robust matching. There are three new components in our algorithm. First, we redefined the gradient and angle calculation template to make it more sensitive to edge information. Second, we proposed a new construction method of the HOLBP descriptor and improved the traditional local binary pattern (LBP) computation template. Third, the principle of uniform rotation-invariant LBP was applied to add 10-dimensional gradient direction information to form a 138-dimension HOLBP descriptor vector. The experimental results showed that our method is very stable in terms of accuracy and computational time for different test images.

scholarly journals A Novel Coherence Reduction Method in Compressed Sensing for DOA Estimation

2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Jing Liu ◽  
ChongZhao Han ◽  
XiangHua Yao ◽  
Feng Lian
Keyword(s):  
Compressed Sensing ◽  
Phased Array ◽  
Reduction Method ◽  
Doa Estimation ◽  
Estimation Methods ◽  
Sensing Matrix ◽  
Replacement Method ◽  
Precise Estimation ◽  
Novel Method ◽  
Measurement Vector

A novel method named as coherent column replacement method is proposed to reduce the coherence of a partially deterministic sensing matrix, which is comprised of highly coherent columns and random Gaussian columns. The proposed method is to replace the highly coherent columns with random Gaussian columns to obtain a new sensing matrix. The measurement vector is changed accordingly. It is proved that the original sparse signal could be reconstructed well from the newly changed measurement vector based on the new sensing matrix with large probability. This method is then extended to a more practical condition when highly coherent columns and incoherent columns are considered, for example, the direction of arrival (DOA) estimation problem in phased array radar system using compressed sensing. Numerical simulations show that the proposed method succeeds in identifying multiple targets in a sparse radar scene, where the compressed sensing method based on the original sensing matrix fails. The proposed method also obtains more precise estimation of DOA using one snapshot compared with the traditional estimation methods such as Capon, APES, and GLRT, based on hundreds of snapshots.

scholarly journals Azimuth Ambiguity Suppression in SAR Images Based on VS-KSVD Dictionary Learning and Compressive Sensing

2021 ◽  
Vol 2083 (3) ◽  
pp. 032049
Author(s):  
Xinchang Hu ◽  
Pengbo Wang ◽  
Yanan Guo ◽  
Qian Han ◽  
Xinkai Zhou
Keyword(s):  
Dictionary Learning ◽  
Image Interpretation ◽  
Statistical Characteristics ◽  
Sar Images ◽  
Edge Information ◽  
Frequency Domains ◽  
Under Sampling ◽  
High Resolution Images ◽  
Novel Method

Abstract The azimuth ambiguities appear widely in Synthetic Aperture Radar (SAR) images, which causes a large number of false targets and seriously affect the quality of image interpretation. Due to under-sampling in Doppler domain, ambiguous energy is mixed with energy from the main zone in the time and frequency domains. In order to effectively suppress the ambiguous energy in SAR images without loss of resolution, this paper presents a novel method of KSVD dictionary learning based on variance statistics (VS-KSVD) and compressed sensing (CS) reconstruction. According to the statistical characteristics of distributed targets, the dictionary that represents the ambiguities is selected and suppressed by coefficient weighting, in which local window filtering is carried out to remove the block effect and optimize the edge information. Finally, the high resolution images with low-ambiguity can be reconstructed by CS. With the proposed approach, the feasibility and effectiveness of the proposed approach is validated by using satellite data and simulation in suppressing azimuth ambiguity.

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.

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%.

scholarly journals Compressed sensing for electrocardiogram acquisition in wireless body sensor network: A comparative analysis

2019 ◽  
Vol 15 (7) ◽  
pp. 155014771986488 ◽  
Author(s):  
Junxin Chen ◽  
Jiazhu Xing ◽  
Leo Yu Zhang ◽  
Lin Qi
Keyword(s):  
Compressed Sensing ◽  
Sensor Network ◽  
Low Cost ◽  
Reconstruction Algorithm ◽  
Signal Acquisition ◽  
Reconstruction Algorithms ◽  
Practical Applications ◽  
Body Sensor Network ◽  
The Past ◽  
Electrocardiogram Signals

In the past decades, compressed sensing emerges as a promising technique for signal acquisition in low-cost sensor networks. For prolonging the monitoring duration of biosignals, compressed sensing is also exploited for simultaneous sampling and compression of electrocardiogram signals in the wireless body sensor network. This article presents a comprehensive analysis of compressed sensing for electrocardiogram acquisition. The performances of involved important factors, such as wavelet basis, overcomplete dictionaries, and the reconstruction algorithms, are comparatively illustrated, with the purpose to give data reference for practical applications. Drawn from a bulk of comparative experiments, the potential of compressed sensing in electrocardiogram acquisition is evaluated in different compression levels, while preferred sparsifying basis and reconstruction algorithm are also suggested. Relative perspectives and discussions are also given.

scholarly journals Energy Preserved Sampling for Compressed Sensing MRI

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Yudong Zhang ◽  
Bradley S. Peterson ◽  
Genlin Ji ◽  
Zhengchao Dong
Keyword(s):  
Compressed Sensing ◽  
Cost Function ◽  
Computation Time ◽  
Reconstruction Algorithm ◽  
Simple Random Sampling ◽  
Variable Density ◽  
Reconstruction Algorithms ◽  
Iterative Thresholding ◽  
Thresholding Algorithm

The sampling patterns, cost functions, and reconstruction algorithms play important roles in optimizing compressed sensing magnetic resonance imaging (CS-MRI). Simple random sampling patterns did not take into account the energy distribution ink-space and resulted in suboptimal reconstruction of MR images. Therefore, a variety of variable density (VD) based samplings patterns had been developed. To further improve it, we propose a novel energy preserving sampling (ePRESS) method. Besides, we improve the cost function by introducing phase correction and region of support matrix, and we propose iterative thresholding algorithm (ITA) to solve the improved cost function. We evaluate the proposed ePRESS sampling method, improved cost function, and ITA reconstruction algorithm by 2D digital phantom and 2Din vivoMR brains of healthy volunteers. These assessments demonstrate that the proposed ePRESS method performs better than VD, POWER, and BKO; the improved cost function can achieve better reconstruction quality than conventional cost function; and the ITA is faster than SISTA and is competitive with FISTA in terms of computation time.

Sign in / Sign up

Export Citation Format

Share Document