Pub Date : 2006-07-10DOI: 10.1109/ICIF.2006.301805
Li Bai, S. Biswas, A. Ortiz, D. Dalessandro
This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (klesn) can be used to reconstruct the secret image in lossless manner and ii) any (k-1) or fewer image shares cannot get sufficient information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for realtime processing
{"title":"An Image Secret Sharing Method","authors":"Li Bai, S. Biswas, A. Ortiz, D. Dalessandro","doi":"10.1109/ICIF.2006.301805","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301805","url":null,"abstract":"This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (klesn) can be used to reconstruct the secret image in lossless manner and ii) any (k-1) or fewer image shares cannot get sufficient information to reveal the secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with other image secret sharing methods, this approach's advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for realtime processing","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"97 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":"117199110","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301623
F. Dambreville
In this paper, we are interested in the optimal dynamical control of sensors based on partial and noisy observations. These problems are related to the POMDP family. In this case however, we are manipulating continuous-valued controls and continuous-valued decisions. While the dynamical programming method will rely on a discretization of the problem, we are dealing here directly with the continuous data. Moreover, our purpose is to address the full past observation range. Our approach is to modelize the POMDP strategies by means of dynamic Bayesian networks. A method, based on the cross-entropy is implemented for optimizing the parameters of such DBN, relatively to the POMDP problem. In this particular work, the dynamic Bayesian networks are built from semi-continuous probabilistic laws, so as to ensure the manipulation of continuous data
{"title":"Continuous Learning Method for a Continuous Dynamical Control in a Partially Observable Universe","authors":"F. Dambreville","doi":"10.1109/ICIF.2006.301623","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301623","url":null,"abstract":"In this paper, we are interested in the optimal dynamical control of sensors based on partial and noisy observations. These problems are related to the POMDP family. In this case however, we are manipulating continuous-valued controls and continuous-valued decisions. While the dynamical programming method will rely on a discretization of the problem, we are dealing here directly with the continuous data. Moreover, our purpose is to address the full past observation range. Our approach is to modelize the POMDP strategies by means of dynamic Bayesian networks. A method, based on the cross-entropy is implemented for optimizing the parameters of such DBN, relatively to the POMDP problem. In this particular work, the dynamic Bayesian networks are built from semi-continuous probabilistic laws, so as to ensure the manipulation of continuous data","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"41 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120999558","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301576
C. Rago, Charlie Gershfield, T. Strat
This paper describes the multiple hypothesis network tracker (MHNT) being developed by BAE Systems. The goal here was to design, develop and implement a tracker capable of tracking multiple vehicles moving across a network of geographically distributed static sensors, where each sensor's coverage area is small compared to the distance between sensors. Each sensor reports the time when a target crosses the sensor's coverage area sensors may also report features associated with the target. A centralized tracker receives reports from all of the sensors and, using prior information regarding target motion across the network of sensors and actual travel times, assign reports to tracks and computes the most likely set of assignments
{"title":"A Multiple Hypothesis Tracker for a Distributed Network of Sensors","authors":"C. Rago, Charlie Gershfield, T. Strat","doi":"10.1109/ICIF.2006.301576","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301576","url":null,"abstract":"This paper describes the multiple hypothesis network tracker (MHNT) being developed by BAE Systems. The goal here was to design, develop and implement a tracker capable of tracking multiple vehicles moving across a network of geographically distributed static sensors, where each sensor's coverage area is small compared to the distance between sensors. Each sensor reports the time when a target crosses the sensor's coverage area sensors may also report features associated with the target. A centralized tracker receives reports from all of the sensors and, using prior information regarding target motion across the network of sensors and actual travel times, assign reports to tracks and computes the most likely set of assignments","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"42 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":"121048805","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301751
S. Giannecchini, Francesco Spina, B. Nordgren, M. Desruisseaux
Geospatial data fusion refers to the ability to process (fuse) data from a variety of sources which capture and/or model earth-related phenomena in order to produce added-value information. This paper provides an overview of the latest advancements in standardization for interoperability in the geographical information community achieved by the International Organization for Standardization (ISO) and the Open Geospatial Consortium (OGC). It also provides guidelines and suggestions for designing superior architectures to support geospatial data fusion by employing OGC/ISO specifications
{"title":"Supporting Interoperable Geospatial Data Fusion by adopting OGC and ISO TC 211 standards","authors":"S. Giannecchini, Francesco Spina, B. Nordgren, M. Desruisseaux","doi":"10.1109/ICIF.2006.301751","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301751","url":null,"abstract":"Geospatial data fusion refers to the ability to process (fuse) data from a variety of sources which capture and/or model earth-related phenomena in order to produce added-value information. This paper provides an overview of the latest advancements in standardization for interoperability in the geographical information community achieved by the International Organization for Standardization (ISO) and the Open Geospatial Consortium (OGC). It also provides guidelines and suggestions for designing superior architectures to support geospatial data fusion by employing OGC/ISO specifications","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"125 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":"127184602","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301811
G. Ng, C. H. Tan, T. P. Ng, S. Y. Siow
With growing emphasis on research and applications in data fusion, it is important to know how to measure fusion system performance. While much of the current research is involved with evaluating fusion systems based on the quality of their outputs, this paper describes the expansion of this scope to include the complexity of the inputs. Since the quality of the outputs is highly dependent on the difficulty of the input scenario, the methodology described in this paper provides us with a more well-rounded interpretation of fusion system performance. Moreover, characterization and quantification of input scenarios allows for the creation and variation of test scenarios, leading to more efficient optimization of fusion systems. A series of complexity and performance metrics were designed according to a common standard to measure the various aspects of the input scenario and the fusion system solution. Finally, these metrics are combined to obtain an assessment index which provides a description of the fusion system performance
{"title":"Assessment Of Data Fusion Systems","authors":"G. Ng, C. H. Tan, T. P. Ng, S. Y. Siow","doi":"10.1109/ICIF.2006.301811","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301811","url":null,"abstract":"With growing emphasis on research and applications in data fusion, it is important to know how to measure fusion system performance. While much of the current research is involved with evaluating fusion systems based on the quality of their outputs, this paper describes the expansion of this scope to include the complexity of the inputs. Since the quality of the outputs is highly dependent on the difficulty of the input scenario, the methodology described in this paper provides us with a more well-rounded interpretation of fusion system performance. Moreover, characterization and quantification of input scenarios allows for the creation and variation of test scenarios, leading to more efficient optimization of fusion systems. A series of complexity and performance metrics were designed according to a common standard to measure the various aspects of the input scenario and the fusion system solution. Finally, these metrics are combined to obtain an assessment index which provides a description of the fusion system performance","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"31 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":"125000718","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301662
R. Nagi, M. Sudit, J. Llinas
Asymmetric/urban warfare, improvised explosive devices (IEDs), and dirty bombs are dominating over conventional warfare, and there is an urgent need to deal with them systematically. Effective strategies of thwarting terrorism continue to be the top priority for international communities. This paper presents a research approach for situation awareness and threat/impact assessment strategies for a genre of UW problems. The approach is based on a formal domain ontology and a scenario authoring and simulation environment. A class of hybrid deductive (model-based) and inductive reasoning approaches are applied to the scenario simulation and performance evaluation studies are conducted. Such an approach can be used for training purposes as well as fusion technology development. An example will be presented
{"title":"An Approach for Level 2/3 Fusion Technology Development in Urban/Asymmetric Scenarios","authors":"R. Nagi, M. Sudit, J. Llinas","doi":"10.1109/ICIF.2006.301662","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301662","url":null,"abstract":"Asymmetric/urban warfare, improvised explosive devices (IEDs), and dirty bombs are dominating over conventional warfare, and there is an urgent need to deal with them systematically. Effective strategies of thwarting terrorism continue to be the top priority for international communities. This paper presents a research approach for situation awareness and threat/impact assessment strategies for a genre of UW problems. The approach is based on a formal domain ontology and a scenario authoring and simulation environment. A class of hybrid deductive (model-based) and inductive reasoning approaches are applied to the scenario simulation and performance evaluation studies are conducted. Such an approach can be used for training purposes as well as fusion technology development. An example will be presented","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"10 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":"125943840","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301755
S. Julier
This paper considers the problem of developing algorithms for the distributed fusion of Gaussian mixture models through the use of Chernoff information. We derive a first order approximation and show that, in a distributed tracking problem in which sensor nodes are equipped with only range-only or bearing-only sensors, it yields consistent estimates
{"title":"An Empirical Study into the Use of Chernoff Information for Robust, Distributed Fusion of Gaussian Mixture Models","authors":"S. Julier","doi":"10.1109/ICIF.2006.301755","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301755","url":null,"abstract":"This paper considers the problem of developing algorithms for the distributed fusion of Gaussian mixture models through the use of Chernoff information. We derive a first order approximation and show that, in a distributed tracking problem in which sensor nodes are equipped with only range-only or bearing-only sensors, it yields consistent estimates","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"53 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":"122963431","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301703
Jon P. Champion, J. Vasquez
Dismounted targets can be tracked in urban environments with video sensors. Real-time systems are unable to process all of the imagery, demanding some method for prioritization of the processing resources. Furthermore, various segmentation algorithms exist within image processing, each algorithm possesses unique capabilities, and each algorithm has an associated computational cost. Additional complexity arises in the prioritization problem when targets become occluded (i.e., a building) and when the targets are intermixed with other dismounted entities. This added complexity leads to the question "which portions of the scene warrant both low cost and high cost processing?" The approach presented in this paper is to apply multi-target tracking techniques in conjunction with an integer programming optimization routine to determine optimal allocation of the video processing resources. This architecture results in feedback from the tracking routine to the image processing function which in turn enhances the ability of the tracker
{"title":"Comparison of Image Processing Resource Allocation for Multi-Target Tracking of Dismounted Targets","authors":"Jon P. Champion, J. Vasquez","doi":"10.1109/ICIF.2006.301703","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301703","url":null,"abstract":"Dismounted targets can be tracked in urban environments with video sensors. Real-time systems are unable to process all of the imagery, demanding some method for prioritization of the processing resources. Furthermore, various segmentation algorithms exist within image processing, each algorithm possesses unique capabilities, and each algorithm has an associated computational cost. Additional complexity arises in the prioritization problem when targets become occluded (i.e., a building) and when the targets are intermixed with other dismounted entities. This added complexity leads to the question \"which portions of the scene warrant both low cost and high cost processing?\" The approach presented in this paper is to apply multi-target tracking techniques in conjunction with an integer programming optimization routine to determine optimal allocation of the video processing resources. This architecture results in feedback from the tracking routine to the image processing function which in turn enhances the ability of the tracker","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"52 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":"122107407","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301682
Vesa Klumpp, D. Brunn, U. Hanebeck
Recursive calculation of the probability density function characterizing the state estimate of a nonlinear stochastic dynamic system in general cannot be performed exactly, since the type of the density changes with every processing step and the complexity increases. Hence, an approximation of the true density is required. Instead of using a single complicated approximating density, this paper is concerned with bounding the true density from below and from above by means of two simple densities. This provides a kind of guaranteed estimator with respect to the underlying true density, which requires a mechanism for ordering densities. Here, a partial ordering with respect to the cumulative distributions is employed. Based on this partial ordering, a modified Bayesian filter step is proposed, which recursively propagates lower and upper density bounds. A specific implementation for piecewise linear densities with finite support is used for demonstrating the performance of the new approach in simulations
{"title":"Approximate Nonlinear Bayesian Estimation Based on Lower and Upper Densities","authors":"Vesa Klumpp, D. Brunn, U. Hanebeck","doi":"10.1109/ICIF.2006.301682","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301682","url":null,"abstract":"Recursive calculation of the probability density function characterizing the state estimate of a nonlinear stochastic dynamic system in general cannot be performed exactly, since the type of the density changes with every processing step and the complexity increases. Hence, an approximation of the true density is required. Instead of using a single complicated approximating density, this paper is concerned with bounding the true density from below and from above by means of two simple densities. This provides a kind of guaranteed estimator with respect to the underlying true density, which requires a mechanism for ordering densities. Here, a partial ordering with respect to the cumulative distributions is employed. Based on this partial ordering, a modified Bayesian filter step is proposed, which recursively propagates lower and upper density bounds. A specific implementation for piecewise linear densities with finite support is used for demonstrating the performance of the new approach in simulations","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"45 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":"129609006","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 : 2006-07-10DOI: 10.1109/ICIF.2006.301631
C. Osswald, Arnaud Martin
Distances between fusion operators are measured using a class of random belief functions. With similarity analysis, the structure of this family is extracted, for two and three information sources. The conjunctive operator, quick and associative but very isolated on a large discernment space, and the arithmetic mean are identified as outliers, while the hybrid method and six proportional conflict-redistributing rules (PCR) form a continuum. The hybrid method is showed as being central for the family of fusion methods. All the fusion operators tested with random belief functions are validated on the fusion of radar data classifiers, and show the interest of some new PCR methods
{"title":"Understanding the large family of Dempster-Shafer theory's fusion operators - a decision-based measure","authors":"C. Osswald, Arnaud Martin","doi":"10.1109/ICIF.2006.301631","DOIUrl":"https://doi.org/10.1109/ICIF.2006.301631","url":null,"abstract":"Distances between fusion operators are measured using a class of random belief functions. With similarity analysis, the structure of this family is extracted, for two and three information sources. The conjunctive operator, quick and associative but very isolated on a large discernment space, and the arithmetic mean are identified as outliers, while the hybrid method and six proportional conflict-redistributing rules (PCR) form a continuum. The hybrid method is showed as being central for the family of fusion methods. All the fusion operators tested with random belief functions are validated on the fusion of radar data classifiers, and show the interest of some new PCR methods","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"17 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":"128329879","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
扫码关注我们
求助内容：
应助结果提醒方式：