Do you want to publish a course? Click here

Target Localization with Jammer Removal Using Frequency Diverse Array

71   0   0.0 ( 0 )
 Added by Qi Liu
 Publication date 2019
and research's language is English




Ask ChatGPT about the research

A foremost task in frequency diverse array multiple-input multiple-output (FDA-MIMO) radar is to efficiently obtain the target signal in the presence of interferences. In this paper, we employ a novel low-rank + low-rank + sparse decomposition model to extract the low-rank desired signal and suppress the jamming signals from both barrage and burst jammers. In the literature, the barrage jamming signals, which are intentionally interfered by enemy jammer radar, are usually assumed Gaussian distributed. However, such assumption is oversimplified to hold in practice as the interferences often exhibit non-Gaussian properties. Those non-Gaussian jamming signals, known as impulsive noise or burst jamming, are involuntarily deviated from friendly radar or other working radio equipment including amplifier saturation and sensor failures, thunderstorms and man-made noise. The estimation performance of the existing estimators, relied crucially on the Gaussian noise assumption, may degrade substantially since the probability density function (PDF) of burst jamming has heavier tails that exceed a few standard deviations than the Gaussian distribution. To capture a more general signal model with burst jamming in practice, both barrage jamming and burst jamming are included and a two-step Go Decomposition (GoDec) method via alternating minimization is devised for such mixed jamming signal model, where the $a$ $priori$ rank information is exploited to suppress two kinds of jammers and estimate the desired target. Simulation results verify the robust performance of the devised scheme.



rate research

Read More

When the direct view between the target and the observer is not available, due to obstacles with non-zero sizes, the observation is received after reflection from a reflector, this is the indirect view or Non-Line-Of Sight condition. Localization of a target in NLOS condition still one of the open problems yet. In this paper, we address this problem by localizing the reflector and the target simultaneously using a single stationary receiver, and a determined number of beacons, in which their placements are also analyzed in an unknown map. The work is done in mirror space, when the receiver is a camera, and the reflector is a planar mirror. Furthermore, the distance from the observer to the target is estimated by size constancy concept, and the angle of coming signal is the same as the orientation of the camera, with respect to a global frame. The results show the validation of the proposed work and the simulation results are matched with the theoretical results.
We consider the relaying application of unmanned aerial vehicles (UAVs), in which UAVs are placed between two transceivers (TRs) to increase the throughput of the system. Instead of studying the placement of UAVs as pursued in existing literature, we focus on investigating the placement of a jammer or a major source of interference on the ground to effectively degrade the performance of the system, which is measured by the maximum achievable data rate of transmission between the TRs. We demonstrate that the optimal placement of the jammer is in general a non-convex optimization problem, for which obtaining the solution directly is intractable. Afterward, using the inherent characteristics of the signal-to-interference ratio (SIR) expressions, we propose a tractable approach to find the optimal position of the jammer. Based on the proposed approach, we investigate the optimal positioning of the jammer in both dual-hop and multi-hop UAV relaying settings. Numerical simulations are provided to evaluate the performance of our proposed method.
Scalable and decentralized algorithms for Cooperative Self-localization (CS) of agents, and Multi-Target Tracking (MTT) are important in many applications. In this work, we address the problem of Simultaneous Cooperative Self-localization and Multi-Target Tracking (SCS-MTT) under target data association uncertainty, i.e., the associations between measurements and target tracks are unknown. Existing CS and tracking algorithms either make the assumption of no data association uncertainty or employ a hard-decision rule for measurement-to-target associations. We propose a novel decentralized SCS-MTT method for an unknown and time-varying number of targets under association uncertainty. Marginal posterior densities for agents and targets are obtained by an efficient belief propagation (BP) based scheme while data association is handled by marginalizing over all target-to-measurement association probabilities. Decentralized single Gaussian and Gaussian mixture implementations are provided based on average consensus schemes, which require communication only with one-hop neighbors. An additional novelty is a decentralized Gibbs mechanism for efficient evaluation of the product of Gaussian mixtures. Numerical experiments show the improved CS and MTT performance compared to the conventional approach of separate localization and target tracking.
The world is moving towards faster data transformation with more efficient localization of a user being the preliminary requirement. This work investigates the use of a deep learning technique for wireless localization, considering both millimeter-wave (mmWave) and sub-6 GHz frequencies. The capability of learning a new neural network model makes the localization process easier and faster. In this study, a Deep Neural Network (DNN) was used to localize User Equipment (UE) in two static scenarios. We propose two different methods to train a neural network, one using channel parameters (features) and another using a channel response vector and compare their performances using preliminary computer simulations. We observe that the former approach produces high localization accuracy considering that all of the users have a fixed number of multipath components (MPCs), this method is reliant on the number of MPCs. On the other hand, the latter approach is independent of the MPCs, but it performs relatively poorly compared to the first approach.
Due to the lack of a large-scale reflection removal dataset with diverse real-world scenes, many existing reflection removal methods are trained on synthetic data plus a small amount of real-world data, which makes it difficult to evaluate the strengths or weaknesses of different reflection removal methods thoroughly. Furthermore, existing real-world benchmarks and datasets do not categorize image data based on the types and appearances of reflection (e.g., smoothness, intensity), making it hard to analyze reflection removal methods. Hence, we construct a new reflection removal dataset that is categorized, diverse, and real-world (CDR). A pipeline based on RAW data is used to capture perfectly aligned input images and transmission images. The dataset is constructed using diverse glass types under various environments to ensure diversity. By analyzing several reflection removal methods and conducting extensive experiments on our dataset, we show that state-of-the-art reflection removal methods generally perform well on blurry reflection but fail in obtaining satisfying performance on other types of real-world reflection. We believe our dataset can help develop novel methods to remove real-world reflection better. Our dataset is available at https://alexzhao-hugga.github.io/Real-World-Reflection-Removal/.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا