{"title":"Information fusion algorithms and analysis for an exemplar detection of intent problem","authors":"C. Lloyd, D. Nicholson, Mark Williams","doi":"10.1109/ICIF.2010.5711967","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711967","url":null,"abstract":"Information fusion algorithms for data association and inference are applied to a representative intelligence gathering problem in which signals of intent are monitored by multiple imperfect sensors over a period of time. Two sets of algorithms are developed: a brute force set which makes best use of the data but is not efficient, and an approximate set which sacrifices some performance for efficiency. The algorithms are applied to simulated data to generate evidence of intent. Then a Monte Carlo process and an associated metric are developed to evaluate the performance of the algorithms under different levels of uncertainty in the data. This analysis helped to validate the algorithms and it can also provide useful system design guidelines.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"8 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":"125075110","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":"Density trees for efficient nonlinear state estimation","authors":"Henning P. Eberhardt, Vesa Klumpp, U. Hanebeck","doi":"10.1109/ICIF.2010.5712086","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712086","url":null,"abstract":"In this paper, a new class of nonlinear Bayesian estimators based on a special space partitioning structure, generalized Octrees, is presented. This structure minimizes memory and calculation overhead. It is used as a container framework for a set of node functions that approximate a density piecewise. All necessary operations are derived in a very general way in order to allow for a great variety of Bayesian estimators. The presented estimators are especially well suited for multi-modal nonlinear estimation problems. The running time performance of the resulting estimators is first analyzed theoretically and then backed by means of simulations. All operations have a linear running time in the number of tree nodes.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"259 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":"116214716","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":"Focal elements generated by the Dempster-Shafer theoretic conditionals: A complete characterization","authors":"T. Wickramarathne, K. Premaratne, M. Murthi","doi":"10.1109/ICIF.2010.5711938","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711938","url":null,"abstract":"Incorporation of soft evidence into the fusion process poses considerable challenges, including issues related to the material implications of propositional logic statements, contradictory evidence, and non-identical scopes of sources providing soft evidence. The conditional approach to Dempster-Shafer (DS) theoretic evidence updating and fusion provides a promising avenue for overcoming these challenges. However, the computation of the Fagin-Halpern (FH) conditionals utilized in the conditional evidence updating strategies is non-trivial because of the lack of a method to identify the conditional focal elements directly. The work in this paper presents a complete characterization of the conditional focal elements via a necessary and sufficient condition that identifies the explicit structure of a proposition that will remain a focal element after conditioning. We illustrate the resulting computational advantage via several experiments.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"64 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120988690","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":"Multimodal feature fusion for video forgery detection","authors":"G. Chetty, Matthew Lipton","doi":"10.1109/ICIF.2010.5711839","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711839","url":null,"abstract":"In this paper we propose a novel local feature analysis and feature level fusion technique for detecting tampering or forgery for facial-biometric based on-line access control scenarios. The local features are extracted by analysing facial image data in the chrominance colour space and hue-saturation colour space. A feature level fusion of local features consisting of hue and saturation gradients with global features obtained from principal component analysis showed that a significant improvement in performance can be achieved in detecting tampered or forged images from genuine images in low bandwidth online streaming video access control contexts. The performance evaluation of the proposed fusion technique for a multimodal facial video corpus showed that an equal error rate of less than 1% could be achieved with feature level fusion of local features and global features.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"68 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":"124139024","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":"Quantization for distributed testing of independence","authors":"Minna Chen, W. Liu, Biao Chen, J. Matyjas","doi":"10.1109/ICIF.2010.5712034","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712034","url":null,"abstract":"We consider the problem of distributed test of statistical independence under communication constraints. While independence test is frequently encountered in various applications, distributed independence test is particularly useful for events detection in sensor networks: data correlation often occurs among sensor observations in the presence of a target. Focusing on the Gaussian case because of its tractability, we study in this paper the characteristics of optimal scalar quantizers for distributed test of independence where the optimality is in the sense of optimizing the error exponent. We also discuss the optimal quantizer properties for the finite sample regime, i.e., that of directly minimizing the error probability.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"10 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":"133745448","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":"UAV path planning for maximum visibility of ground targets in an urban area","authors":"Jongrae Kim, J. Crassidis","doi":"10.1109/ICIF.2010.5711852","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711852","url":null,"abstract":"Multiple moving targets in an urban area are to be tracked simultaneously by unmanned aerial vehicles. It is assumed that the moving targets try to avoid the camera field of view of the aircraft by changing their velocities and/or hiding behind buildings. The number of aircraft is much smaller than the number of targets, in general. In order to track as many targets as possible, firstly the targets are grouped into a number of subgroups by maximising the modularity, which is solved efficiently by the power iteration. Secondly, circular optimal paths are assigned to maximise the visibility of the area, given shapes and locations of the ground obstacles, where the computational complexity is reduced using a novel random sampling method. Finally, the aircraft transition paths from the current positions to the desired path are obtained by solving a discrete minimum weighted path length problem.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"104 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":"133625765","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":"Range-sensitive Bayesian passive sonar tracking","authors":"Bryan A. Yocom, J. Aughenbaugh, B. Cour","doi":"10.1109/ICIF.2010.5711993","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711993","url":null,"abstract":"Passive sonar arrays are commonly operated under a far-field assumption in which the only observable parameter regarding target location is the direction of arrival of the target's signal. Range can be observed, but only when a target is in the near-field region of the array. In a Bayesian formulation of the problem, additional range dependence may be added to the passive sonar likelihood function by utilizing knowledge of the source level of a target of interest. It is shown that incorporating such knowledge of source level can increase track accuracy, both in the near-field and far-field regions of the array. In addition, it is shown that source level modeling can give a field of omni-directional sensors the ability to detect and localize a target.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"7 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":"133676782","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 multisensor CPHD and PHD filters","authors":"R. Mahler","doi":"10.1109/ICIF.2010.5711984","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711984","url":null,"abstract":"The probability hypothesis density (PHD) filter and cardinalized probability hypothesis density (CPHD) filter are principled approximations of the general multitarget Bayes recursive filter. Both filters are single-sensor filters. Since their multisensor generalizations are computationally intractable, a further approximation - iterating their corrector equations, once for each sensor - has been used instead. This approach is theoretically unpleasing because it is not invariant under reordering of the sensors, and because it is implicitly based on strong simplifying assumptions. The purpose of this paper is to derive multisensor PHD and CPHD filters that (1) are invariant under sensor reordering, (2) require much weaker simplifying assumptions, and (3) are potentially computationally tractable (at least in the case of the multisensor CPHD filter).","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":"130413639","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":"Performances in multitarget tracking for convoy detection over real GMTI data","authors":"Evangeline Pollard, B. Pannetier, M. Rombaut","doi":"10.1109/ICIF.2010.5711853","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711853","url":null,"abstract":"A convoy is defined as a group of vehicles traveling together for mutual support and protection. It constitutes an object of high military interest in the context of the situation assessment. However, it is a challenging task to track and evaluate because convoy targets are very close of each other. In this view, the Onera recently developed a new two step convoy detection process. The first is an original tracking algorithm appropriate for Ground Moving Target Indicator (GMTI) data based on the hybridization of two classical multitarget tracking algorithms, and adapted to closely spaced target tracking. Then, by using algorithm outputs and other data, vehicle aggregates are detected and their characteristics are introduced into a Dynamic Bayesian Network (DBN) which processes the probability for an aggregate to be a convoy. This process gives encourageous results with simulated data. In this paper, we validate this process by showing real data results.","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":"130525531","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 maximum likelihood tracker for multistatic sonars","authors":"D. Orlando, F. Ehlers, G. Ricci","doi":"10.1109/ICIF.2010.5712009","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712009","url":null,"abstract":"In this paper, we propose a TBD like tracker designed to work in a multistatic sonar environment where measurements collected by different sensors are sent to a fusion center. A preliminary performance assessment, carried out by Monte Carlo simulation, is also provided. Finally, we test the newly proposed algorithm with a benchmark dataset provided by METRON in the context of collaborative international multi-laboratory research that is ongoing in the ISIF Multi-Static Tracking Working Group. The preliminary analysis shows that the proposed algorithm has acceptable performance also when the probability of detection per sensor is low (in the order of 0.3) and measurement errors are significant.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"138 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":"131632806","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}