{"title":"Bearings-only tracking analysis via information geometry","authors":"Xuezhi Wang, Yongqiang Cheng, W. Moran","doi":"10.1109/ICIF.2010.5711965","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711965","url":null,"abstract":"In this paper, the problem of bearings-only tracking with a single sensor is studied via the theory of information geometry, where Fisher information matrix plays the role of Riemannian metric. Under a given tracking scenario, the Fisher information distance between two targets is approximately calculated over the window of surveillance region and is compared to the corresponding Kullback Leibler divergence. It is demonstrated that both “distances” provide a contour map that describes the information difference between the location of a target and a specified point. Furthermore, an analytical result for the optimal heading of a given constant speed sensor is derived based on the the properties of statistical manifolds.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"60 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":"115391792","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}
S. Gidel, C. Blanc, T. Chateau, P. Checchin, L. Trassoudaine
{"title":"Comparison between GMM and KDE data fusion methods for particle filtering: Application to pedestrian detection from laser and video measurements","authors":"S. Gidel, C. Blanc, T. Chateau, P. Checchin, L. Trassoudaine","doi":"10.1109/ICIF.2010.5712051","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712051","url":null,"abstract":"In urban environment, pedestrian detection is a challenging task in automotive research, which often suffers from the lack of reliability due to the occurrences of spurious detections. In order to answer multitarget multisensor tracking problem and more specifically pedestrian tracking, we propose to use an algorithm based on a stochastic recursive Bayesian framework also called particle filter. We aim to solve the problem of consistent Bayesian Decentralized Data Fusion (BDDF) with particle filter using two different statistics approaches in order to better represent the particle set and maintains an accurate summary of the particles. We propose a comparison between a Kernel Density Estimation (KDE) based on non-parametric estimation and a Gaussian Mixture Model (GMM) based on parametric estimation. This approach allows to cope with non-linear models and multi-modalities induced by occlusions and clutters. These two algorithms differ in the representation of particle set during data fusion. Simulation results as well as the results of the experiments conducted on real data demonstrate the relevance of these approaches.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"34 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":"116920050","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":"Bearings-only localisation of targets from low-speed UAVs","authors":"W. Mohibullah, S. Julier","doi":"10.1109/ICIF.2010.5711963","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711963","url":null,"abstract":"We perform a simulation study to compare the performance of several of single-camera mapping and localisation algorithms for a search and rescue application using low-speed, low-altitude UAVs. We investigate the effects of a range of conditions including target location, nadir angle of the camera and the trajectory of the UAV on three bearings-only SLAM algorithms: Delayed Initialisation (DI), Inverse Depth Point (IDP), and Anchored Homogeneous Point (AHP). Our results show that DI is robust but there can be significant delays before a landmark is initialised. IDP can produce landmark estimates of similar quality, but without the delays. However, this performance can only be achieved through the use of log parameterisations of depth and second order filters. AHP does not yield consistent estimates under any circumstance and is not appropriate for our application.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"59 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120917723","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":"An analysis of the error characteristics of two time of arrival localization techniques","authors":"T. Sathyan, M. Hedley, M. Mallick","doi":"10.1109/ICIF.2010.5711996","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711996","url":null,"abstract":"Accurate local positioning systems usually use a network of anchor nodes at known locations to track mobile nodes based on the measurement of the time of arrival (TOA) at anchor nodes of beacon signals transmitted by the mobile nodes. To localize the mobile node either TOA processing, where the unknown transmit time is estimated along with the node location, or time difference of arrival (TDOA) processing, where the transmit time is eliminated before estimating the node location, can be used. We show that the position error bound of both these formulations are the same by analyzing the Cramér-Rao lower bound. When processing data collected in field trials, however, we observed that the TOA processing yields better localization accuracy, and explain this behavior using differential geometry-based curvature measures that show that the TDOA cost function has greater degree of non-linearity.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"13 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":"127452723","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":"Particle filter based entropy","authors":"Y. Boers, H. Driessen, A. Bagchi, P. Mandal","doi":"10.1109/ICIF.2010.5712013","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712013","url":null,"abstract":"For many problems in the field of tracking or even the wider area of filtering the a posteriori description of the uncertainty can oftentimes not be described by a simple Gaussian density function. In such situations the characterization of the uncertainty by a mean and a covariance does not capture the true extent of the uncertainty at hand. For example, when the posterior is multi-modal with well separated narrow modes. Such descriptions naturally occur in applications like target tracking with terrain constraints or tracking of closely spaced multiple objects, where one cannot keep track of the objects identities. In such situations a co-variance measure as a description of the uncertainty is not appropriate anymore. In this paper we look at the use of entropy as an uncertainty description. We show how to calculate the entropy based on a running particle filter. We will verify the particle based approximation of the entropy numerically. We we also discuss theoretical convergence properties and provide some motivating examples.","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":"125390674","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":"Revisiting the SS Central America search","authors":"L. Stone","doi":"10.1109/ICIF.2010.5712111","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712111","url":null,"abstract":"In 1857, while carrying passengers and gold from California to New York, the SS Central America sank in a hurricane, taking some three tons of gold bars and coins to the ocean bottom almost 8,000 ft below. Some 425 people, including the captain of the ship, lost their lives. In 1989, after three summers of effort at sea, the Columbus America Discovery Group recovered one ton of gold bars and coins from the wreck. This paper reviews the analysis that was performed to produce the probability distribution used to plan the successful search for the wreck and critiques that analysis based on information obtained in the years since the original 1992 article was written on this topic. This paper also provides an update on the legal battles and the disposition of the recovered gold.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"208 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":"116400506","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":"SPECSweb tracking on a large, simulated multistatic field of the MSTWG","authors":"D. Grimmett","doi":"10.1109/ICIF.2010.5711947","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711947","url":null,"abstract":"Effective fusion and tracking of multistatic active sonar contacts is challenging, due to high levels of false alarm clutter present on all sonar nodes. Such false alarms often overload the sensor-to-fusion-center communications links and fusion/tracking processes, producing too many false tracks. The Specular-Cued Surveillance Web (SPECSweb) multistatic tracker mitigates these problems by allowing track initiation to occur only when high-strength specular target detections are identified. Using these “specular” cues, and subsequent track state estimates, a selective data retrieval approach is used which significantly reduces the data rate at the input to the fusion/tracking algorithm, and reduces node to fusion-center communication link throughput requirements. This paper provides performance results of this tracking algorithm on a simulated multistatic data set from the Multistatic Tracking Working Group (MSTWG). The data set simulates a large multistatic field, and is characterized by low probability of detection (PD), high false alarm rate (FAR), and high measurement errors. The impacts of these challenging conditions on tracker performance are explained, including the degradation of association gating with large error in bearing measurements.","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":"128220410","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":"A dynamic grouping strategy for implementation of the particle filter on a massively parallel computer","authors":"S. Nakano, T. Higuchi","doi":"10.1109/ICIF.2010.5712049","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712049","url":null,"abstract":"A practical way to implement the particle filter (PF) on a massively parallel computer is discussed. Although the PF is a useful tool for sequential Bayesian estimation, the PF tends to be computationally expensive in applying to high-dimensional problems because a enormous number of particles is required in order to appropriately approximate a PDF. One way to overcome this problem is to use large computing resources of a massively parallel computer. However, in implementing the PF on such a massively parallel computer, it is crucial to reduce the time cost for data transfer between different processing elements (PEs). In addition, in using a parallel computer with a multidimensional torus network topology, it is necessary to avoid data transfers between nodes distant from each other. The present study proposes a strategy in which the PEs in use are divided into small groups and the grouping is changed at each time step. The resampling is carried out within each group in parallel and data transfers between distant nodes never occur. Therefore, the time cost for data transfer would be greatly reduced and the efficiency is remarkably improved in comparison with the normal PF.","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":"128691502","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":"Bimodal localization in cellular networks utilizing particle filters","authors":"Arash Tabibiazar, O. Basir","doi":"10.1109/ICIF.2010.5711942","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711942","url":null,"abstract":"Location based services in wireless networks is a quite demanding application especially in urban areas. Cellular network provides measurements regarding the signal attenuations from serving and neighbouring base stations for managing radio resources. Localization based on this inconsistent received signal strength is a challenging problem. This paper describes a novel bimodal localization idea for mobile users in cellular networks. A series of vision-based algorithms are applied to extract user position from monocular vision and then augment it with extracted location in cellular network. A probabilistic framework based on particle filters developed to fuse the bimodal data as well as localize the mobile user precisely from inconsistent measurements. This approach can be easily implemented to utilize available online visual databases to increase accuracy of conventional localization methods for wireless networks even in indoor environments that other navigation signals are not available.","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":"130328228","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}
M. Guerriero, L. Svensson, Daniel Svensson, P. Willett
{"title":"Shooting two birds with two bullets: How to find Minimum Mean OSPA estimates","authors":"M. Guerriero, L. Svensson, Daniel Svensson, P. Willett","doi":"10.1109/ICIF.2010.5712056","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712056","url":null,"abstract":"Most area-defense formulations follow from the assumption that threats must first be identified and then neutralized. This is reasonable, but inherent to it is a process of labeling: threat A must be identified and then threat B, and then action must be taken. This manuscript begins from the assumption that such labeling (A & B) is irrelevant. The problem naturally devolves to one of Random Finite Set (RFS) estimation: we show that by eschewing any concern of target label we relax the estimation procedure, and it is perhaps not surprising that by such a removal of constraint (of labeling) performance (in terms of localization) is enhanced. A suitable measure for the estimation of unla-beled objects is the Mean OSPA (MOSPA). We derive a general algorithm which provided the optimal estimator which minimize the MOSPA. We call such an estimator a Minimum MOSPA (MMOSPA) estimator.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"107 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":"130493581","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}