loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06)
Adaptive Data Fusion Structure
Sydney Australia
November 28-December 01
ISBN: 0-7695-2731-0
Pooyan Khajehpour Tadavani, University of Tehran, Tehran, Iran
Behzad Moshiri, University of Tehran, Tehran, Iran
Babak N. Araabi, University of Tehran, Tehran, Iran
Lack of sufficient flexibility to deal with actual noisy data in data fusion methods is the main concern in this paper. This deficiency comes from two major reasons. Firstly, in fusion methods, all of the collected data are considered useful. Secondly, often some presumed sensor models are used in the fusion process, which do not necessarily match to the true models. As a general solution to address the aforementioned shortcomings, a novel Adaptive Data Fusion Structure (ADFS) is proposed. In ADFS, incorrect data are eliminated; then the remainders are fused, and finally the sensor models are learned by using the final fusion results as internal feedbacks. In particular, as more misleading data are eliminated, more accurate sensor models emerge. By employing ADFS to localize a simulated mobile robot in a highly noisy environment, the results prove its superiority, especially compared to the conventional entropy based methods of localization.
Citation:
Pooyan Khajehpour Tadavani, Behzad Moshiri, Babak N. Araabi, "Adaptive Data Fusion Structure," cimca, pp.192, International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.