Allocating the weight to each local density is essential in generalized covariance intersection (GCI) fusion. However, such a problem has not been fully addressed in the existing literature and still remains an open issue. In this paper, we propose a deep learning enhanced framework that dynamically optimizes GCI fusion weights by leveraging sensor node dependent local variables, resulting in the GCINet for fusion of probability density functions (PDFs). The key innovation lies in the employment of contextual based variables (e.g., measurement noise) as input to a neural network, which is trained by minimizing a suitably defined cost function. The proposed approach eliminates the need for manual weight tuning and overcomes the limitations of traditional optimization-based methods reliant on, e.g., Shannon entropy or Chernoff information. Application of proposed GCINet to distributed extended object tracking (EOT) application is discussed. Simulation results show that the proposed GCINet achieves superior accuracy compared to GCI fusion under equal as well as heuristically designed fusion weights.

This paper discusses the problem of streaming coupled tensor factorization based on sensor networks, where each sensor observes only some features of the targets, and the measurements from sensors are provided in a streaming tensor fashion. Moreover, the observed features of different sensors might overlap (i.e., coupled tensor), and there is no central processing unit to collect all sensor data. Then, in our work, the canonical polyadic (CP) decomposition is exploited to perform local tensor decomposition based on the measurements of each sensor, and average consensus (AC) for diffusing information throughout the network. The proposed method is verified via simulations.

Passive location and tracking of radio emitters is of great research value in civilian and defense applications. Among the existing methods, localization based on received signal strength indicator (RSSI) has been widely used due to its advantages in terms of low cost and easy implementation. However, most RSSI-based localization methods rely on the assumption that the emitter has been detected. Moreover, the emitter signal is supposed to propagate with the simplified path-loss model in which the shadow effects caused by obstacles are not considered. As a result, there are still gaps between the aforementioned methods and practical applications. In this paper, we consider the combined path-loss and shadowing model, which has been empirically confirmed in both outdoor and indoor radio propagation environments. Joint detection and tracking of an emitter is proposed by modeling the state of the emitter as Bernoulli random finite set, characterized by an existence probability and a spatial probability density function. Compared to existing studies, this paper works upon more practically appealing signal propagation model, and achieves better performance in real-time emitter detection and tracking. Moreover, the proposed method also provides explicit estimates of the unknown shadowing-related parameters, which can be adopted in further applications such as spectrum cartography and radio map construction. The feasibility of the proposed method is assessed via simulation experiments.

Target state estimation with Doppler-only sensors has attracted a lot of attention due to its wide potential applications in target localization and tracking. While existing Doppler-only tracking methods rely on the assumption that Doppler sensors have been correctly registered, in many practical cases there can be significant registration errors which imply measurement biases and thus performance degradation in target state estimation. Motivated by this issue, the present paper addresses the problem of jointly estimating target state and sensor biases based on Doppler-only measurements. The proposed method consists of two phases, i.e., (1) raw estimation of the target state without considering sensor biases, followed by (2) a bias compensation step that relies on linearization of the measurement function and joint estimation of target state-sensor biases via a least square method. The Cramer-Rao lower bound (CRLB) in estimating sensor biases is evaluated and the performance of the proposed method is also assessed via simulations.

A B-Spline implementation of the multi-target multi-Bernoulli (MeMBer) filter for nonlinear Gaussian/non-Gaussian models is proposed. Specifically, the spatial PDF (SPDF) of each Bernoulli component in the MeMBer density is represented by a B-Spline curve, which is characterized by the spline knots and control points. The spline knots and control points are then propagated via prediction and update steps of the MeMBer filter. Besides, a revised fitting algorithm is proposed so as to improve the implementation efficiency. The effectiveness of the proposed method is assessed via simulation experiments.

This paper focuses on reducing communication bandwidth and, consequently, energy consumption in the context of distributed target detection and tracking over a peer-to-peer sensor network. A consensus Bernoulli filter with event-triggered communication is developed by enforcing each node to transmit its local information to the neighbors only when a suitable measure of discrepancy between the current local posterior and the one predictable from the last transmission exceeds a preset threshold. Two information-theoretic criteria, i.e. Kullback-Leibler divergence and Hellinger distance, are adopted in order to measure the discrepancy between random finite set densities. The performance of the proposed event-triggered consensus Bernoulli filter is evaluated through simulation experiments.

In this paper, consensus-based Kalman filtering is extended to deal with the problem of joint target tracking and sensor self-localization in a distributed wireless sensor network. The average weighted Kullback-Leibler divergence, which is a function of the unknown drift parameters, is employed as the cost to measure the discrepancy between the fused posterior distribution and the local distribution at each sensor. Further, a reasonable approximation of the cost is proposed and an online technique is introduced to minimize the approximated cost function with respect to the drift parameters stored in each node. The remarkable features of the proposed algorithm are that it needs no additional data exchanges, slightly increased memory space and computational load comparable to the standard consensus-based Kalman filter. Finally, the effectiveness of the proposed algorithm is demonstrated through simulation experiments on both a tree network and a network with cycles as well as for both linear and nonlinear sensors.