{"title":"Information acquisition strategies for Bayesian network-based decision support","authors":"R. Johansson, Christian Mårtenson","doi":"10.1109/ICIF.2010.5712030","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712030","url":null,"abstract":"Determining how to utilize information acquisition resources optimally is a difficult task in the intelligence domain. Nevertheless, an intelligence analyst can expect little or no support for this from software tools today. In this paper, we describe a proof of concept implementation of a resource allocation mechanism for an intelligence analysis support system. The system uses a Bayesian network to structure intelligence requests, and the goal is to minimize the uncertainty of a variable of interest. A number of allocation strategies are discussed and evaluated through simulations.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"33 1-2 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":"134155438","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":"Evaluation of multistatic tree-search based tracking on the SEABAR dataset","authors":"Hossein Roufarshbaf, J. Nelson","doi":"10.1109/ICIF.2010.5711982","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711982","url":null,"abstract":"The focus of this paper is the extension of tree-search based tracking to multistatic tracking problems and the evaluation of the proposed algorithm on the SEABAR'07 sonar dataset. The tree-search based tracker, originally introduced in, is built upon the stack algorithm for convolutional decoding. To perform track estimation, the tracker navigates a search tree in which each path represents a sequence of states visited by the target. By exploring only a subset of the search tree, the stack-based tracker computes only likely regions of the posterior distribution at each update, thereby approximating the Bayesian inference solution to the tracking problem. In this work, the monostatic stack-based tracker is extended to multistatic tracking. The structure of the tree-search approach facilitates the incorporation of information from multiple source-receiver pairs with minimal complexity increase. The performance of the multistatic stack-based tracker on the SEABAR'07 dataset shows that the tracker is able to maintain track through highly nonlinear target maneuvers and in the presence of heavy clutter.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"17 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":"130910543","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":"Adaptive choice of scaling parameter in derivative-free local filters","authors":"J. Duník, M. Simandl, O. Straka","doi":"10.1109/ICIF.2010.5712042","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712042","url":null,"abstract":"The paper deals with adaptive choice of the scaling parameter in derivative-free local filters. In the last decade several novel local derivative-free filtering methods have been proposed. These methods exploiting Stirling's interpolation and the unscented transformation are, however, conditioned by specification of a scaling parameter significantly influencing the quality of the state estimate. Surprisingly, almost no attention has been devoted to a suitable choice of the parameter. In fact, only a few basic recommendations have been provided, which are rather general and do not respect the particular system description. The choice of the parameter thus remains mainly on a user. The goal of the paper is to provide a technique for adaptive choice of the scaling parameter of the derivative-free local filters.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"9 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":"133118506","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":"Probabilistic stand still detection using foot mounted IMU","authors":"Jonas Callmer, David Törnqvist, F. Gustafsson","doi":"10.1109/ICIF.2010.5712024","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712024","url":null,"abstract":"We consider stand still detection for indoor localization based on observations from a foot-mounted inertial measurement unit (IMU). The main contribution is a statistical framework for stand-still detection, which is a fundamental step in zero velocity update (ZUPT) to reduce the drift from cubic to linear in time. First, the observations are transformed to a test statistic having non-central chi-square distribution during zero velocity. Second, a hidden Markov model is used to describe the mode switching between stand still, walking, running, crawling and other possible movements. The resulting algorithm computes the probability of being in each mode, and it is easily extendable to a dynamic navigation framework where map information can be included. Results of first mode probability estimation, second map matching without ZUPT and third step length estimation with ZUPT are provided.","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":"134639666","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":"Tracking group co-membership on networks","authors":"J P Ferry, J. Bumgarner","doi":"10.1109/ICIF.2010.5711940","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711940","url":null,"abstract":"Tracking groups in network data is an emerging problem in network science. The network science community has not leveraged the tracking techniques used in data fusion, however. The purpose of this work is to introduce a novel domain to the tracking community, and novel techniques to network science. Group tracking is formulated here as a traditional, continuous-time Bayesian filter, which operates on time-evolving network data and outputs joint group membership probabilities over all nodes. Simple measurement and update models are proposed, which enable the derivation of an exact filter. This filter requires an exponentially large state space, however, so it is marginalized to a smaller space. The resulting system tracks second-order statistics (i.e., probabilities of pairs of nodes being in the same group) using equations involving third- and fourth-order statistics, which require closure assumptions. Several closures are investigated, and their merits and drawbacks are discussed.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"220 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":"133805731","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":"Probabilistic Behaviour Signatures: Feature-based behaviour recognition in data-scarce domains","authors":"R. Baxter, N. Robertson, D. Lane","doi":"10.1109/ICIF.2010.5712000","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712000","url":null,"abstract":"In this paper we present a new method to provide situation awareness via the automatic recognition of behaviour in video. In contrast to many other approaches, the presented method does not require many training exemplars. We introduce Probabilistic Behaviour Signatures to represent the goals of a person agent as sets of features. We do not assume temporal ordering of observed actions is necessary. Inference is performed using an extension of the Rao-Blackwellised Particle Filter. We validate our approach using simulated image trajectories which represent three high-level behaviours. We compare performance to a trained Hidden Markov Model Particle Filter (HMM PF) and show that our approach achieves 92% accuracy at video frame rate. Our method is also significantly more robust than the HMM PF in the presence of noise.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"228 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":"133854565","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":"Combined spatial and transform domain analysis for rectangle detection","authors":"H. Bhaskar, N. Werghi, S. Al-Mansoori","doi":"10.1109/ICIF.2010.5712096","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712096","url":null,"abstract":"We describe and compare methods for detecting rectangles in images using Hough and Radon transforms. Locating rectangles in a new image involves an alternating scheme of transform peak extraction and peak filtering. During the step of peak extraction, we apply the hough/radon transform on the target image and extract peaks (corresponding to line segments) from the transformed image. We filter these peaks based on certain geometric constraints in the transform and spatial constraints on the coordinate (or image) domain such that every set of 4 filtered peaks correspond to a rectangle in the image. We explore the effect of model parameters on system performance and show that the proposed methods achieves good accuracy for rectangle detection on several synthetic and real datasets.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"94 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":"115681533","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}
R. Schubert, H. Klöden, G. Wanielik, Stephan Kälberer
{"title":"Performance evaluation of Multiple Target Tracking in the absence of reference data","authors":"R. Schubert, H. Klöden, G. Wanielik, Stephan Kälberer","doi":"10.1109/ICIF.2010.5712054","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712054","url":null,"abstract":"Evaluating the performance of Multiple Target Tracking algorithms is a crucial requirement for the design and validation of different applications. Most of the available evaluation metrics require knowledge about the true state of the estimated situation. However, in most practical applications, such reference data are not available. Thus, a system of performance evaluation metrics which do not require reference data is proposed in this paper. The presented measures evaluate the detection performance, accuracy, and quality of the system output. The approach is evaluated based on simulated data and demonstrated on the example of an automotive tracking application.","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":"116887894","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 closed form solution to the Probability Hypothesis Density Smoother","authors":"B. Vo, B. Vo, R. Mahler","doi":"10.1109/ICIF.2010.5711983","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711983","url":null,"abstract":"A closed form Gaussian mixture solution to the forward-backward Probability Hypothesis Density smoothing recursion is proposed. The key to the closed form solutions is the use of an alternative form of the backward propagation, together with terse yet suggestive notations that have natural interpretation in terms of measurement predictions. The closed form backward propagation together with the Gaussian mixture PHD filter as the forward pass form the Gaussian mixture PHD smoother. Closed form solutions to smoothing for single target are also derived.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"31 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":"117256077","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 novel Bayesian method for fitting a circle to noisy points","authors":"M. Baum, Vesa Klumpp, U. Hanebeck","doi":"10.1109/ICIF.2010.5711884","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711884","url":null,"abstract":"This paper introduces a novel recursive Bayesian estimator for the center and radius of a circle based on noisy points. Each given point is assumed to be a noisy measurement of an unknown true point on the circle that is corrupted with known isotropic Gaussian noise. In contrast to existing approaches, the novel method does not make assumptions about the true points on the circle, where the measurements stem from. Closed-form expressions for the measurement update step are derived. Simulations show that the novel method outperforms standard Bayesian approaches for circle fitting.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"70 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":"116347405","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}