Distributed sensor data fusion with binary decision trees

A distributed sensor object recognition scheme that uses object features collected by several sensors is presented. Recognition is performed by a binary decision tree generated from a training set. The scheme does not assume the availability of any probability density functions, thus it is practical for nonparametric object recognition. Simulations have been performed for Gaussian feature objects, and some of the results are presented     

Distributed decision fusion in the presence of link failures

The problem of optimal data fusion involving detector unit communication link failures is considered. Two strategies for decision making in presence of link failures are examined and an optimal decision making scheme in the sense of the Neyman-Pearson (N-P) test is proposed. The performance of q+1 reliable links versus q reliable links are examined theoretically, as well as, numerically using the receiver operating characteristics (ROCs)     

Optimal distributed decision fusion

The problem of decision fusion in distributed sensor systems is considered. Distributed sensors pass their decisions about the same hypothesis to a fusion center that combines them into a final decision. Assuming that the sensor decisions are independent of each other for each hypothesis, the authors provide a general proof that the optimal decision scheme that maximizes the probability of detection at the fusion for fixed false alarm probability consists of a Neyman-Pearson test (or a randomized N-P test) at the fusion and likelihood-ratio tests at the sensors     

Blind adaptive decision fusion for distributed detection

We consider the problem of decision fusion in a distributed detection system. In this system, each detector makes a binary decision based on its own observation, and then communicates its binary decision to a fusion center. The objective of the fusion center is to optimally fuse the local decisions in order to minimize the final error probability. To implement such an optimal fusion center, the performance parameters of each detector (i.e., its probabilities of false alarm and missed detection) as well as the a priori probabilities of the hypotheses must be known. However, in practical applications these statistics may be unknown or may vary with time. We develop a recursive algorithm that approximates these unknown values on-line. We then use these approximations to adapt the fusion center. Our algorithm is based on an explicit analytic relation between the unknown probabilities and the joint probabilities of the local decisions. Under the assumption that the local observations are conditionally independent, the estimates given by our algorithm are shown to be asymptotically unbiased and converge to their true values at the rate of O(1/k/sup 1/2/) in the rms error sense, where k is the number of iterations. Simulation results indicate that our algorithm is substantially more reliable than two existing (asymptotically biased) algorithms, and performs at least as well as those algorithms when they work.     

Optimal multiple level decision fusion with distributed sensors

A data fusion model consisting of several levels of parallel decision fusions is considered. Global optimization of such a model is discussed to obtain the fusion rules for overall optimal performance. The reliability analysis of the proposed model is carried out to establish its superiority over the existing parallel and serial fusion models     

Performance limits of track-to-track fusion versus centralized estimation: theory and application [sensor fusion]

Track-to-track fusion is an important part in distributed multisensor-multitarget tracking. The centralized and distributed tracking configurations were studied in (H.Chen et al., Proc. of SPIE Conf. on Signal and Data Processing of Small Targets, vol. 4048, 2000) using simulated air-to-air scenarios, and in (K.C. Chang, et al, IEEE Transact. on Aerospace and Electronic Systems, vol. 33, no. 4, pp. 1271-1276, 1997) with analytical results based on /spl alpha/-/spl beta/ filters. The current work generalizes the results in the latter to the cases with more than 2 sensors. As the number of sensors increases, the performance of the distributed tracker is shown to degrade compared with the centralized estimation even when the optimal track-to-track fusion is used. An approximate track-to-track fusion is presented and compared with the optimal track-to-track fusion with performance curves for various numbers of sensors. These performance curves can be used in designing a fusion system where certain trade-offs need to be considered. Finally, these results are compared with simulation results for a realistic air-to-air encounter scenario.     

Efficient multisensor fusion using multidimensional dataassociation

We present the development of a multisensor fusion algorithm using multidimensional data association for multitarget tracking. The work is motivated by a large scale surveillance problem, where observations from multiple asynchronous sensors with time-varying sampling intervals (electronically scanned array (ESA) radars) are used for centralized fusion. The combination of multisensor fusion with multidimensional assignment is done so as to maximize the “time-depth” in addition to “sensor-width” for the number S of lists handled by the assignment algorithm. The standard procedure, which associates measurements from the most recently arrived S-1 frames to established tracks, can have, in the case of S sensors, a time-depth of zero. A new technique, which guarantees maximum effectiveness for an S-dimensional data association (S⩾3), i.e., maximum time-depth (S-1) for each sensor without sacrificing the fusion across sensors, is presented. Using a sliding window technique (of length S), the estimates are updated after each frame of measurements. The algorithm provides a systematic approach to automatic track formation, maintenance, and termination for multitarget tracking using multisensor fusion with multidimensional assignment for data association. Estimation results are presented for simulated data for a large scale air-to-ground target tracking problem     

Distributed weather radar using X-band active arrays

Dense networks of short-range radars capable of mapping storms and detecting atmospheric and airborne hazards are described. Comprised of physically small, low-power antennas, these networks defeat the Earth curvature blockage that limits today's long-range radar networks and enable high resolution views that extend from the lower-troposphere to the tops of storms. The networks are comprised of 1-meter antennas that transmit 10's of W peak power and are capable of high-speed electronic beam-steering. A system architecture is described that maximizes the value accrued to users of radar data through utility functions that specify dynamic, optimal allocation of resources in response to the needs of multiple end-users and associated information retrieval algorithms.     

Maneuver estimation using measurements of orientation

An image-based algorithm which provides an estimate of the current radial acceleration of a target is studied. Since the data in a single image frame provide information only on the orientation of the target, a sequence of frames must be processed to detect maneuvers. The estimation problem is parameterized in terms of natural groupings of measurement errors, and the influence of these errors on estimator fidelity is studied     

利用重要性采样的时差-频差联合估计算法

针对无源定位中参考信号真实值未知的时差(TDOA)-频差(FDOA)联合估计问题,构建了一种新的时差-频差最大似然(ML)估计模型,并采用重要性采样(IS)方法求解似然函数极大值,得到时差-频差联合估计。算法通过生成时差-频差样本,并统计样本加权均值得到估计值,克服了传统互模糊函数(CAF)算法只能得到时域和频域采样间隔整数倍估计值的问题,且不存在期望最大化(EM)等迭代算法的初值依赖和收敛问题。推导了时差-频差联合估计的克拉美罗下界(CRLB),并通过仿真实验表明,算法的计算复杂度适中,估计精度优于CAF算法和EM算法,在不同信噪比条件下估计误差接近CRLB。     

Passive target tracking using maximum likelihood estimation

Estimation of target trajectory from passive sonar bearings and frequency measurements in the presence of multivariate normally distributed noise, with unknown inhomogeneous general covariance, is modeled as a nonlinear multiresponse parameter estimation problem. It is shown that maximum likelihood estimation in this case is identical to optimizing a determinant criterion which has a concise form and contains no elements of unknown covariance matrix. A Gauss-Newton type algorithm using only the first-order derivatives of the model function and a new convergence criterion, is presented to implement such estimation. The simulation results demonstrate that performance of the maximum likelihood estimation method with the above noise model is superior to that with the traditional noise assumption     

The workshop on estimation, tracking and fusion: a tribute toYaakov Bar-Shalom

The subject of this article, the 4th ONR/GTRI Workshop on Target Tracking and Sensor Fusion was held at the Naval Postgraduate School in Monterey, California in May 2001. The people who meet at this share a common interest in and around the tracking area, and perforce owe much to Yaakov. On the day following the workshop, most of the participants moved across the NPS campus for The Workshop on Estimation, Tracking and Fusion: A Tribute to Yaakov Bar-Shalom, a remarkable two-part event in honor of Yaakov's 50th birthday     

Efficient fault tolerant estimation using the IMM methodology

Space systems are characterized by a low-intensity process noise resulting from uncertain forces and moments. In many cases, their scalar measurement channels can be assumed to be independent, with one-dimensional internal dynamics. The nominal operation of these systems can be severely damaged by faults in the sensors. A natural method that can be used to yield fault tolerant estimates of such systems is the interacting multiple model (IMM) filtering algorithm, which is known to provide very accurate results. However, having been derived for a general class of systems with switching parameters, the IMM filter does not utilize the independence of the measurement errors in different channels, nor does it exploit the fact that the process noise is of low intensity. Thus, the implementation of the IMM in this case is computationally expensive. A new estimation technique is proposed herein, that explicitly utilizes the aforementioned properties. In the resulting estimation scheme separate measurement channels are handled separately, thus reducing the computational complexity. It is shown that, whereas the IMM complexity is exponential in the number of fault-prone measurements, the complexity of the proposed technique is polynomial. A simulation study involving spacecraft attitude estimation is carried out. This study shows that the proposed technique closely approximates the full-blown IMM algorithm, while requiring only a modest fraction of the computational cost.     

Spacecraft attitude/rate estimation using vector-aided GPSobservations

A sequential filtering algorithm is presented for spacecraft attitude and attitude-rate estimation from Global Positioning System (GPS) differential carrier phase measurements. A third-order, minimal-parameter method for solving the attitude matrix kinematic equation is used to parameterize the state of the filter, which renders the resulting estimator computationally efficient. Borrowing from tracking theory concepts, the angular acceleration is modeled as an exponentially autocorrelated stochastic process, thus avoiding the use of the uncertain spacecraft dynamic model. The new formulation facilitates the use of aiding vector observations in a unified filtering algorithm, which can enhance the robustness and accuracy of the method. Numerical examples are used to demonstrate the performance of the method     

Aircraft flight parameter estimation using acoustic multipath delays

The signal emitted by an airborne acoustic source arrives at a stationary sensor located above a flat ground via a direct path and a ground-reflected path. The difference in the times of arrival of the direct path and ground-reflected path signal components, referred to as the multipath delay, provides an instantaneous estimate of the elevation angle of the source. A model is developed to predict the variation with time of the multipath delay for a jet aircraft or other broadband acoustic source in level flight with constant velocity over a hard ground. Based on this model, two methods are formulated to estimate the speed and altitude of the aircraft Both methods require the estimation of the multipath delay as a function of time. The methods differ only in the way the multipath delay is estimated; the first method uses the autocorrelation function, and the second uses the cepstrum, of the sensor output over a short time interval. The performances of both methods are evaluated and compared using real acoustic data. The second method provides the most precise aircraft speed and altitude estimates as compared with the first and two other existing methods.     

Mini-UAV altitude estimation using an inertially stabilized payload

A novel method is introduced for autonomous attitude estimation of a mini unmanned aerial vehicle (UAV) carrying an inertially stabilized payload. The method is based on utilizing the outputs of rate gyros normally used to inertially stabilize the payload, and other data that is normally available from conventional aircraft-mounted sensors. A decentralized estimation algorithm is developed, which uses the aircraft/payload mathematical models to bound the estimation errors. Exploiting modern multiprocessor computer technology, the new estimation algorithm comprises two parallel extended Kalman filters (EKFs) and a data fusion algorithm. Real-time experimental tests, incorporating a payload model with real rate gyros mounted on a three-axis flight table, have validated the feasibility of the concept. The theoretical and experimental investigation demonstrates that the estimation algorithm is capable of estimating the attitude angles with an estimation error not exceeding 1 deg, at output rates of 13 Hz, thus constituting a viable substitute for the conventional vertical gyroscope     

State estimation using an approximate reduced statistics algorithm

The problem of state estimation using nonlinear additive Gaussian noise measurements is addressed. A geometric model for the posterior state density is assumed based on a multidimensional Haar basis representation. An approximate reduced statistics (ARS) algorithm, suggested by the parameter estimator of Kulhavy is then developed, using successive minimization of relative entropy between model densities and an approximate posterior density. The state estimator thus derived is applied to a bearings-only target tracking problem in a multiple sensor scenario     

Recursive estimation of radar biases using electronic charts

This work describes the application of the extended Kalman filter (EKF) to the estimation of range and bearing biases in marine radars by performing a map-matching between the data from hydrographic charts and the radar images. By defining at least two corresponding points from the radar image and the electronic charts, the technique provides a rapid and accurate calibration in range and bearing, giving also estimates for the speed, heading, latitude, and longitude of the ship. The method is tested with simulated data to check convergence and later with real data obtained from a navigation console installed on a patrol boat The technique does not require GPS nor speed information from the ship log unit, however it is shown that their inclusion can improve the estimation.     

图像融合技术检测低可观测目标评述

阐明了利用图像信息空间覆盖范围大的特点,运用图像融合的手段来对低可观测目标进行检测.通过综合处理来自多个传感器图像包含的检测对象信息、环境特性信息、运动信息、空间信息、时间信息,获得的融合信息包含任何单一传感器无法提供的信息,进而提高检测性能.扼要介绍了像素层图像融合、特征层图像融合以及符号层图像融合的基本概念.列举了图像融合技术一些应用实例,阐述了用图像融合技术检测低可观测目标的优点.着重强调了检测低可观测目标需要进一步研究的问题.