J. Seitz, Thorsten Vaupel, J. Jahn, S. Meyer, J. G. Boronat, J. Thielecke
{"title":"A Hidden Markov Model for urban navigation based on fingerprinting and pedestrian dead reckoning","authors":"J. Seitz, Thorsten Vaupel, J. Jahn, S. Meyer, J. G. Boronat, J. Thielecke","doi":"10.1109/ICIF.2010.5712025","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712025","url":null,"abstract":"An algorithm for pedestrian navigation in indoor and urban canyon environments is presented. It considers platforms with low processing power and low-cost sensors. A combination of Wi-Fi positioning and dead reckoning, based on a Hidden Markov Model, is used. The positions of the Wi-Fi fingerprints in the database are used as hidden states. Dead reckoning is taken for state transition and a database correlation of the Wi-Fi signal strength measurements is performed in the measurement update. The dead reckoning consists of an accelerometer driven step length estimation and a magnetic field based heading calculation. Simulations and tests demonstrate that in this way ambiguities common in Wi-Fi positioning can be solved and outages can be bridged. Therefore, higher accuracy and robustness can be achieved.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116181087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constrained multi-object Markov decision scheduling with application to radar resource management","authors":"M. Rezaeian, W. Moran","doi":"10.1109/ICIF.2010.5712047","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712047","url":null,"abstract":"Hierarchial radar resource management uses multi object Markov decision scheduling with a constraint on the resources. In this paper we give a detailed description of constrained multi-object Markov decision scheduling in its general form and the separation that is achieved in the dynamic programming level using Lagrange multipliers. We then apply this general model to obtain a simultaneous beam and waveform scheduling method for radars based on an objective function that depends on both state and action. This method extends on a previous hierarchial method for beam scheduling with an objective function defined only on state. We further improve the objective function based on entropy reduction. This criterion makes the resource management to be more flexible in favor of measurements that carry more information.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123251980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate propagation of both epistemic and aleatory uncertainty through dynamic systems","authors":"G. Terejanu, P. Singla, T. Singh, P. Scott","doi":"10.1109/ICIF.2010.5711831","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711831","url":null,"abstract":"When ignorance due to the lack of knowledge, modeled as epistemic uncertainty using Dempster-Shafer structures on closed intervals, is present in the model parameters, a new uncertainty propagation method is necessary to propagate both aleatory and epistemic uncertainty. The new framework proposed here, combines both epistemic and aleatory uncertainty into a second-order uncertainty representation which is propagated through a dynamic system driven by white noise. First, a finite parametrization is chosen to model the aleatory uncertainty by choosing a representative approximation to the probability density function conditioned on epistemic variables. The epistemic uncertainty is then propagated through the moment evolution equations of the conditional probability density function. This way we are able to model the ignorance when the knowledge about the system is incomplete. The output of the system is a Dempster-Shafer structure on sets of cumulative distributions which can be combined using different rules of combination and eventually transformed into a singleton cumulative distribution function using Smets' pignistic transformation when decision making is needed.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122495248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Description of the Choquet Integral for tactical knowledge representation","authors":"T. Schuck, Erik Blasch","doi":"10.1109/ICIF.2010.5711844","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711844","url":null,"abstract":"The goal of Combat Identification (CID), and as well, Situational Awareness (SA), is to combine data and information at the appropriate information representation in order to declare a positive ID according to a classification structure. CID includes the ultimate determination of the intent and prediction of future actions of an object or entity via the establishment of tactical knowledge. To facilitate CID, we utilize the concept of conceptual spaces to represent cooperative and non-cooperative CID. The Choquet integral combined with Bayes risk enables methods that provide a statistical approach to adversary intent prediction through the CID knowledge spaces. The use of the Choquet Integral for CID is applied in the context of a Maritime Domain Awareness (MDA) example.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Federated Sensor Network","authors":"Ran Xu, Shuanghua Yang","doi":"10.1109/ICIF.2010.5711974","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711974","url":null,"abstract":"Wireless sensor networks have been used increasingly widely in the modern world. The sensor nodes in the network system not only have a small physical size, but also have low energy consumption albeit with low processing ability. Wireless sensor networks are used to collect data in remote or harsh conditions, which in reality requires a number of different heterogeneous sensor network. There are a number of challenges here such as determining the equipment and services to use, the data query methods, the methods for network connection, as well as numerous security issues. In fact, how to collect data from multiple sensor networks subject to the user's requirement is becoming a most critical problem. In this paper, we present a demonstration for a data centralized Federated Sensor Network. Our demonstration shows that the centralized architecture is not a perfect solution for on-demand sensor data. Therefore, we introduce a novel distributed Federated Sensor Network architecture. A comparison between centralized and distributed architectures for Federated Sensor Networks is given at the end of the paper to inform any possible implementation.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126133106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Hypothesis Tracking and fusion techniques for multistatic active sonar systems","authors":"Kathrin Seget, A. Schulz, U. Heute","doi":"10.1109/ICIF.2010.5711949","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711949","url":null,"abstract":"In multistatic sonar systems data from several sensors are fused to obtain an improved tracking result compared to systems with a single source-receiver pair. Although centralised fusion leads to a theoretical optimal fusion result, distributed fusion features considerable advantages. As less data have to be passed to a fusion node, distributed fusion requires less bandwidth to transmit data as well as less computational load to process the data compared to centralised fusion. In this paper a distributed fusion approach is presented without performing a track-to-track association. Fusion is done by applying an additional Multi-Hypothesis Tracker to track states filtered at the single sensor stages. The presented fusion technique is applied to two distinct multistatic sonar datasets and compared to a centralised fusion approach.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Continuous belief functions and α-stable distributions","authors":"A. Fiche, Arnaud Martin, J. Cexus, A. Khenchaf","doi":"10.1109/ICIF.2010.5711934","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711934","url":null,"abstract":"The theory of belief functions has been formalized in continuous domain for pattern recognition. Some applications use assumption of Gaussian models. However, this assumption is reductive. Indeed, some data are not symmetric and present property of heavy tails. It is possible to solve these problems by using a class of distributions called α-stable distributions. Consequently, we present in this paper a way to calculate pignistic probabilities with plausibility functions where the knowledge of the sources of information is represented by symmetric α-stable distributions. To validate our approach, we compare our results in special case of Gaussian distributions with existing methods. To illustrate our work, we generate arbitrary distributions which represents speed of planes and take decisions. A comparison with a Bayesian approach is made to show the interest of the theory of belief functions.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129807933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust infrared vehicle tracking across target pose change using L1 regularization","authors":"Haibin Ling, Li Bai, Erik Blasch, Xue Mei","doi":"10.1109/ICIF.2010.5711902","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711902","url":null,"abstract":"In this paper, we propose a robust vehicle tracker for Infrared (IR) videos motivated by the recent advance in compressive sensing (CS). The new eL1-PF tracker solves a sparse model representation of moving targets via L1 regularized least squares. The sparse-model solution addresses real-world environmental challenges such as image noises and partial occlusions. To further improve tracking performance for frame-to-frame sequences involving large target pose changes, two extensions to the original L1 tracker are introduced (eL1). First, in the particle filter (PF) framework, pose information is explicitly modelled into the state space which significantly improves the effectiveness of particle sampling and propagation. Second, a probabilistic template update scheme is designed, which helps alleviating drift caused by a target pose change. The proposed tracker, named eL1-PF tracker, is tested on IR sequences from the DARPA Video Verification of Identity (VIVID) dataset. Promising results from the eL1-PF tracker are observed in these experiments in comparison with previous mean-shift and original L1-regularization trackers.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129758995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Gaussian Mixture initialization in passive tracking applications","authors":"M. Daun, R. Kaune","doi":"10.1109/ICIF.2010.5711980","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711980","url":null,"abstract":"This paper describes the approximation of a nonlinear posterior density by a Gaussian Mixture (GM). The GM is used to initialize a bank of Kalman filters. For each Gaussian term, a Kalman filter is started. The basic conditions and the quality of the approximation are discussed. Examples from different tracking applications, the multistatic tracking and passive emitter localization using TDOA measurements, are investigated. The results are discussed and compared with existing approaches. The RMS error of the estimate is used as an evaluation criterion. The performance of the Gaussian Mixture approach is analyzed in Monte Carlo simulations.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129566323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tractor: A framework for soft information fusion","authors":"Mark Prentice, Michael Kandefer, S. Shapiro","doi":"10.1109/ICIF.2010.5711896","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711896","url":null,"abstract":"This paper presents a soft information fusion framework for creating a propositional graph from natural language messages with an emphasis on producing these graphs for fusion with other messages. The framework utilizes artificial intelligence techniques from natural language understanding, knowledge representation, and information retrieval.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128490506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}