On optimal track-to-track fusion

Track-to-track fusion is an important part in multisensor fusion. Much research has been done in this area. Chong et al. (1979, 1986, 1990) among others, presented an optimal fusion formula under an arbitrary communication pattern. This formula is optimal when the underlying systems are deterministic, i.e., the process noise is zero, or when full-rate communication (two sensors exchange information each time they receive new measurements) is employed. However, in practice, the process noise is not negligible due to target maneuvering and sensors typically communicate infrequently to save communication bandwidth. In such situations, the measurements from two sensors are not conditionally (given the previous target state) independent due to the common process noise from the underlying system, and the fusion formula becomes an approximate one. This dependence phenomena was also observed by Bar-Shalom (1981) where a formula was derived to compute the cross-covariance of two track estimates obtained by different sensors. Based on this results a fusion formula was subsequently derived (1986) to combine the local estimates which took into account the dependency between the two estimates. Unfortunately, the Bayesian derivation made an assumption that is not met. This work points out the implicit approximation made and shows that the result turns out to be optimal only in the ML (maximum likelihood) sense. A performance evaluation technique is then proposed to study the performance of various track-to-track fusion techniques. The results provide performance bounds of different techniques under various operating conditions which can be used in designing a fusion system.     

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.     

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 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     

Star trackers for attitude determination

One problem comes to all spacecrafts using vector information. That is the problem of determining the attitude. This paper describes how the area of attitude determination instruments has evolved from simple pointing devices into the latest technology, which determines the attitude by utilizing a CCD camera and a powerful microcomputer. The instruments are called star trackers and they are capable of determining the attitude with an accuracy better than 1 arcsecond. The concept of the star tracker is explained. The obtainable accuracy is calculated, the numbers of stars to be included in the star catalogue are discussed and the acquisition of the initial attitude is explained. Finally the commercial market for star trackers is discussed     

Geometric voting algorithm for star trackers

We present an algorithm for recovering the orientation (attitude) of a satellite-based camera. The algorithm matches stars in an image taken with the camera to stars in a star catalogue. The algorithm is based on a geometric voting scheme in which a pair of stars in the catalogue votes for a pair of stars in the image if the angular distance between the stars of both pairs is similar. As angular distance is a symmetric relationship, each of the two catalogue stars votes for each of the image stars. The identity of each star in the image is set to the identity of the catalogue star that cast the most votes. Once the identity of the stars is determined, the attitude of the camera is computed using a quaternion-based method. We further present a fast tracking algorithm that estimates the attitude for subsequent images after the first algorithm has terminated successfully. Our method runs in comparable speed to state of the art algorithms but is still more robust than them. The system has been implemented and tested on simulated data and on real sky images.     

Global node selection for localization in a distributed sensor network

This work considers the problem of selecting the best nodes for localizing (in the mean squared (MS) position error sense) a target in a distributed wireless sensor network. Each node consists of an array of sensors that are able to estimate the direction of arrival (DOA) to a target. Different computationally efficient node selection approaches that use global network knowledge are introduced. Performance bounds based on the node/target geometry are derived, and these bounds help to determine the necessary communication reach of the active nodes. The resulting geolocation performance and energy usage, based on communication distance, is evaluated for a decentralized extended Kalman filter (EKF) that is exploiting the different selection approaches.     

Local node selection for localization in a distributed sensor network

This paper discusses a new localized resource manager for a wireless sensor network of bearings-only sensors. Specifically, each node uses knowledge of the target under surveillance to determine whether it should actively collect measurements and how far to disseminate the data in order for the sensor network to maintain track of the target. At each node, the resource manager requires only knowledge of the relative location to the target for itself and the active nodes from the previous snapshot. The decentralized strategy represents a modification to the global node selection (GNS) method that exploits knowledge of the location of all nodes in the network. Simulations show that despite the lack of global network knowledge, the new localized management method is almost as effective as GNS in terms of balancing the tradeoff between energy usage and localization accuracy.     

Smart sensor Web: tactical battlefield visualization using sensor fusion

Smart sensor Web (SSW) is a recent DUSD (S&T) initiative inspired by extraordinary technological advances in sensors and microelectronics and by the emergence of the Internet as a real-time communication tool. The overall vision for SSW is an intelligent, Web-centric distribution and fusion of sensor information that provides greatly enhanced situational awareness, on demand, to warfighters at lower echelons. Emphasis is on multi-sensor fusion of large arrays of local sensors, joined with other assets, to provide real-time imagery, weather, targeting information, mission planning, and simulations for military operations on land, sea, and air. This paper gives an overview of this new initiative, highlights some of the technology challenges in sensor/information fusion, and presents a program approach for near-term demonstrations and long-term solutions, involving the DoD, National Labs, commercial industry, and academia.     

Optimal m-ary data fusion with distributed sensors

An optimal data fusion rule is derived for an m-ary detection problem. Each detector determines a local decision using a local decision rule and transmits the local decision to the fusion center. Considering the reliability of local detectors, local decisions are combined to produce the final decision. In this study, based upon the maximum posterior probability concept, optimal decision rules for m-ary detection problems are proposed for the local detector and the data fusion center     

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     

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     

MMWR/FLIR/ATR sensor fusion: proof of concept

To improve the relocatable target capabilities of strategic aircraft, a sensor fusion concept using a millimeter-wave radar (MMWR) and a forward-looking infrared (FLIR) system providing inputs to an auto target recognizer (ATR) has been developed. To prove this concept, a cooperative research effort is being conducted by a group of industry leaders in bomber avionics, MMWR, and ATR technologies. The author discusses the concept and the plan developed to test, evaluate, and demonstrate the expected performance     

Smart Sensor Web: Web-based exploitation of sensor fusion forvisualization of the tactical battlefield

Smart Sensor Web (SSW) is a recent DUSD (S&T) initiative inspired by extraordinary technological advances in sensors and microelectronics and by the emergence of the Internet as a real time communication tool. The overall vision for SSW is an intelligent, Web-centric distribution and fusion of sensor information that provides greatly enhanced situational awareness, on demand, to warfighters at lower echelons. Emphasis is on multi-sensor fusion of large arrays of local sensors, joined with other assets, to provide real-time imagery, weather, targeting information, mission planning, and simulations for military operations on land, sea, and air. This paper gives an overview of this new initiative, highlights some of the technology challenges in sensor/information Fusion, and presents a program approach for near-term demonstrations and long-term solutions, involving the DoD, National Labs, commercial industry, and academia     

A new SINS/GPS sensor fusion scheme for UAV localization problem using nonlinear SVSF with covariance derivation and an adaptive boundary layer

The state estimation strategy using the smooth variable structure filter(SVSF) is based on the variable structure and sliding mode concepts. As presented in its standard form with a fixed boundary layer limit, the value of the boundary layer width is not precisely known at each step and may be selected based on a priori knowledge. The boundary layer width reflects the level of uncertainty in the model parameters and disturbance characteristics, where large values of the boundary layer width lead to robustness without optimality and small values of the boundary layer width provide optimality with poor robustness. As a solution and to overcome these limitations, an adaptive smoothing boundary layer is required to achieve greater robustness and suitable accuracy.This adapted value of the boundary layer width is obtained by minimizing the trace of the a posteriori covariance matrix. In this paper, the proposed new approach will be considered as another alternative to the extended Kalman filters(EKF), nonlinear H1 and standard SVSF-based data fusion techniques for the autonomous airborne navigation and self-localization problem. This alternative is based on strapdown inertial navigation system(SINS) and GPS data using the nonlinear SVSF with a covariance derivation and adaptive boundary layer width.Furthermore, the full mathematical model of the SINS/GPS navigation system considering the unmanned aerial vehicle(UAV) position, velocity and Euler angle as well as gyro and accelerometer biases will be used in this paper to estimate the airborne position and velocity with better accuracy.     

适用于机器人的关节模块

来自科隆的耐磨塑料专家易格斯成功研发出一种创新的机器人模块系统,适用于关节应用.在robolink模块系统中关节通过电缆的预紧力来控制,其运行方式就像人类的筋骨一般.所有数据电缆都被安全地排列在带有关节的     

Training, career development and registration for safety criticalsoftware systems specialists

A career development program for information systems practitioners currently being used widely by employers in the UK and now becoming available in North America is described. The program, called the Professional Development Scheme (PDS), was developed by the British Computer Society to address the lack of structure and quality control generally present in the way computing professionals were being trained. The performance standards underpinning the program (The British Computer Society Industry Structure Model) have been thoroughly updated and now include material specific to the development, maintenance, and management of software for safety-critical applications. The use of the program for this purpose and potential developments in the field of training and registration for safety-critical software specialists are discussed     

JTIDS relative navigation and data registration

The Joint Tactical Information Distribution System (JTIDS), an integrated communication, navigation, and identification system, provides a solution to the critical data registration problem facing the joint US military services today, namely, the establishment, in real-time, of accurately correlated positions and tracks for all friendly, unknown, and hostile targets in an operational area, thus providing the total situation awareness required for tactical and C² operations. The fundamental relationships of JTIDS navigation and the error analysis for target registration and target hand-off in both geodetic and relative grid coordinates are presented. Simulation results are provided for two scenarios to demonstrate the level of improvement that JTIDS navigation can have on situation awareness, target acquisition, and weapon delivery. Specifically, it is shown that accurate data registration can be achieved by as few as two JTIDS members, with or without accurate knowledge of geodetic position     

GLRT subspace detection for range and Doppler distributed targets

A generalized likelihood ratio test (GLRT) is derived for adaptive detection of range and Doppler-distributed targets. The clutter is modeled as a spherically invariant random process (SIRP) and its texture component is range dependent (heterogeneous clutter). We suppose here that the speckle component covariance matrix is known or estimated thanks to a secondary data set. Thus, unknown parameters to be estimated are local texture values, the complex amplitudes and Doppler frequencies of all scattering centers. To do so, we use superresolution methods. The proposed detector assumes a priori knowledge on the spatial distribution of the target and has the precious property of having a constant false alarm rate (CFAR) with the assumption of a known speckle covariance matrix or by the use of frequency agility.