Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408046
D. Musicki
Assume an ESA (electronically steered antenna) radar. In between the surveillance mode operations (where the radar completes one scan of the surveillance area), this radar has spare time for (at least one) additional mode which could be optimized for various special requirements. The optimization is often translated to the choice of the next track to update. In this paper we propose a resource allocation scheme designed to minimize the time to confirmation of tracks following new targets, as well as to minimize the time to terminate tracks whose targets are lost or have disappeared from the view. The resource allocation cost is a function of the probability of target existence of individual tracks. Simulation results show that resource allocation based on this cost significantly increases the number of targets that can be reliably tracked in the sense of them being quickly followed by confirmed tracks upon arrival, and of their tracks being quickly terminated when the targets themselves disappear. The penalty of this approach is an increase in the root mean square target trajectory estimation errors of confirmed true tracks, as they are not updated as often.
{"title":"Target existence based resource allocation","authors":"D. Musicki","doi":"10.1109/ICIF.2007.4408046","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408046","url":null,"abstract":"Assume an ESA (electronically steered antenna) radar. In between the surveillance mode operations (where the radar completes one scan of the surveillance area), this radar has spare time for (at least one) additional mode which could be optimized for various special requirements. The optimization is often translated to the choice of the next track to update. In this paper we propose a resource allocation scheme designed to minimize the time to confirmation of tracks following new targets, as well as to minimize the time to terminate tracks whose targets are lost or have disappeared from the view. The resource allocation cost is a function of the probability of target existence of individual tracks. Simulation results show that resource allocation based on this cost significantly increases the number of targets that can be reliably tracked in the sense of them being quickly followed by confirmed tracks upon arrival, and of their tracks being quickly terminated when the targets themselves disappear. The penalty of this approach is an increase in the root mean square target trajectory estimation errors of confirmed true tracks, as they are not updated as often.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129884802","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408056
T. Hanselmann, M. Morelande
An algorithm for detection and tracking of multiple targets using bearings measurements from several sensors is developed. The algorithm is an implementation of a multiple hypothesis tracker with pruning of unlikely hypotheses. Tracking conditional on each hypothesis can be performed using any suitable filtering approximation. In this paper a range- parameterized unscented Kalman filter is used. Each hypothesis describes a track collection with varying number of targets. Final track estimates are obtained by weighted clustering according to hypothesis probabilities and clustered track states. Simulation experiments include arbitrary setup of multiple targets and multiple moving receiver platforms (sensors). The main results are the asynchronous modeling of measurements arrivals which allows an effective and efficient processing in a Bayesian MHT framework.
{"title":"Multiple target tracking with asynchronous bearings-only-measurements","authors":"T. Hanselmann, M. Morelande","doi":"10.1109/ICIF.2007.4408056","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408056","url":null,"abstract":"An algorithm for detection and tracking of multiple targets using bearings measurements from several sensors is developed. The algorithm is an implementation of a multiple hypothesis tracker with pruning of unlikely hypotheses. Tracking conditional on each hypothesis can be performed using any suitable filtering approximation. In this paper a range- parameterized unscented Kalman filter is used. Each hypothesis describes a track collection with varying number of targets. Final track estimates are obtained by weighted clustering according to hypothesis probabilities and clustered track states. Simulation experiments include arbitrary setup of multiple targets and multiple moving receiver platforms (sensors). The main results are the asynchronous modeling of measurements arrivals which allows an effective and efficient processing in a Bayesian MHT framework.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130034627","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408097
Cheng Zeng, Pinghui Wu
Evidence gathered from different sources may have different reliabilities. Such reliability should be integrated into corresponding evidence model to make the evidence combination result rational. In this paper, a novel discounting strategy is developed for the integration of evidence's model and reliability. Dissimilar to the current one based on BPA, this strategy discounts the evidence's plausibility function with power rather than discounts BPA function with coefficient. It can alter the evidence's belief mass as well as its core simultaneously and hereby is more suitable for the discounting of evidence with unreliable core than the one based on BPA function. Furthermore, this new strategy is in some sense a linear discounting strategy which reduces the maximum possible support degree for each atomic proposition with an amount proportional to discount percent. Finally, two examples are presented to demonstrate the characteristics of the proposed discounting strategy.
{"title":"A reliability discounting strategy based on plausibility function of evidence","authors":"Cheng Zeng, Pinghui Wu","doi":"10.1109/ICIF.2007.4408097","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408097","url":null,"abstract":"Evidence gathered from different sources may have different reliabilities. Such reliability should be integrated into corresponding evidence model to make the evidence combination result rational. In this paper, a novel discounting strategy is developed for the integration of evidence's model and reliability. Dissimilar to the current one based on BPA, this strategy discounts the evidence's plausibility function with power rather than discounts BPA function with coefficient. It can alter the evidence's belief mass as well as its core simultaneously and hereby is more suitable for the discounting of evidence with unreliable core than the one based on BPA function. Furthermore, this new strategy is in some sense a linear discounting strategy which reduces the maximum possible support degree for each atomic proposition with an amount proportional to discount percent. Finally, two examples are presented to demonstrate the characteristics of the proposed discounting strategy.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674622","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408176
Liang Dong, Jian-Kang Wu, Xiang Chen
A physical activity monitoring system by data fusion in body sensor networks is presented in this paper, which targets at providing body status information in real time and identifying body activities. By fusion of data collected from several accelerometer sensors placed on different parts of the body, the activities can be identified and tracked Mathematical approaches employed in the system include Kalman filter and hidden Markov model. With the proposed system architecture, these algorithms are distributed to different components of the system. The proposed system is applied to monitoring and identifying daily activities in laboratory and comparatively intensive activities in a gym room. Video-based approach is used as the benchmark to evaluate its performance. Comparative results indicate that, by using the proposed system, body status of daily activities can be estimated with good accuracy in real time, and body activity is identified with high accuracy within short system latency.
{"title":"Real-time physical activity monitoring by data fusion in body sensor networks","authors":"Liang Dong, Jian-Kang Wu, Xiang Chen","doi":"10.1109/ICIF.2007.4408176","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408176","url":null,"abstract":"A physical activity monitoring system by data fusion in body sensor networks is presented in this paper, which targets at providing body status information in real time and identifying body activities. By fusion of data collected from several accelerometer sensors placed on different parts of the body, the activities can be identified and tracked Mathematical approaches employed in the system include Kalman filter and hidden Markov model. With the proposed system architecture, these algorithms are distributed to different components of the system. The proposed system is applied to monitoring and identifying daily activities in laboratory and comparatively intensive activities in a gym room. Video-based approach is used as the benchmark to evaluate its performance. Comparative results indicate that, by using the proposed system, body status of daily activities can be estimated with good accuracy in real time, and body activity is identified with high accuracy within short system latency.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229384","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408031
O. Bilenne
This work is concerned with the design of sensor fusion methods using the fault-tolerant interval functions proposed by K. Marzullo and U. Schmid. A trade-off exists between the precision of the interval functions and their tolerance to invalid input intervals. The study shows how the performances of the interval functions in terms of expected length and variance can be estimated from their asymptotic properties for large data samples. Under certain conditions, the limits of the fault- tolerant interval functions are proven to belong to the class of M-estimators, and to be asymptotically normal when the number of input intervals grows to infinity. The precision of the interval functions is predicted by the approximation of the actual functions by linear functionals that are easier to handle. The relevance of the asymptotic properties of the interval functions for finite input sets is tested on a simulated example.
{"title":"Design of fault-tolerant interval functions based on their large-sample properties","authors":"O. Bilenne","doi":"10.1109/ICIF.2007.4408031","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408031","url":null,"abstract":"This work is concerned with the design of sensor fusion methods using the fault-tolerant interval functions proposed by K. Marzullo and U. Schmid. A trade-off exists between the precision of the interval functions and their tolerance to invalid input intervals. The study shows how the performances of the interval functions in terms of expected length and variance can be estimated from their asymptotic properties for large data samples. Under certain conditions, the limits of the fault- tolerant interval functions are proven to belong to the class of M-estimators, and to be asymptotically normal when the number of input intervals grows to infinity. The precision of the interval functions is predicted by the approximation of the actual functions by linear functionals that are easier to handle. The relevance of the asymptotic properties of the interval functions for finite input sets is tested on a simulated example.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128698886","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408055
D. Lambert
The state transition data fusion (STDF) model is an extension of the dominant sensor fusion paradigm to provide a unification of both sensor and higher-level fusion. Maritime domain awareness (MDA) is the problem of situation awareness in the maritime domain. This paper outlines an application of the STDF model to perform automated situation assessments for an aspect of MDA.
{"title":"STDF model based maritime situation assessments","authors":"D. Lambert","doi":"10.1109/ICIF.2007.4408055","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408055","url":null,"abstract":"The state transition data fusion (STDF) model is an extension of the dominant sensor fusion paradigm to provide a unification of both sensor and higher-level fusion. Maritime domain awareness (MDA) is the problem of situation awareness in the maritime domain. This paper outlines an application of the STDF model to perform automated situation assessments for an aspect of MDA.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114430345","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408075
O. Ozdemir, R. Niu, P. Varshney
In this paper, we propose a new maximum-likelihood (ML) target location estimator which uses quantized sensor data and wireless channel statistics in a wireless sensor network. The novelty of our approach comes from the fact that imperfect channel statistics between wireless sensors and the fusion center are incorporated in the localization algorithm. We call this approach "channel-aware target localization". Furthermore, we derive the Cramer-Rao lower bound as a performance bound for our channel-aware ML estimator. Simulation results are presented to show that the performance of the channel-aware ML location estimator is quite close to its theoretical performance bound even with relatively small number of sensors and it has superior performance compared to that of the channel-unaware ML estimator.
{"title":"Channel aware target localization in wireless sensor networks","authors":"O. Ozdemir, R. Niu, P. Varshney","doi":"10.1109/ICIF.2007.4408075","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408075","url":null,"abstract":"In this paper, we propose a new maximum-likelihood (ML) target location estimator which uses quantized sensor data and wireless channel statistics in a wireless sensor network. The novelty of our approach comes from the fact that imperfect channel statistics between wireless sensors and the fusion center are incorporated in the localization algorithm. We call this approach \"channel-aware target localization\". Furthermore, we derive the Cramer-Rao lower bound as a performance bound for our channel-aware ML estimator. Simulation results are presented to show that the performance of the channel-aware ML location estimator is quite close to its theoretical performance bound even with relatively small number of sensors and it has superior performance compared to that of the channel-unaware ML estimator.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122797105","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408169
D. Gains
We describe data fusion technology relevant to two applications of potential benefit to the Canadian army. The first application is a local situational awareness system (LSAS) while the second is a versatile surveillance platform. The LSAS improves an armored vehicle crew's ability to recognize and locate threats and hazards without leaving the relative safety of their vehicle. It is designed primarily to protect the soldiers involved. The surveillance application augments an operator's ability to detect and track objects of interest. This is desirable in modern environments where there are large numbers of closely spaced potential targets.
{"title":"Data fusion for Canadian army applications","authors":"D. Gains","doi":"10.1109/ICIF.2007.4408169","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408169","url":null,"abstract":"We describe data fusion technology relevant to two applications of potential benefit to the Canadian army. The first application is a local situational awareness system (LSAS) while the second is a versatile surveillance platform. The LSAS improves an armored vehicle crew's ability to recognize and locate threats and hazards without leaving the relative safety of their vehicle. It is designed primarily to protect the soldiers involved. The surveillance application augments an operator's ability to detect and track objects of interest. This is desirable in modern environments where there are large numbers of closely spaced potential targets.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"111 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120824228","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408005
Y. Boers, H. Driessen
In this paper the so called mixed labeling problem inherent, or at least thought to be inherent to a joint state multi target particle filter implementation is treated. The mixed labeling problem would be prohibitive for track extraction from a joint state multi target particle filter. It is shown and proven using the theory of Markov chains, that the mixed labeling problem is inherently self-resolving in a particle filter. It is also shown that the factors influencing this capability are the number of particles and the number of resampling steps.
{"title":"The mixed labeling problem in multi target particle filtering","authors":"Y. Boers, H. Driessen","doi":"10.1109/ICIF.2007.4408005","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408005","url":null,"abstract":"In this paper the so called mixed labeling problem inherent, or at least thought to be inherent to a joint state multi target particle filter implementation is treated. The mixed labeling problem would be prohibitive for track extraction from a joint state multi target particle filter. It is shown and proven using the theory of Markov chains, that the mixed labeling problem is inherently self-resolving in a particle filter. It is also shown that the factors influencing this capability are the number of particles and the number of resampling steps.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126828779","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}
Pub Date : 2007-07-09DOI: 10.1109/ICIF.2007.4408217
J. Llinas
The international defense and security community is moving ahead at flank speed to realize the vision of network centric warfare (NCW; aka network-enabled capability (NEC) and etc). Extensive efforts are being put forth to define, design, and develop many of the technical components of such a capability, to include varieties of networked communications systems, various highly-capable military platforms, and "service-oriented architectures" for a broad-based enterprise service middleware capability. To varying degrees, the human factors/human engineering community has also engaged in broad studies of "sensemaking" and "shared awareness" toward understanding some of the information-sharing and information- understanding paradigms put forward in the NCW literature.
{"title":"Intelligent agents as one framework for defining fusion requirements for complex adaptive systems","authors":"J. Llinas","doi":"10.1109/ICIF.2007.4408217","DOIUrl":"https://doi.org/10.1109/ICIF.2007.4408217","url":null,"abstract":"The international defense and security community is moving ahead at flank speed to realize the vision of network centric warfare (NCW; aka network-enabled capability (NEC) and etc). Extensive efforts are being put forth to define, design, and develop many of the technical components of such a capability, to include varieties of networked communications systems, various highly-capable military platforms, and \"service-oriented architectures\" for a broad-based enterprise service middleware capability. To varying degrees, the human factors/human engineering community has also engaged in broad studies of \"sensemaking\" and \"shared awareness\" toward understanding some of the information-sharing and information- understanding paradigms put forward in the NCW literature.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131249901","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：