{"title":"Benchmarking knowledge-assisted kriging for automated spatial interpolation of wind measurements","authors":"Z. Zlatev, S. Middleton, G. Veres","doi":"10.1109/ICIF.2010.5711918","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711918","url":null,"abstract":"We have benchmarked a novel knowledge-assisted kriging algorithm that allows regions of spatial cohesion to be specified and variograms calculated for each region. The variogram calculation itself is automated and spatial regions created via offline automated segmentation of either expert-drawn Google Earth polygons or NASA altitude data. Our use-case is to create interpolated wind maps for input into a bathing water quality model of microbial contamination. We benchmark our knowledge-assisted kriging algorithm against 7 other algorithms on UK met-office wind data (189 sensors). Our wind estimation results are comparable to standard ordinary kriging using variograms created by an expert. When using spatial segmentation we find our kriging error maps reflect better the known spatial features of the interpolated phenomenon. These results are very promising for an automated approach allowing on-demand datasets selection and real-time interpolation of previously unknown measurements. Automation is important in progressing towards a pan-European interpolation service capability.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134524530","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":"Bounding linearization errors with sets of densities in approximate Kalman filtering","authors":"B. Noack, Vesa Klumpp, N. Petkov, U. Hanebeck","doi":"10.1109/ICIF.2010.5711909","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711909","url":null,"abstract":"Applying the Kalman filtering scheme to linearized system dynamics and observation models does in general not yield optimal state estimates. More precisely, inconsistent state estimates and covariance matrices are caused by neglected linearization errors. This paper introduces a concept for systematically predicting and updating bounds for the linearization errors within the Kalman filtering framework. To achieve this, an uncertain quantity is not characterized by a single probability density anymore, but rather by a set of densities and accordingly, the linear estimation framework is generalized in order to process sets of probability densities. By means of this generalization, the Kalman filter may then not only be applied to stochastic quantities, but also to unknown but bounded quantities. In order to improve the reliability of Kalman filtering results, the last-mentioned quantities are utilized to bound the typically neglected nonlinear parts of a linearized mapping.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133198153","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}
Lingling Zhao, Peijun Ma, Xiaohong Su, Hongtao Zhang
{"title":"A new multi-target state estimation algorithm for PHD particle filter","authors":"Lingling Zhao, Peijun Ma, Xiaohong Su, Hongtao Zhang","doi":"10.1109/ICIF.2010.5711923","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711923","url":null,"abstract":"Probability hypothesis density (PHD) filter is a new practical method to solve the unknown time-varying multi-target tracking problem. Particle filter implementation of the PHD filter has demonstrated a feasible suboptimal method for tracking multi-target in real-time. To obtain the target states, the peak-extraction from the posterior PHD particles needs to be implemented. A new state estimation method is proposed in this paper, which doesn't need to extract the PHD peaks. The method provides a single-target PHD expression derived from the updated PHD equation. The single-target PHD is approximated by the particles and their weights relevant to the observation. Thus the target states can be directly estimated from the single-target PHD sequentially. Simulation results demonstrate that the new algorithm provides more accurate state estimations and is more efficient than the traditional multi-target state estimation methods such as k-means clustering algorithm.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132968500","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":"Joint identification and tracking of multiple CBRNE clouds based on sparsity pursuit","authors":"Huimin Chen, X. Li","doi":"10.1109/ICIF.2010.5711849","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711849","url":null,"abstract":"The evolution of chemical, biological, radiological, nuclear and explosive (CBRNE) clouds depends considerably on its composition. For example, cloud tracking usually relies on a diffusion model of the average atmospheric concentration of the CBRNE material; identification of its composition can benefit greatly from knowledge about the propagation of the compounds. As a result, substance classification and cloud tracking help each other significantly. However, few research efforts consider joint identification and tracking of CBRNE clouds using a network of possibly heterogeneous sensors. This paper deals with such joint identification and tracking. We assume that the chemical composition has a sparse representation in the Raman spectra with a reference library and apply a sparsity pursuit algorithm to adaptively refine the cloud propagation model based on the estimated composition. We demonstrate the benefit of joint identification and tracking of the aggregated clouds when individual substance has a different diffusion coefficient. The results also provide guidelines for selecting an appropriate sensor combination to accurately predict the cloud boundary.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096110","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":"Support-vector conditional density estimation for nonlinear filtering","authors":"P. Krauthausen, Marco F. Huber, U. Hanebeck","doi":"10.1109/ICIF.2010.5712088","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712088","url":null,"abstract":"A non-parametric conditional density estimation algorithm for nonlinear stochastic dynamic systems is proposed. The contributions are a novel support vector regression for estimating conditional densities, modeled by Gaussian mixture densities, and an algorithm based on cross-validation for automatically determining hyper-parameters for the regression. The conditional densities are employed with a modified axis-aligned Gaussian mixture filter. The experimental validation shows the high quality of the conditional densities and good accuracy of the proposed filter.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133857276","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":"Human silhouette volume reconstruction using a gravity-based virtual camera network","authors":"H. Aliakbarpour, J. Dias","doi":"10.1109/ICIF.2010.5712109","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712109","url":null,"abstract":"The article represents a method to perform the Shape From Silhouette (SFS) of human, based on gravity sensing. A network of cameras is used to observe the scene. The extrinsic parameters among the cameras are initially unknown. An IMU is rigidly coupled to each camera in order to provide gravity and magnetic data. By applying a data fusion between each camera and its coupled IMU, it becomes possible to consider a downward-looking virtual camera for each camera within the network. Then extrinsic parameters among virtual cameras are estimated using the heights of two 3D points with respect to one camera within the network. Registered 2D points on the image plane of each camera is reprojected to its virtual camera image plane, using the concept of infinite homography. Such a virtual image plane is horizontal with a normal parallel to the gravity. The 2D points from the virtual image planes are back-projected onto the 3D space in order to make conic volumes of the observed object. From intersection of the created conic volumes from all cameras, the silhouette volume of the object is obtained. The experimental results validate both feasibility and effectiveness of the proposed method.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122504609","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":"Implementation of approximations of belief functions for fusion of ESM reports within the DSm framework","authors":"Pascal Djiknavorian, P. Valin, Dominic Grenier","doi":"10.1109/ICIF.2010.5712074","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712074","url":null,"abstract":"Electronic Support Measures consist of passive receivers which can identify emitters which, in turn, can be related to platforms that belong to 3 classes: Friend, Neutral, or Hostile. Decision makers prefer results presented in STANAG 1241 allegiance form, which adds 2 new classes: Assumed Friend, and Suspect. Dezert-Smarandache (DSm) theory is particularly suited to this problem, since it allows for intersections between the original 3 classes. However, as we know, the DSm hybrid combination rule is highly complex to execute and requires high amounts of resources. We have applied and studied a Matlab implementation of Tessem's k-l-x, Lowrance's Summarization and Simard's approximation techniques in the DSm theory for the fusion of ESM reports. Results are presented showing that we can improve on the time of execution while maintaining or getting better rates of good decisions in some cases.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665855","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 information fusion filter with intermittent observations","authors":"D. Kim, J. Yoon, Young Hoon Kim, V. Shin","doi":"10.1109/ICIF.2010.5711988","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711988","url":null,"abstract":"We present a robust distributed fusion algorithm with intermittent observations via an interacting multiple model (IMM) approach and sliding window strategy that can be applied to a large-scale sensor network. The communication channel is modelled as a jump Markov system and a posterior probability distribution for communication channel characteristics is calculated and incorporated into the filter to allow distributed Kalman filtering to automatically handle the intermittent observation situations. To implement distributed Kalman filtering, a Kalman-Consensus filter (KCF) is then used to obtain the average consensus based on the estimates of distributed sensors over a large-scale sensor network. From a target-tracking example for a large-scale sensor network with intermittent observations, the advantages of proposed algorithms are subsequently verified.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123945096","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":"Tracking with multisensor out-of-sequence measurements with residual biases","authors":"Shuo Zhang, Y. Bar-Shalom, G. Watson","doi":"10.1109/ICIF.2010.5711960","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5711960","url":null,"abstract":"In multisensor target tracking systems measurements from different sensors on the same target exhibit, typically, biases. These biases can be accounted for as fixed random variables by the Schmidt-Kalman filter. Furthermore, measurements from the same target can arrive out of sequence. This “out-of-sequence” measurement (OOSM) problem was recently solved and a procedure for updating the state with a multistep-lag measurement using the simpler “1-step-lag” algorithm was developed for the situation without measurement biases. The present work presents the solution to the combined problem of handling biases from multiple sensors when their measurements arrive out of sequence.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124045063","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}
D. Crouse, R. Osborne, K. Pattipati, P. Willett, Y. Bar-Shalom
{"title":"2D Location estimation of angle-only sensor arrays using targets of opportunity","authors":"D. Crouse, R. Osborne, K. Pattipati, P. Willett, Y. Bar-Shalom","doi":"10.1109/ICIF.2010.5712003","DOIUrl":"https://doi.org/10.1109/ICIF.2010.5712003","url":null,"abstract":"Passive acoustic sensor arrays for tracking ground targets are becoming increasingly popular due to their low cost and ease of deployment. In this paper we present an algorithm for locating sensor arrays in two-dimensions in an acoustic network (or in any network where angle-only measurements are used) when external references, such as GPS or known-location targets, are unavailable. We consider sensor localization when angular measurements are taken from the sensor arrays to targets of opportunity when all sensors take measurements with respect to a common axis of unknown orientation and where the sensors can not “see” each other. The solutions provided consist of low-complexity (generally closed-form) methods of getting initial estimates with no prior information, followed by maximum likelihood (ML) optimization to refine the estimates. Simulation shows that the accuracy approaches the Cramér Rao Lower Bound (CRLB), something that similar algorithms from previous research have been unable to achieve.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078129","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}