发布求助
文献互助 智能选刊 最新文献

2006 9th International Conference on Information Fusion最新文献

筛选
英文 中文
A Bayesian approach to predicting an unknown number of targets based on sensor performance 基于传感器性能预测未知目标数量的贝叶斯方法
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301776
K. Bryan, C. Carthel
{"title":"A Bayesian approach to predicting an unknown number of targets based on sensor performance","authors":"K. Bryan, C. Carthel","doi":"10.1109/ICIF.2006.301776","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301776","url":null,"abstract":"Estimating remaining targets after some attempt has been made to detect an overall, unknown number of targets is critical to determining the potential threat associated with these remaining targets. This paper presents a Bayesian approach to calculate the distribution on the number of remaining targets given the sensor performance and the number of targets detected. For a single sensor, a closed form posterior distribution on remaining targets is derived. For multiple sensors, the corresponding posterior distribution is developed. A naive implementation of this calculation is shown to be computationally prohibitive, and an efficient means for performing the calculation is presented","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115455894","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}
引用次数: 7
Categories of Situations for Level 2 Fusion 2级融合的情况分类
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301768
M. Oxley, A. L. Magnus, S. Thorsen
{"title":"Categories of Situations for Level 2 Fusion","authors":"M. Oxley, A. L. Magnus, S. Thorsen","doi":"10.1109/ICIF.2006.301768","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301768","url":null,"abstract":"In this paper we use category theory to define a situation. We seek a mathematical formalism to discuss a situation which will enable tightly integrated sensor management and planning systems","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127228401","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
Optimal Scheduling for State Estimation Using a Terminal Cost Function 基于终端成本函数的状态估计最优调度
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301677
C.O. Savage, B. L. Scala, W. Moran
{"title":"Optimal Scheduling for State Estimation Using a Terminal Cost Function","authors":"C.O. Savage, B. L. Scala, W. Moran","doi":"10.1109/ICIF.2006.301677","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301677","url":null,"abstract":"In this paper we consider state estimation problems where there are multiple independent processes evolving but the estimation scheme can only select a limited set of processes to measure at each time step. Within a Gauss-Markov framework, we show the optimality of a scheduling scheme under various scenarios. These types of problems are common in sensor scheduling applications","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125376965","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
Distributed Environmental Inversion for Multi-Static Sonar Tracking 多静态声纳跟踪的分布式环境反演
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301710
J. Pitton, A. Ganse, Gregory Anderson, D. Krout
{"title":"Distributed Environmental Inversion for Multi-Static Sonar Tracking","authors":"J. Pitton, A. Ganse, Gregory Anderson, D. Krout","doi":"10.1109/ICIF.2006.301710","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301710","url":null,"abstract":"This paper presents an approach for adapting a tracking algorithm to the acoustic propagation environment. This adaptation is performed by incorporating the expected target signal-to-noise ratio (SNR) into the data association step through the measured contact amplitude. In this work, expected SNR is provided via acoustic modeling; estimates of bottom loss and scattering strength, required by the acoustic model, are obtained via inversion of the acoustic model based on measured multi-static sonar reverberation data. This paper shows that the use of distributed sensors provides improved estimates of the environmental parameters, and hence better estimates of the expected SNR","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127253083","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
Generalized Information Representation and Compression Using Covariance Union 基于协方差联合的广义信息表示与压缩
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301773
Ottmar Bochardt, Ryan Calhoun, J. Uhlmann, S. Julier
{"title":"Generalized Information Representation and Compression Using Covariance Union","authors":"Ottmar Bochardt, Ryan Calhoun, J. Uhlmann, S. Julier","doi":"10.1109/ICIF.2006.301773","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301773","url":null,"abstract":"In this paper we consider the use of Covariance Union (CU) with multi-hypothesis techniques (MHT) and Gaussian mixture models (GMMs) to generalize the conventional mean and covariance representation of information. More specifically, we address the representation of multi-modal information using multiple mean and covariance estimates. A significant challenge is to define a rigorous fusion algorithm that can bind the complexity of the filtering process. This requires a mechanism for subsuming subsets of modes into single modes so that the complexity of the representation satisfies a specified upper bound. We discuss how this can be accomplished using CU. The practical challenge is to develop efficient implementations of the CU algorithm. Because of the novelty of the CU algorithm, there are no existing real-time codes for use in real applications. In this paper we address this deficiency by considering a general-purpose implementation of the CU algorithm based on general nonlinear optimization techniques. Computational results are reported","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127289648","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}
引用次数: 30
Real-Time Tracking Of Hundreds Of Targets With Efficient Exact JPDAF Implementation 实时跟踪数百个目标与有效的精确JPDAF实现
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301561
P. Horridge, S. Maskell
{"title":"Real-Time Tracking Of Hundreds Of Targets With Efficient Exact JPDAF Implementation","authors":"P. Horridge, S. Maskell","doi":"10.1109/ICIF.2006.301561","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301561","url":null,"abstract":"An assignment problem is considered with the constraint that the same hypothesis cannot be applied to more than one object. We desire efficiency without approximation. Multiple target tracking methods such as the joint probabilistic association filter (JPDAF) motivate us. Methods of solving this assignment problem involving enumerating all possible joint assignments is infeasible except for small problems. A recent approach circumvents this combinatorial explosion by representing the structure of the target hypotheses in a `net' which exploits redundancy in an ordered list of objects us to describe the problem. Here, we generalize this approach to process the objects in a tree structure this exploits conditional independence between subsets of the objects. This gives a substantial computational saving and allows us to consider scenarios which were previously impractical. In particular, we show the feasibility of using an exact JPDAF implementation to track 400 targets","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661104","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}
引用次数: 43
Estimation of Attitude and Position from Range-Only Measurements using Geometric Descent Optimization on the Special Euclidean Group 基于特殊欧几里得群几何下降优化的距离测量姿态和位置估计
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301621
Alex Alcocer Peñas, P. Oliveira, A. Pascoal, J. Xavier
{"title":"Estimation of Attitude and Position from Range-Only Measurements using Geometric Descent Optimization on the Special Euclidean Group","authors":"Alex Alcocer Peñas, P. Oliveira, A. Pascoal, J. Xavier","doi":"10.1109/ICIF.2006.301621","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301621","url":null,"abstract":"This paper addresses the problem of estimating the position and attitude of a rigid body when the available measurements consist only of distances (or ranges) between a set of body fixed beacons and a set of earth fixed landmarks. To this effect, a maximum likelihood (ML) estimator is derived by solving an optimization problem on the special Euclidean group SE(n);n = 2,3 using intrinsic gradient and Newton-like algorithms. The theoretical tools used borrow from optimization theory on Riemannian manifolds. Supported by recent results on performance bounds for estimators on Riemannian manifolds, the intrinsic variance lower bound (IVLB) is derived for the problem at hand. Simulation results are presented to illustrate the estimator performance and to validate the tightness of the IVLB in a wide range of signal to noise ratio scenarios","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121940038","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}
引用次数: 12
A Fixed Lag IPDA Smoothing for Target Tracking in Clutter 杂波条件下目标跟踪的固定滞后IPDA平滑
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301567
R. Chakravorty, D. Musicki, S. Challa
{"title":"A Fixed Lag IPDA Smoothing for Target Tracking in Clutter","authors":"R. Chakravorty, D. Musicki, S. Challa","doi":"10.1109/ICIF.2006.301567","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301567","url":null,"abstract":"This paper presents a fixed lag smoothing algorithm for target tracking in clutter. The proposed algorithm is based on integrated probabilistic data association (IPDA) approach. The algorithm runs two filters for each track-one in forward direction (as standard IPDA) and the other in backward direction. A standard fusion of both the target existence probability and state estimates of both the filters at a fixed time lag yields the smoothed probability densities of both of them. The paper also presents the refined target dynamics and target existence transition model for backward running IPDA filter. Simulation results are also presented to compare the performance (in terms of true track detection, false track discrimination) of the proposed IPDA smoother with that of augmented state IPDA filter and standard IPDA filter","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774864","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
Spatiotemporal Clustering for Aggregating Hostile Units in Cluttered Environments 杂乱环境中敌对单位聚集的时空聚类
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301672
S. Das, P. Kanjilal, D. Lawless
{"title":"Spatiotemporal Clustering for Aggregating Hostile Units in Cluttered Environments","authors":"S. Das, P. Kanjilal, D. Lawless","doi":"10.1109/ICIF.2006.301672","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301672","url":null,"abstract":"We describe a novel clustering approach for aggregating mobile (typically potentially hostile) units in cluttered urban environments. The approach consists of a suite of spatiotemporal clustering algorithms that leverage the wealth of military sensor data available to provide insight into \"what is strange\" about a given situation, without knowing beforehand what exactly we are looking for. The algorithms perform a space and time-series analysis of sensor messages independently of any contextual or semantic information. The algorithms can, for example, detect patterns and track for spatially correlated moving units over time within the environment. The patterns thus detected trigger follow-up assessment of the newly developed situations, resulting in invocations of various doctrine-based computational models to identify higher-level situations (e.g. attack, ambush, interdiction, insurgency). We provide some experimental results analyzing the performance of the clustering algorithms","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122058080","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}
引用次数: 4
An Energy-Division Multiple Access Scheme 能源分配多址方案
2006 9th International Conference on Information Fusion Pub Date : 2006-07-10 DOI: 10.1109/ICIF.2006.301771
P. Rossi, G. Romano, D. Mattera, F. Palmieri, S. Maranò
{"title":"An Energy-Division Multiple Access Scheme","authors":"P. Rossi, G. Romano, D. Mattera, F. Palmieri, S. Maranò","doi":"10.1109/ICIF.2006.301771","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301771","url":null,"abstract":"A new multiple access scheme based on energy discrimination is proposed. Such a scheme is based on the differences in the average power received by each user. It is particularly useful when no extra resources are available by means of existing schemes; moreover, it is useful when the system complexity must be kept very limited.","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123591975","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}
引用次数: 5
首页 上一页 下一页 尾页
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学术官方微信