M. Atashi, Mohammad Salimibeni, Parvin Malekzadeh, Mihai Barbulescu, K. Plataniotis, Arash Mohammadi
{"title":"Multiple Model BLE-based Tracking via Validation of RSSI Fluctuations under Different Conditions","authors":"M. Atashi, Mohammad Salimibeni, Parvin Malekzadeh, Mihai Barbulescu, K. Plataniotis, Arash Mohammadi","doi":"10.23919/fusion43075.2019.9011367","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011367","url":null,"abstract":"Of particular interest to this paper is indoor positioning via integration of information fusion, localization, and tracking technologies with Internet of Things (IoT) devices equipped with sensing, processing, and Bluetooth Low Energy (BLE) communication capabilities. In particular, the objective is development of advanced signal processing and machine learning solutions to micro-locate and track a person within a delimited physical space (e.g. building) using BLE locating infrastructure installed within this space. In this regard and as the first step, the paper focuses on evaluation and validation of RSSI fluctuations under different environmental conditions. Therefore, the first goal of the paper is to implement a Location-Based Services (LBS) platform consisting of two main sub-systems, i.e., acquisition sub-system, and the Fusion Centre (FC). The second goal of the paper is to test and validate effects of different parameters on the RSSI values and on tracking performance. Based on real experiments, the implemented LBS platform shows potential capabilities for incorporation of different fusion frameworks and providing accurate tracking results.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"156 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":"124374125","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}
Cai Mi, Cui Yaqi, Lv Yafei, Z. Jing, Xiong Wei, Jiazheng Pei
{"title":"A New Network Structure for Semantic Segmentation of Ship Targets in Remote Sensing","authors":"Cai Mi, Cui Yaqi, Lv Yafei, Z. Jing, Xiong Wei, Jiazheng Pei","doi":"10.23919/fusion43075.2019.9011331","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011331","url":null,"abstract":"Accurate detection of ship targets is a research hotspot in computer vision. Most of the researches have achieved instance-level detection in the way of bounding box. But we intend to achieve more accurate detection of ship targets in pixel-level through semantic segmentation. However, there are still two main challenges: the first one is the difficulty to segment small targets caused by the difference among ship targets' scales, and the other one is the lack of localization information caused by insufficient recovery ability of the decoder part. In this paper, we propose an effective solution. First, a multi-scale pooling fusion module is proposed to fuse multi-scale feature maps and acquire more multi-scale context information, then we improve the capability of precise decoding by taking the place of convolution operation with deconvolution in the decoder part to gather more localization information. At last, we integrate above two schemes into an encoder-decoder symmetry training network with less training parameters and less training time. Furthermore, we construct a dataset for ship semantic segmentation called HRSC2016-SS by labeling HRSC2016 dataset to evaluate our solution. Experiments show that comparing with the existing methods, our proposed solution has a better performance.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"8 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":"121102802","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":"Autonomous Heart Rate Tracking Methodology Using Kalman Filter and the EM Algorithm","authors":"T. Souza, B. Balasingam, R. Maev","doi":"10.23919/fusion43075.2019.9011407","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011407","url":null,"abstract":"Accurate heart rate monitoring during intense physical activity is a challenging problem due to high levels of motion artifacts (MA) in sensors that rely on stable physical proximity/contact for accurate measurement extraction. Photo-plethysmography (PPG) sensor is a non-invasive optical sensor that is widely used in wearable devices, such as smartwatches, to measure blood volume changes using the property of light reflection and absorption; these measurements can be used to extract the heart rate (HR) of an individual wearing that device. The PPG sensor is susceptible to the motion artifact which increases with physical activity. Since the frequency of the motion artifact is very close to the range of HR, estimation of HR information becomes very challenging. As a result, MA removal remains an active research topic over the last few years. Several approaches have been developed in the recent past for MA removal and accurate HR estimation. Among these recent works, a Kalman Filter (KF) based approach showed promising results for accurate estimation and tracking of HR based on PPG measurements. However, the previous KF based HR tracker was demonstrated for a particular dataset with manually tuned filter parameters. Such a custom tuned approach might not perform accurately in practical scenarios where the amount of motion artifact and the heart-rate variability depend on numerous, unpredictable factors. In this paper, we develop an approach to automatically tune the KF based HR tracker based on the expectation maximization (EM) algorithm. The applicability of the proposed approach is demonstrated using an open-source PPG database that was recorded during varying pre-determined physical activities.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"157 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":"114379857","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":"Distribution-Dependent Distance of First Two Moments","authors":"X. Li","doi":"10.23919/fusion43075.2019.9011168","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011168","url":null,"abstract":"Closeness measures between distributions, between vectors, and between matrices abound. Many practical problems, however, call for measures of closeness between the first two moments of two unspecified distributions given only a sample of one of them or of a third distribution without other information. We present several metrics for such problems that demand special, distribution-dependent solutions, and show their good qualities. We demonstrate their rich applications in various areas, such as estimation performance analysis, efficiency of distributed fusion, metrized Kullback-Leibler divergence, decision performance evaluation, credibility of estimators, filter initialization, and empirical distribution function problems.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"38 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":"122174358","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":"How to Evaluate High Level Fusion Algorithms?","authors":"C. Laudy, N. Museux","doi":"10.23919/fusion43075.2019.9011206","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011206","url":null,"abstract":"Evaluating high level information fusion algorithms is a tricky problem. Most of the time, situations monitored through high level information fusion are complex, composed of multiple objects or entities, having heterogeneous properties and in relation with each other's. Many criteria have to be taken into account within the evaluation. In this paper, we define several performance evaluation criteria. We focus on criteria related to functional evaluation, namely the correctness, the completeness and the precision of the result, as well as the level of management of uncertainty of information. Our criteria rely on the comparison of the result, given by the evaluated fusion algorithm, with the expected result of a given set of information provided as an input benchmark. We then present a proposition to aggregate them together with the 2-additive Choquet integral to obtain a single evaluation score.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"71 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":"128992089","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}
Tongyu Ge, R. Tharmarasa, Bernard Lebel, M. Florea, T. Kirubarajan
{"title":"Target Localization and Sensor Synchronization in the Presence of Data Association Uncertainty","authors":"Tongyu Ge, R. Tharmarasa, Bernard Lebel, M. Florea, T. Kirubarajan","doi":"10.23919/fusion43075.2019.9011321","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011321","url":null,"abstract":"In passive sensor networks, sensor registration and data association are two essential processes. Although these two processes affect each other, they are usually addressed separately. In this paper, we propose an algorithm to localize multiple targets and estimate sensor clock biases using time difference of arrival (TDOA) measurements in the presence of data association uncertainty. The problem is formulated as a multidimensional optimization problem, where the objective is to maximize the generalized likelihood of the associated measurements based on target position and sensor clock bias estimates. Computer simulations are carried out to evaluate the performance of the proposed algorithm.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"1630 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":"129264054","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}
Simon Williams, Xuezhi Wang, D. Angley, C. Gilliam, B. Moran, Richard Ellem, T. Jackson, A. Bessell
{"title":"Dynamic Target Driven Trajectory Planning using RRT*","authors":"Simon Williams, Xuezhi Wang, D. Angley, C. Gilliam, B. Moran, Richard Ellem, T. Jackson, A. Bessell","doi":"10.23919/fusion43075.2019.9011157","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011157","url":null,"abstract":"In this paper, we focus on dynamic trajectory planning for an autonomous underwater vehicle (AUV). Specifically, we are interested in planning the trajectory of an AUV as it returns to a moving recovery vessel. To aid in this task, the AUV is equipped with a passive, angle-only, sensor to enable localization of the recovery vessel. Accordingly, we present an algorithm that is capable of dynamically updating the trajectory of the AUV given measurement data from the passive sensor. Our approach is based on adapting a static trajectory planning algorithm from robotics, known as Rapidly-exploring Random Tree (RRT*), to allow for localization and tracking of a dynamic target (i.e. the recovery vessel). In contrast to dynamic programming or fixed grid trajectory planning, the RRT* offers a computationally efficient method for long-term trajectory planning with probabilistic guarantees of optimality. In this framework, we explore two options: trajectory planning based on minimising the distance to the target; and trajectory planning based on maximising the tracking accuracy of the target using an information theoretic cost. Using AUV recovery as an evaluation scenario, we analyse and evaluate the proposed trajectory planning algorithm against traditional dynamic programming methods. In particular, we consider trajectory planning in noisy and obstructed environments.","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":"129582650","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":"Simplification of Multi-Criteria Decision-Making Using Inter-Criteria Analysis and Belief Functions","authors":"J. Dezert, A. Tchamova, Deqiang Han, J. Tacnet","doi":"10.23919/fusion43075.2019.9011326","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011326","url":null,"abstract":"In this paper we propose a new Belief Function-based Inter-Criteria Analysis (BF-ICrA) for the assessment of the degree of redundancy of criteria involved in a multicriteria decision making (MCDM) problem. This BF-ICrA method allows to simplify the original MCDM problem by withdrawing all redundant criteria and thus diminish the complexity of MCDM problem. This is of prime importance for solving large MCDM problems whose solution requires the fusion of many belief functions. We provide simple examples to show how this new BF-ICrA works.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"24 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":"130612030","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":"Uncertain Visual Target Tracking by Hierarchical Combination of Multiple Target State Space Model and Self Organizing Map","authors":"N. Ikoma","doi":"10.23919/fusion43075.2019.9011332","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011332","url":null,"abstract":"A novel visual target tracking method, where targets to be tracked are uncertain as they are not pre-determined, has been proposed in a framework of multiple target tracking formulation with Random Finite Set (RFS) and Probability Hypothesis Density (PHD) filter with its Sequential Monte Carlo (SMC) implementation. Self Organizing Map (SOM) and its learning algorithm have been combined to the framework as a post-process of the state estimation by SMC-PHD filter in order to classify the unlabelled set of particles, i.e. state estimation result, into structured knowledge of the scene. Synthetic and real video image experiments demonstrate preliminary results of the proposed method.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"94 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":"124213710","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":"Sensor Scheduling Under Action Dependent Decision-Making Epochs","authors":"D. Raihan, W. Faber, S. Chakravorty, I. Hussein","doi":"10.23919/fusion43075.2019.9011443","DOIUrl":"https://doi.org/10.23919/fusion43075.2019.9011443","url":null,"abstract":"In this paper, we consider the problem of optimally allocating sensing resources for maximizing information gained in a multi-target tracking scenario. In particular, we examine the optimal allocation of a single ground-based sensor to multiple space-based targets to maximize the information gained in the space situational awareness problem. The optimization problem is solved in a receding horizon fashion at action dependent decision epochs that are not assumed to occur at regular intervals. We use a parallel Markov Chain Monte Carlo algorithm to compute the optimal target assignment sequence under constraints posed by the dynamics of the sensor. Information gain is quantified in terms of the differential entropy of the state probability density function. The effectiveness of the approach is demonstrated through a simulation study.","PeriodicalId":348881,"journal":{"name":"2019 22th International Conference on Information Fusion (FUSION)","volume":"222 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":"121301129","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}