scholarly journals Cross Validation Based Distributed Greedy Sparse Recovery for Multiview Through-the-Wall Radar Imaging

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Lele Qu ◽  
Shimiao An ◽  
Yanpeng Sun
Keyword(s):  
Cross Validation ◽  
Matching Pursuit ◽  
Measurement Data ◽  
Radar Imaging ◽  
Sparse Recovery ◽  
Imaging Algorithm ◽  
Recovery Algorithm ◽  
Recovery Error ◽  
Cv Measurements ◽  
Imaging Performance

Multiview through-the-wall radar imaging (TWRI) can improve the imaging quality and target detection by exploiting the measurement data acquired from various views. Based on the established joint sparsity signal model for multiview TWRI, a cross validation (CV) based distributed greedy sparse recovery algorithm which combines the strengths of the CV technique and censored simultaneous orthogonal matching pursuit algorithm (CSOMP) is proposed in this paper. The developed imaging algorithm named by CV-CSOMP which separates the total measurements into reconstruction measurements and CV measurements is able to achieve the accurate imaging reconstruction and estimation of recovery error tolerance by the iterative CSOMP calculation. The proposed CV-CSOMP imaging algorithm not only can reduce the communication costs among radar units, but also can provide the desirable imaging performance without the prior information such as the sparsity or noise level. The experimental results have verified the validity and effectiveness of the proposed imaging algorithm.

Adaptive Sparse Recovery of Moving Targets for Distributed MIMO Radar

2014 ◽  
Vol 933 ◽  
pp. 450-455
Author(s):  
Hui Yu ◽  
Guang Hua Lu ◽  
Hai Long Zhang
Keyword(s):  
High Resolution ◽  
Sparse Recovery ◽  
Mimo Radar ◽  
Moving Target ◽  
Recovery Algorithm ◽  
Low Snr ◽  
Computation Efficiency ◽  
Target Imaging ◽  
Moving Target Imaging ◽  
Recovery Error

The high resolution and better recovery performance with distributed MIMO radar would be significantly degraded when the target moves at an unknown velocity. In this paper, we propose an adaptive sparse recovery algorithm for moving target imaging to estimate the velocity and image jointly with high computation efficiency. With an iteration mechanism, the proposed method updates the image and estimates the velocity alternately by sequentially minimizing the norm and the recovery error. Numerical simulations are carried out to demonstrate that the proposed algorithm can retrieve high-resolution image and accurate velocity simultaneously even in low SNR.

scholarly journals MIMO Radar Imaging Based on Smoothedl0Norm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Jun-Jie Feng ◽  
Gong Zhang ◽  
Fang-Qing Wen
Keyword(s):  
Matching Pursuit ◽  
Signal Reconstruction ◽  
Reconstruction Algorithm ◽  
Radar Imaging ◽  
Mimo Radar ◽  
Hyperbolic Tangent ◽  
Imaging Algorithm ◽  
Two Dimensional Image ◽  
Tangent Function

For radar imaging, a target usually has only a few strong scatterers which are sparsely distributed. In this paper, we propose a compressive sensing MIMO radar imaging algorithm based on smoothedl0norm. An approximate hyperbolic tangent function is proposed as the smoothed function to measure the sparsity. A revised Newton method is used to solve the optimization problem by deriving the new revised Newton directions for the sequence of approximate hyperbolic tangent functions. In order to improve robustness of the imaging algorithm, main value weighted method is proposed. Simulation results show that the proposed algorithm is superior to Orthogonal Matching Pursuit (OMP), smoothedl0method (SL0), and Bayesian method with Laplace prior in performance of sparse signal reconstruction. Two-dimensional image quality of MIMO radar using the new method has great improvement comparing with aforementioned reconstruction algorithm.

scholarly journals Hierarchical Multi-User Detection for Highly Overloaded Uplink Grant-Free NOMA

2021 ◽  
Author(s):  
Shah Mahdi Hasan ◽  
Kaushik Mahata ◽  
Md Mashud Hyder
Keyword(s):  
Phase 1 ◽  
Sparse Recovery ◽  
Second Phase ◽  
Sensing Matrix ◽  
Recovery Algorithm ◽  
Spreading Sequence ◽  
Active User ◽  
Machine Type Communication ◽  
Two Phases ◽  
Limited Spectrum

Grant-Free Non Orthogonal Multiple Access (NOMA) offers promising solutions to realize uplink (UL) massive Machine Type Communication (mMTC) using limited spectrum resources, while reducing signalling overhead. Because of the sparse, sporadic activities exhibited by the user equipments (UE), the active user detection (AUD) problem is often formulated as a compressive sensing problem. In line of that, greedy sparse recovery algorithms are spearheading the development of compressed sensing based multi-user detectors (CS-MUD). However, for a given number of resources, the performance of CS-MUD algorithms are fundamentally limited at higher overloading of NOMA. To circumvent this issue, in this work, we propose a two-stage hierarchical multi-user detection framework, where the UEs are randomly assigned to some pre-defined clusters. The active UEs split their data transmission frame into two phases. In the first phase an UE uses the sinusoidal spreading sequence (SS) of its cluster. In the second phase the UE uses its own unique random SS. At phase 1 of detection, the active clusters are detected, and a reduced sensing matrix is constructed. This matrix is used in Phase 2 to recover the active UE indices using some sparse recovery algorithm. Numerical investigations validate the efficacy of the proposed algorithm in highly overloaded scenarios.

scholarly journals Bistatic Radar Coincidence Imaging Based on Multiple Measurement Vectors for Rotating Cone-Shaped Targets

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Rui Li ◽  
Ying Luo ◽  
Qun Zhang ◽  
Yijun Chen ◽  
Jia Liang
Keyword(s):  
Bayesian Learning ◽  
Radar Imaging ◽  
Bistatic Radar ◽  
Target Feature ◽  
Multiple Measurement ◽  
Multiple Measurement Vectors ◽  
Feature Information ◽  
Coincidence Imaging ◽  
Rotating Cone ◽  
Imaging Performance

Bistatic radar imaging can overcome limitations of monostatic radar imaging and obtain abundant target feature information; thus, it is followed with interest. Different from bistatic inverse synthetic aperture radar (Bi-ISAR) imaging, bistatic radar coincidence imaging (Bi-RCI) provides a new tack on the bistatic radar imaging technique. In this paper, a Bi-RCI based on multiple measurement vectors (MMV) for rotating cone-shaped targets is proposed to realize Bi-RCI coherent processing and improve imaging performance. Based on the mixed mode signals, a MMV parametric model is established and measurement number coarse selection is proposed. Finally, a modified sparse Bayesian learning (MSBL) algorithm is introduced to reconstruct the target image. Simulation results demonstrate the validity and the superiority of the proposed method.

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.

scholarly journals An Accurate Sparse Recovery Algorithm for Range-Angle Localization of Targets via Double-Pulse FDA-MIMO Radar

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Qi Liu ◽  
Xianpeng Wang ◽  
Liangtian Wan ◽  
Mengxing Huang ◽  
Lu Sun
Keyword(s):  
Sparse Recovery ◽  
Mimo Radar ◽  
Double Pulse ◽  
Grid Refinement ◽  
Recovery Algorithm ◽  
Refinement Method ◽  
Overcomplete Dictionary ◽  
Atomic Correlation ◽  
Svd Method ◽  
Zero Frequency

In this paper, a sparse recovery algorithm based on a double-pulse FDA-MIMO radar is proposed to jointly extract the angle and range estimates of targets. Firstly, the angle estimates of targets are calculated by transmitting a pulse with a zero frequency increment and employing the improved l 1 -SVD method. Subsequently, the range estimates of targets are achieved by utilizing a pulse with a nonzero frequency increment. Specifically, after obtaining the angle estimates of targets, we perform dimensionality reduction processing on the overcomplete dictionary to achieve the automatically paired range and angle in range estimation. Grid partition will bring a heavy computational burden. Therefore, we adopt an iterative grid refinement method to alleviate the above limitation on parameter estimation and propose a new iteration criterion to improve the error between real parameters and their estimates to get a trade-off between the high-precision grid and the atomic correlation. Finally, the proposed algorithm is evaluated by providing the results of the Cramér-Rao lower bound (CRLB) and numerical root mean square error (RMSE).

scholarly journals A Fast Sparse Recovery Algorithm for Compressed Sensing Using Approximate l0 Norm and Modified Newton Method

Materials ◽  
2019 ◽  
Vol 12 (8) ◽  
pp. 1227 ◽  
Author(s):  
Dingfei Jin ◽  
Yue Yang ◽  
Tao Ge ◽  
Daole Wu
Keyword(s):  
Compressed Sensing ◽  
Newton Method ◽  
Simulation Experiment ◽  
Sparse Recovery ◽  
Signal Recovery ◽  
Recovery Efficiency ◽  
Recovery Algorithm ◽  
Modified Newton Method ◽  
Computer Simulation Experiment ◽  
Recovery Algorithms

In this paper, we propose a fast sparse recovery algorithm based on the approximate l0 norm (FAL0), which is helpful in improving the practicability of the compressed sensing theory. We adopt a simple function that is continuous and differentiable to approximate the l0 norm. With the aim of minimizing the l0 norm, we derive a sparse recovery algorithm using the modified Newton method. In addition, we neglect the zero elements in the process of computing, which greatly reduces the amount of computation. In a computer simulation experiment, we test the image denoising and signal recovery performance of the different sparse recovery algorithms. The results show that the convergence rate of this method is faster, and it achieves nearly the same accuracy as other algorithms, improving the signal recovery efficiency under the same conditions.

Sign in / Sign up

Export Citation Format

Share Document