Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMeasurement-Level Fusion for OTHR Network Using Message Passing
80
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Tracking an unknown number of targets based on multipath measurements provided by an over-the-horizon radar (OTHR) network with a statistical ionospheric model is complicated, which requires solving four subproblems: target detection, target tracking, multipath data association and ionospheric height identification. A joint solution is desired since the four subproblems are highly correlated, but suffering from the intractable inference problem of high-dimensional latent variables. In this paper, a unified message passing approach, combining belief propagation (BP) and mean-field (MF) approximation, is developed for simplifying the intractable inference. Based upon the factor graph corresponding to a factorization of the joint probability distribution function (PDF) of the latent variables and a choice for a separation of this factorization into BP region and MF region, the posterior PDFs of continuous latent variables including target kinematic state, target visibility state, and ionospheric height, are approximated by MF due to its simple MP update rules for conjugate-exponential models. With regard to discrete multipath data association which contains one-to-one frame (hard) constraints, its PDF is approximated by loopy BP. Finally, the approximated posterior PDFs are updated iteratively in a closed-loop manner, which is effective for dealing with the coupling issue among target detection, target tracking, multipath data association, and ionospheric height identification. Meanwhile, the proposed approach has the measurement-level fusion architecture due to the direct processing of the raw multipath measurements from an OTHR network, which is benefit to improving target tracking performance. Its performance is demonstrated on a simulated OTHR network multitarget tracking scenario.
rate research
Read More
Compressed sensing (CS) deals with the problem of reconstructing a sparse vector from an under-determined set of observations. Approximate message passing (AMP) is a technique used in CS based on iterative thresholding and inspired by belief propagation in graphical models. Due to the high transmission rate and a high molecular absorption, spreading loss and reflection loss, the discrete-time channel impulse response (CIR) of a typical indoor THz channel is very long and exhibits an approximately sparse characteristic. In this paper, we develop AMP based channel estimation algorithms for indoor THz communications. The performance of these algorithms is compared to the state of the art. We apply AMP with soft- and hard-thresholding. Unlike the common applications in which AMP with hard-thresholding diverges, the properties of the THz channel favor this approach. It is shown that THz channel estimation via hard-thresholding AMP outperforms all previously proposed methods and approaches the oracle based performance closely.
Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it does not work well for a generic measurement matrix, which may cause AMP to diverge. Damped AMP has been used for SBL to alleviate the problem at the cost of reducing convergence speed. In this work, we propose a new SBL algorithm based on structured variational inference, leveraging AMP with a unitary transformation (UAMP). Both single measurement vector and multiple measurement vector problems are investigated. It is shown that, compared to state-of-the-art AMP-based SBL algorithms, the proposed UAMP-SBL is more robust and efficient, leading to remarkably better performance.
Non-uniform message quantization techniques such as reconstruction-computation-quantization (RCQ) improve error-correction performance and decrease hardware complexity of low-density parity-check (LDPC) decoders that use a flooding schedule. Layered MinSum RCQ (L-msRCQ) enables message quantization to be utilized for layered decoders and irregular LDPC codes. We investigate field-programmable gate array (FPGA) implementations of L-msRCQ decoders. Three design methods for message quantization are presented, which we name the Lookup, Broadcast, and Dribble methods. The decoding performance and hardware complexity of these schemes are compared to a layered offset MinSum (OMS) decoder. Simulation results on a (16384, 8192) protograph-based raptor-like (PBRL) LDPC code show that a 4-bit L-msRCQ decoder using the Broadcast method can achieve a 0.03 dB improvement in error-correction performance while using 12% fewer registers than the OMS decoder. A Broadcast-based 3-bit L-msRCQ decoder uses 15% fewer lookup tables, 18% fewer registers, and 13% fewer routed nets than the OMS decoder, but results in a 0.09 dB loss in performance.
Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it where only a small number of matches between the vertices of the two graphs are possible. We propose a new message passing algorithm that allows us to compute, very efficiently, approximate solutions to the sparse network alignment problems with graph sizes as large as hundreds of thousands of vertices. We also provide extensive simulations comparing our algorithms with two of the best solvers for network alignment problems on two synthetic matching problems, two bioinformatics problems, and three large ontology alignment problems including a multilingual problem with a known labeled alignment.
This paper considers the problem of detecting and tracking multiple maneuvering targets, which suffers from the intractable inference of high-dimensional latent variables that include target kinematic state, target visibility state, motion mode-model association, and data association. A unified message passing algorithm that combines belief propagation (BP) and mean-field (MF) approximation is proposed for simplifying the intractable inference. By assuming conjugate-exponential priors for target kinematic state, target visibility state, and motion mode-model association, the MF approximation decouples the joint inference of target kinematic state, target visibility state, motion mode-model association into individual low-dimensional inference, yielding simple message passing update equations. The BP is exploited to approximate the probabilities of data association events since it is compatible with hard constraints. Finally, the approximate posterior probability distributions are updated iteratively in a closed-loop manner, which is effective for dealing with the coupling issue between the estimations of target kinematic state and target visibility state and decisions on motion mode-model association and data association. The performance of the proposed algorithm is demonstrated by comparing with the well-known multiple maneuvering target tracking algorithms, including interacting multiple model joint probabilistic data association, interacting multiple model hypothesis-oriented multiple hypothesis tracker and multiple model generalized labeled multi-Bernoulli.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
