2021 IEEE 24th International Conference on Information Fusion (FUSION)最新文献

筛选
英文 中文
Wide-Area Multistatic Sonar Tracking 广域多声纳跟踪
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626888
S. Coraluppi, C. Carthel, R. Prengaman
{"title":"Wide-Area Multistatic Sonar Tracking","authors":"S. Coraluppi, C. Carthel, R. Prengaman","doi":"10.23919/fusion49465.2021.9626888","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626888","url":null,"abstract":"Sensors with poor bearing resolution pose a significant challenge for multi-target tracking, as cross-range error becomes very large at long ranges. While multi-sensor fusion provides benefit towards higher-precision tracking, there are two key difficulties to confront. The first is to address measurement association ambiguities, which we address via advanced multiple-hypothesis tracking. The second is to perform robust track initialization and filtering, which we achieve via a two-point filter initialization approach followed by (sequential) extended Kalman filtering. In the specific context of active sonar tracking, the impact of finite sound speed poses an additional challenge. Addressing this requires a generalized MHT solution that accounts for measurement-specific time stamps and allows for out-of-sequence measurement processing. The enhancements discussed in this paper yield a robust capability for wide-area multistatic sonar tracking.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122928803","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}
引用次数: 1
Deterministic Gaussian Sampling With Generalized Fibonacci Grids
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626975
Daniel Frisch, U. Hanebeck
{"title":"Deterministic Gaussian Sampling With Generalized Fibonacci Grids","authors":"Daniel Frisch, U. Hanebeck","doi":"10.23919/fusion49465.2021.9626975","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626975","url":null,"abstract":"We propose a simple and efficient method to obtain unweighted deterministic samples of the multivariate Gaussian density. It allows to place a large number of homogeneously placed samples even in high-dimensional spaces. There is a demand for large high-quality sample sets in many nonlinear filters. The Smart Sampling Kalman Filter (S2KF), for example, uses many samples and is an extension of the Unscented Kalman Filter (UKF) that is limited due to its small sample set. Generalized Fibonacci grids have the property that if stretched or compressed along certain directions, the grid points keep approximately equal distances to all their neighbors. This can be exploited to easily obtain deterministic samples of arbitrary Gaussians. As the computational effort to generate these anisotropically scalable point sets is low, generalized Fibonacci grid sampling appears to be a great new source of large sample sets in high-quality state estimation.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127825794","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}
引用次数: 3
Co-Training an Observer and an Evading Target 共同训练观察者和回避目标
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/FUSION49465.2021.9627024
André Brandenburger, Folker Hoffmann, A. Charlish
{"title":"Co-Training an Observer and an Evading Target","authors":"André Brandenburger, Folker Hoffmann, A. Charlish","doi":"10.23919/FUSION49465.2021.9627024","DOIUrl":"https://doi.org/10.23919/FUSION49465.2021.9627024","url":null,"abstract":"Reinforcement learning (RL) is already widely applied to applications such as robotics, but it is only sparsely used in sensor management. In this paper, we apply the popular Proximal Policy Optimization (PPO) approach to a multi-agent UAV tracking scenario. While recorded data of real scenarios can accurately reflect the real world, the required amount of data is not always available. Simulation data, however, is typically cheap to generate, but the utilized target behavior is often naive and only vaguely represents the real world. In this paper, we utilize multi-agent RL to jointly generate protagonistic and antagonistic policies and overcome the data generation problem, as the policies are generated on-the-fly and adapt continuously. This way, we are able to clearly outperform baseline methods and robustly generate competitive policies. In addition, we investigate explainable artificial intelligence (XAI) by interpreting feature saliency and generating an easy-to-read decision tree as a simplified policy.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599085","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}
引用次数: 0
A New Image Fusion Method for Ship Target Enhancement in Spaceborne and Airborne SAR Collaboration 星载与机载协同SAR中舰船目标增强的图像融合新方法
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626972
Xueqian Wang, D. Zhu, Gang Li, Xiao-Ping Zhang
{"title":"A New Image Fusion Method for Ship Target Enhancement in Spaceborne and Airborne SAR Collaboration","authors":"Xueqian Wang, D. Zhu, Gang Li, Xiao-Ping Zhang","doi":"10.23919/fusion49465.2021.9626972","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626972","url":null,"abstract":"In this paper, we investigate the fusion of spaceborne synthetic aperture radar (SAR) and airborne SAR images and its application to ship target enhancement. In this paper, we propose a new target proposal and clutter copula (TPCC)-based image fusion method for the collaboration of spaceborne and airborne SARs. TPCC enhances the common ship target areas in spaceborne and airborne SAR images via the intersection of target proposals and suppresses the clutter areas by establishing the joint distribution of clutter in the spaceborne and airborne SAR images based on the copula theory. Compared with other commonly used image fusion methods, the target dependence and clutter dependence in the spaceborne and airborne SAR images are newly exploited in TPCC. We demonstrate the superiority of TPCC in terms of target-to-clutter ratios (TCRs) by using composite images combining Gaofen-3 satellite and unmanned aerial vehicle (UAV) SAR images.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115776567","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}
引用次数: 0
Localization and Tracking of High-speed Trains Using Compressed Sensing Based 5G Localization Algorithms 基于压缩感知的5G定位算法的高速列车定位与跟踪
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626875
M. Trivedi, J. V. Wyk
{"title":"Localization and Tracking of High-speed Trains Using Compressed Sensing Based 5G Localization Algorithms","authors":"M. Trivedi, J. V. Wyk","doi":"10.23919/fusion49465.2021.9626875","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626875","url":null,"abstract":"Complex systems are in place for the localization and tracking of High-speed Trains. These methods tend to perform poorly under certain conditions. Localization using 5G infrastructure has been considered as an alternative solution for the positioning of trains in previous studies. However, these studies only consider localization using Time Difference of Arrival measurements or using Time of Arrival and Angle of Departure measurements. In this paper an alternate compressed sensing based 5G localization method is considered for this problem. The proposed algorithm, paired with an Extended Kalman Filter, is implemented and tested on a 3GPP specified high s peed train scenario. Sub-meter localization accuracy was achieved using 4-6 Remote-Radio-Heads, while an accuracy of 0.34 m with 95% availability is achieved when using 2 Remote-Radio-Heads. The achieved performance meets 3GPP specified requirement for machine control and transportation even when using 2 Remote-Radio-Heads.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114095278","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}
引用次数: 1
Analysis of recycling performance in Poisson multi-Bernoulli mixture filters 泊松-伯努利混合过滤器循环性能分析
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626873
Xingxiang Xie, Yang Wang
{"title":"Analysis of recycling performance in Poisson multi-Bernoulli mixture filters","authors":"Xingxiang Xie, Yang Wang","doi":"10.23919/fusion49465.2021.9626873","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626873","url":null,"abstract":"In a multi-target tracking (MTT) scenario, the computational cost of usual Poisson multi-Bernoulli mixture (PMBM) filter will rise rapidly as the increasing number of global hypotheses. In order to lower computational cost, this paper presents to apply recycling algorithm to PMBM filter. The proposed method is done by recycling Bernoulli components which are less than a fixed threshold, approximate them as Poisson point process (PPP), thus add the intensity to the undetected PPP intensity. In the numerical experiment, we apply recycling algorithm to PMBM, Poisson multi-Bernoulli (PMB) and multi-Bernoulli mixture (MBM), respectively. The result shows that the Bernoulli recycling algorithm leads to lower computational cost in a simulated scenario.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079198","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}
引用次数: 3
Securing the D istributed Kalman Filter Against Curious Agents D分布卡尔曼滤波器对好奇代理的保护
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9627034
Ashkan Moradi, Naveen K. D. Venkategowda, S. Talebi, Stefan Werner
{"title":"Securing the D istributed Kalman Filter Against Curious Agents","authors":"Ashkan Moradi, Naveen K. D. Venkategowda, S. Talebi, Stefan Werner","doi":"10.23919/fusion49465.2021.9627034","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9627034","url":null,"abstract":"Distributed filtering techniques have emerged as the dominant and most prolific class of filters used in modern monitoring and surveillance applications, such as smart grids. As these techniques rely on information sharing among agents, user privacy and information security have become a focus of concern. In this manuscript, a privacy-preserving distributed Kalman filter (PP-DKF) is derived that maintains privacy by decomposing the information into public and private substates, where only a perturbed version of the public substate is shared among neighbors. The derived PP-DKF provides privacy by restricting the amount of information exchanged with state decomposition and conceals private information by injecting a carefully designed perturbation sequence. A thorough analysis is performed to characterize the privacy-accuracy trade-offs involved in the distributed filter, with privacy defined as the mean squared estimation error of the private information at the honest-but-curious agent. The resulting PP-DKF improves the overall filtering performance and privacy of all agents compared to distributed Kalman filters employing contemporary privacy-preserving average consensus techniques. Several simulation examples corroborate the theoretical results.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115317325","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}
引用次数: 2
Robust Linearly Constrained Filtering for GNSS Position and Attitude Estimation under Antenna Baseline Mismatch 天线基线不匹配下GNSS位置和姿态估计的鲁棒线性约束滤波
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626840
P. Chauchat, D. Medina, J. Vilà‐Valls, É. Chaumette
{"title":"Robust Linearly Constrained Filtering for GNSS Position and Attitude Estimation under Antenna Baseline Mismatch","authors":"P. Chauchat, D. Medina, J. Vilà‐Valls, É. Chaumette","doi":"10.23919/fusion49465.2021.9626840","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626840","url":null,"abstract":"Precise navigation solutions are fundamental for new intelligent transportation systems and robotics applications, where attitude also plays an important role. Among the different technologies available, Global Navigation Satellite Systems (GNSS) are the main source of positioning data. In the GNSS context, carrier phase observations are mandatory to obtain precise positioning, and multiple antenna setups must be considered for attitude determination. Position and attitude estimation have been traditionally tackled in a separate manner within the GNSS community, but a recently introduced recursive joint position and attitude (JPA) Kalman filter-like approach has shown the potential benefits of the joint estimation. One of the drawbacks of the original JPA is the assumption of perfect system knowledge, and in particular the baseline distance between antennas, which may not be the case in real-life applications and can lead to a severe performance degradation. The goal of this contribution is to propose a robust filtering approach able to mitigate the impact of a possible GNSS antenna baseline mismatch, exploiting the use of linear constraints. Illustrative results are provided to support the discussion and show the performance improvement, for both GNSS-based attitude-only and JPA estimation.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895496","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}
引用次数: 0
Determinants of audit fees: Evidence from Compustat database from 2009-2019 审计费用的决定因素:来自Compustat数据库2009-2019年的证据
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626872
Vusumuzi Malele, M. E. Letsoalo, M. Mafu
{"title":"Determinants of audit fees: Evidence from Compustat database from 2009-2019","authors":"Vusumuzi Malele, M. E. Letsoalo, M. Mafu","doi":"10.23919/fusion49465.2021.9626872","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626872","url":null,"abstract":"The firm’s financial characteristics affecting the audit fees are determined based on the 2099 firms listed on the Compustat database from 2009-2019. A more comprehensive view of this subject is provided by analyzing fundamental financial, statistical, and market information from thousands of companies worldwide based on the database. The best set of predictor variables are identified using descriptive statistics, correlation matrices, and exploratory data analysis. A regression model is built to test and measure the relationship and significance between these predictor variables and audit fees. Notably, results confirm that the firm financial characteristics ACT, INVT, LCT, AT, EBIT, EBITDA, and CEQ determine audit fees. Furthermore, the audit fees are negatively and significantly related to PIFO, FYEAR, EMP, and GVKEY. Previously, studies focused on determinants such as firm size, status of the audit firm, and corporate complexity. Thus, this work integrates an international financial perspective in the determination of audit fees.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284234","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}
引用次数: 0
Enhanced Fixed-Interval Smoothing for Markovian Switching Systems 马尔可夫切换系统的改进定区间平滑
2021 IEEE 24th International Conference on Information Fusion (FUSION) Pub Date : 2021-11-01 DOI: 10.23919/fusion49465.2021.9626863
Xi Li, Yi Liu, Le Yang, L. Mihaylova, Bing Deng
{"title":"Enhanced Fixed-Interval Smoothing for Markovian Switching Systems","authors":"Xi Li, Yi Liu, Le Yang, L. Mihaylova, Bing Deng","doi":"10.23919/fusion49465.2021.9626863","DOIUrl":"https://doi.org/10.23919/fusion49465.2021.9626863","url":null,"abstract":"This paper considers the problem of fixed-interval smoothing for Markovian switching systems with multiple linear state-space models. An enhanced algorithm that is capable of accurately approximating the Bayesian optimal smoother is proposed. It utilizes the exact expression for the quotient of two Gaussian densities to help solve the backward-time recursive equations of Bayesian smoothing, and computes the joint posterior of the state vector and model index. The proposed algorithm only involves the approximation of each model-matched state posterior, which is a Gaussian mixture, with a single Gaussian density for maintaining computational tractability in retrodiction. The validity of the newly developed smoother is verified using a simulated maneuvering target tracking task.","PeriodicalId":226850,"journal":{"name":"2021 IEEE 24th International Conference on Information Fusion (FUSION)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125714027","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信