{"title":"How to Calibrate your Enemy's Capabilities? Inverse Filtering for Counter-Autonomous Systems","authors":"V. Krishnamurthy, M. Rangaswamy","doi":"10.23919/fusion43075.2019.9011232","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011232","url":null,"abstract":"We consider the following adversarial Bayesian signal processing problem involving “us” and the “enemy”: an enemy observes our state in noise; updates its posterior distribution of the state and then chooses an action based on this posterior. Given knowledge of “our” state and sequence of enemy's actions observed in noise, we consider two problems: (i) How can the enemy's posterior distribution be estimated? Estimating the posterior is an inverse filtering problem involving a random measure - we formulate and solve several versions of this problem in a Bayesian setting. (ii) How can the enemy's observation likelihood be estimated? This tells us how accurate the enemy's sensors are. We compute the maximum likelihood estimator for the enemy's observation likelihood given our measurements of the enemy's actions where the enemy's actions are in response to estimating our state. The above questions are motivated by the design of counter-autonomous systems: given measurements of the actions of a sophisticated autonomous enemy, how can a counter-autonomous system estimate the underlying belief of the enemy, predict future actions and therefore guard against these actions.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126433501","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":"On combining probabilistic and semantic similarity-based methods toward off-domain reasoning for situational awareness","authors":"Van Nguyen","doi":"10.23919/fusion43075.2019.9011197","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011197","url":null,"abstract":"Hard and soft high-level fusion plays an important role in the situational awareness literature. To deal with complex real-world situations, it is highly desirable that such systems are able to effectively capture the rich semantics associated with soft information and world/domain knowledge, to efficiently reason with imperfect information, and to benefit and learn from any data that may be available, among others. In these respects, first-order probabilistic models, such as Markov Logic Networks, hold great promise and have received recent attention for high-level fusion. By combining the expressiveness of first-order logic and probabilistic graphical models, such models are able to facilitate representation, reasoning and learning with complex relational information and rich probabilistic structure within a unifying framework. However, first-order probabilistic models may face various challenges in dealing with real-world situational awareness, including scalability of reasoning, learning and knowledge base construction, and robustness in open worlds. In this paper, we motivate a new and pragmatic approach toward collectively addressing these concerns; that is, endowing high-level fusion systems a capability to perform off-domain reasoning, through the ability to reason about unknown/unmodelled concepts. In particular, we will discuss how such an approach could be achieved by means of combining probabilistic and semantic similarity-based methods. We will also explore the potential contribution of semantic similarity measures derived from both taxonomic knowledge (e.g., ontologies) and distributional semantic models (generated from text corpora) toward achieving this goal.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127977090","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":"Unsupervised Bayesian Estimation and Tracking of Time-Varying Convolutive Multichannel Systems","authors":"H. Buchner, Karim Helwani, S. Godsill","doi":"10.23919/fusion43075.2019.9011190","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011190","url":null,"abstract":"In this paper we focus on Bayesian blind and semi-blind adaptive signal processing based on a broadband MIMO FIR model (e.g., for blind source separation (BSS) and blind system identification (BSI)). Specifically, we study in this paper a framework allowing us to systematically incorporate various types of prior knowledge: (1) source signal statistics, (2) deterministic knowledge on the mixing system, and (3) stochastic knowledge on the mixing system. In order to exploit all possible types of source signal statistics (1), our considerations are based on TRINICON, a previously introduced generic framework for broadband blind (and semi-blind) adaptive MIMO signal processing. The motivation for this paper is threefold: (a) the extension of TRINICON to Bayesian point estimation to address (3) in addition to (1), and (b) more specifically to unify system-based blind adaptive MIMO signal processing with the tracking of time-varying scenarios, and finally (c) to show how the Bayesian TRINICON-based tracking can be formulated as a sequence estimation approach on arbitrary partly smooth manifolds. As we will see in this paper, the Bayesian approach to incorporate stochastic priors and the manifold learning approach to exploit deterministic system knowledge (2) complement one another very efficiently in the context of TRINICON.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128760450","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}
Folker Hoffmann, Hans Schily, A. Charlish, M. Ritchie, H. Griffiths
{"title":"A Rollout Based Path Planner for Emitter Localization","authors":"Folker Hoffmann, Hans Schily, A. Charlish, M. Ritchie, H. Griffiths","doi":"10.23919/fusion43075.2019.9011368","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011368","url":null,"abstract":"This paper explores the problem of localizing an emitter with a mobile sensor platform using noisy bearing measurements. It is assumed, that the measuring procedure requires the platform to be stationary for a certain amount of time. Therefore, there exists a trade-off between using time to take one or more measurements and moving to a more advantageous position for observing a target. Using a rollout based algorithm we optimize the time necessary until a given localization accuracy is reached and compare the performance of this algorithm with several algorithms found in literature.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355313","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 Multiple Hypothesis Tracking in Finite Point Process Formalism: A Simple Two Station Case","authors":"S. Mori, C. Chong, K. Chang","doi":"10.23919/fusion43075.2019.9011284","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011284","url":null,"abstract":"In this paper, we present a general distributed multiple hypothesis tracking (MHT) framework in the finite point process (FPP) formalism, based on information graphs that describe arbitrary information exchanges among multiple distributed information processing stations. Our focus is, however, on a particular simple case where two stations exchange information periodically, to illustrate consequences of various assumptions, concerning independence among targets, target dynamics, and Poisson assumption.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130722884","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":"Non-Euclidean Kalman Filters for Nonlinear Measurements","authors":"Samuel A. Shapero, P. Miceli","doi":"10.23919/fusion43075.2019.9011350","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011350","url":null,"abstract":"Target tracking in the presence of nonlinear measurements has long been recognized as a challenge. When measurements are in polar coordinates this sometimes manifests itself as the ‘contact lens’ distribution, especially in radar applications. The authors propose a new filtering paradigm - the Non-Euclidean Kalman Filter (NEUKF) - to efficiently represent these nonlinear distributions using isomorphic coordinate transforms, which requires only modest computation beyond the popular Unscented Kalman Filter. They propose a family of parabolic isomorphisms well suited for representing the contact lens distribution. The NEUKF using one of the parabolic transforms is compared to a number of other prominent filters in both single and multiple sensor scenarios. The NEUKF demonstrates either the best-in-class or competitive precision and accuracy across all four scenarios, and is the only filter to maintain near perfect covariance consistency at all times.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"131 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763015","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 Learning over Time-Varying Graphs with Adversarial Agents","authors":"P. Vyavahare, Lili Su, N. Vaidya","doi":"10.23919/fusion43075.2019.9011353","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011353","url":null,"abstract":"In this work, we study the problem of non-Bayesian learning in time-varying (dynamic) networks when there are some adversarial (faulty) agents in the network. The set of faulty agents is fixed across time. The connectivity graph of the network is changing at each time step and is unknown to the agents. In every time step, each non-faulty agent collects partial information about an unknown state of the environment. Each non-faulty agent tries to estimate the true state of the environment by iteratively sharing information with its neighbors at each time step. We first present an analysis of a distributed algorithm in static communication network with faulty agents which does not require the network to achieve consensus. Existing algorithms in this setting require that all non-faulty agents in the network should be able to achieve consensus via local information exchange. We then extend this analysis to dynamic networks with relaxed network condition. We show that if every non-faulty agent can receive enough information (via iteratively communicating with neighbors) to differentiate the true state of the world from other possible states then it can indeed learn the true state.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804140","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":"Fusion within a Detection System Family","authors":"M. Oxley, Christine M. Schubert-Kabban","doi":"10.23919/fusion43075.2019.9011205","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011205","url":null,"abstract":"A detection system outputs two distinct labels, thus, there are two errors it can make. The Receiver Operating Characteristic (ROC) function quantifies both of these errors as parameters vary within the system. Combining two detection systems typically yields better performance when a combining rule is chosen appropriately. When two or more detection systems are combined the assumption of independence is usually made in order to simplify the mathematics, so that we need only combine the individual ROC curves from each system into one ROC curve. This paper investigates label fusion of two and more detection systems drawn from a single Detection System Family (DSF). Given that one knows the ROC function for the DSF, we seek a formula with the resultant ROC function of the fused detection systems as a function (specifically, a transformation) of the ROC function. In previous work, we derived this transformation for the disjunction and conjunction label rules. This paper extends those results to several detection systems within the same family. Examples are given that demonstrates these new transformations acting on the ROC function.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640882","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 Diffusion for Distributed Optimization over Multi-Agent Network with Random Delays (Poster)","authors":"Yi Qiu, Jie Zhou","doi":"10.23919/fusion43075.2019.9011172","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011172","url":null,"abstract":"Optimizing an aggregate function over a multi-agent network based on diffusion strategies calls for node collaborations, where each sensor exchanges information with their predefined neighbors within its transmission/reception range, and then combines them linearly with fixed and non-adaptive scalar weights to obtain a consensus solution. However, the transmission/reception process may be corrupted by random delays due to imperfect network environment. This paper proposes a distributed method to obtain the adaptive weights considering the occurrence of random one-step delays, which are depicted by Bernoulli random variables with known probability distributions. Then, an adaptive diffusion algorithm for optimizing the aggregate function is presented. Finally, numerical simulations are provided for validating the proposed method.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133061500","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":"SLAM Based on Double Layer Cubature Kalman Filter","authors":"Feng Yang, Bo Jin, Mengting Yan, Yujuan Luo","doi":"10.23919/fusion43075.2019.9011369","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011369","url":null,"abstract":"In the simultaneous localization and mapping (SLAM), the challenge is the large computational cost, low accuracy and instability. In SLAM system, cubature Kalman filter (CKF) has shown good performance. However, in terms of algorithm accuracy and stability, double layer cubature Kalman filter (DLCKF) is better than CKF. It calculates the predicted state at next moment through the inner layer CKF, which is more accurate than the predicted value obtained directly through motion model. The outer layer CKF then updates the predicted state with the measurement to obtain a more accurate estimate. Combined with the advantages of DLCKF, an innovative filter-based SLAM algorithm based on double layer cubature Kalman filter was established in this paper to solve the above problems. Simulation results are presented that the positioning error of the proposed algorithm is significantly reduced and the accuracy of mapping is greatly improved compared with traditional EKF-SLAM, UKF-SLAM and CKF-SLAM.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537161","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}