• The Journal of the Acoustical Society of Korea
• /
• v.23 no.5
• /
• pp.410-419
• /
• 2004

In this paper. we propose a method of confidence measure fusion under Bayesian framework for speech recognition. Centralized and distributed schemes are considered for confidence measure fusion. Centralized fusion is feature level fusion which combines the values of individual confidence scores and makes a final decision. In contrast. distributed fusion is decision level fusion which combines the individual decision makings made by each individual confidence measuring method. Optimal Bayesian fusion rules for centralized and distributed cases are presented. In isolated word Out-of-Vocabulary (OOV) rejection experiments. centralized Bayesian fusion shows over 13% relative equal error rate (EER) reduction compared with the individual confidence measure methods. In contrast. the distributed Bayesian fusion shows no significant performance increase.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.444-452
• /
• 2003

An integration system with multi-measurement sets can be realized via combined application of a centralized and federated Kalman filter. It is difficult for the centralized Kalman filter to remove a failed sensor in comparison with the federated Kalman filter. All varieties of Kalman filters monitor innovation sequence (residual) for detection and isolation of a failed sensor. The innovation sequence, which is selected as an indicator of real time estimation error plays an important role in adaptive mechanism design. In this study, the centralized Kalman filter with adaptive measurement fusion is introduced by means of innovation sequence. The objectives of adaptive measurement fusion are automatic isolation and recovery of some sensor failures as well as inherent monitoring capability. The proposed adaptive filter is applied to the GPS/SDINS integration system with an additional sensor. Simulation studies attest that the proposed adaptive scheme is effective for isolation and recovery of immediate sensor failures.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.2
• /
• pp.165-171
• /
• 2006

This paper proposes a data fusion algorithm of nonlinear multi sensor dynamic systems of synchronous sampling based on filtering step by step. Firstly, the object state variable at the next time index can be predicted by the previous global information with the systems, then the predicted estimation can be updated in turn by use of the extended Kalman filter when all of the observations aiming at the target state variable arrive. Finally a fusion estimation of the object state variable is obtained based on the system global information. Synchronously, we formulate the new algorithm and compare its performances with those of the traditional nonlinear centralized and distributed data fusion algorithms by the indexes that include the computational complexity, data communicational burden, time delay and estimation accuracy, etc.. These compared results indicate that the performance from the new algorithm is superior to the performances from the two traditional nonlinear data fusion algorithms.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.10
• /
• pp.1012-1019
• /
• 2010

In this paper, The flight data processing system was designed for multiple target flight test. For flight data processing, multiple target grouping, data fusion processing, and data slaving processing were performed and, as a data fusion filter, centralized, and federated Kalman filters were designed. A centralized kalman filter was modified in order to improve the vehicle's low altitude measurement using radar's SNR and estimation process. From the testing of multiple target missile, it confirmed flight trajectory measurement was improved in low altitude area and the beginning stage of vehicle.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.24 no.2
• /
• pp.1-10
• /
• 2016

A GPS/SDINS/ST(Star Tracker) integrated sensor algorithm is more robust than the GPS/SDINS and the ST/SDINS systems on exploration of other planets. Most of the advanced studies shown that GPS/SDINS/ST integrated sensor with centralized Kalman filter was more accurate than those 2 integrated systems. The system, however, consist of a single filter, it is vulnerable to defects on failed data. To improve the problem, we work out a study using federated Kalman filter(No-Reset mode) and centralized Kalman filter with adaptive measurement fusion which known as robustness on fault. The simulation results show that the debasing influences are reduced and the computation is enable at least 100Hz. Further researches that the initial calibration in accordance with observability and applying the exploration trajectory are needed.

• Journal of Sensor Science and Technology
• /
• v.25 no.6
• /
• pp.418-422
• /
• 2016

A filtering algorithm based on the decentralized moving average Kalman filter with uncertainties is proposed in this paper. The proposed filtering algorithm presented combines the Kalman filter with the moving average strategy. A decentralized fusion algorithm with the weighted sum structure is applied to the local moving average Kalman filters (LMAKFs) of different window lengths. The proposed algorithm has a parallel structure and allows parallel processing of observations. Hence, it is more reliable than the centralized algorithm when some sensors become faulty. Moreover, the choice of the moving average strategy makes the proposed algorithm robust against linear discrete-time dynamic model uncertainties. The derivation of the error cross-covariances between the LMAKFs is the key idea of studied. The application of the proposed decentralized fusion filter to dynamic systems within a multisensor environment demonstrates its high accuracy and computational efficiency.

• Journal of Navigation and Port Research
• /
• v.28 no.7
• /
• pp.635-640
• /
• 2004

In this paper, a tracking algorithm for autonomous navigation of automated guided vehicles (AGVs) operating in container terminals is presented. The developed navigation algorithm takes the form of a federated information filter used to detect other AGVs and avoid obstacles using fused information from multiple sensors. Being equivalent to the Kalman filter (KF) algebraically, the information filter is extended to N-sensor distributed dynamic systems. In multi-sensor environments, the information-based filter is easier to decentralize, initialize, and fuse than a KF-based filter. It is proved that the information state and the information matrix of the suggested filter, which are weighted in terms of an information sharing factor, are equal to those of a centralized information filter under the regular conditions. Numerical examples using Monte Carlo simulation are provided to compare the centralized information filter and the proposed one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.229-240
• /
• 2012

Advances in MEMS and CMOS technologies have motivated the development of low cost/power sensors and wireless multimedia sensor networks (WMSN). The WMSNs were created to ubiquitously harvest multimedia content. Such networks have allowed researchers and engineers to glimpse at new Machine-to-Machine (M2M) Systems, such as remote monitoring of biosignals for telemedicine networks. These systems require the acquisition of a large number of data streams that are simultaneously generated by multiple distributed devices. This paradigm of data generation and transmission is known as event-streaming. In order to be useful to the application, the collected data requires a preprocessing called data fusion, which entails the temporal alignment task of multimedia data. A practical way to perform this task is in a centralized manner, assuming that the network nodes only function as collector entities. However, by following this scheme, a considerable amount of redundant information is transmitted to the central entity. To decrease such redundancy, data fusion must be performed in a collaborative way. In this paper, we propose a collaborative data alignment approach for event-streaming. Our approach identifies temporal relationships by translating temporal dependencies based on a timeline to causal dependencies of the media involved.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2014

Data fusion techniques combine data from multiple radars and related information to achieve more accurate estimations than could be achieved by a single, independent radar. In this paper, we analyze delay and loss of packets to be processed by multiple radar and minimize data processing interval from centralized data processing operation as fusing multiple radar data. Therefore, we model radar network about central data fusion, and analyze delay and loss of packets inside queues on assuming queues respectively as the M/M/1/K using NS-2. We confirmed average delay time, processing fused multiple radar data, through the analysis data. And then, this delay time can be used as a reference time for radar data latency in fusion center.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.