A Graph-Based Framework for Fusion: From Hypothesis Generation to Forensics

The intent of this paper is to show enhancements in level 2 and 3 fusion capabilities through a new class of graph models and solution strategies. The problem today is not often lack of information, but instead, information overload. Graphs have demonstrated to be a useful framework to represent and analyze large amounts of information. Classical strategies such as Bayesian networks, semantic networks and graph matching are some examples of the power of graphs. We will introduce two different but related graph-based structures that will allow us to span the temporal performance of decision-making processes. Given that most of the high level information fusion problems of interest are NP-Hard, there is a need to separate methodologies between "near real-time" tools and forensic heuristics. With this in mind we will introduce a real-time decision-making tool (INFERD) and a forensic graph matching algorithm (TruST)

[1]  Sherry Marcus,et al.  Graph-based technologies for intelligence analysis , 2004, CACM.

[2]  Adam Stotz,et al.  Situational awareness of a coordinated cyber attack , 2005, SPIE Defense + Commercial Sensing.

[3]  Michael Hinman,et al.  Building a Framework for Situation Awareness , 2004 .

[4]  Ronald R. Yager,et al.  Generalized OWA Aggregation Operators , 2004, Fuzzy Optim. Decis. Mak..

[5]  Edwin R. Hancock,et al.  Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Shu-Cherng Fang,et al.  A genetic-based framework for solving (multi-criteria) weighted matching problems , 2003, Eur. J. Oper. Res..

[7]  Ronald R. Yager,et al.  Hierarchical aggregation functions generated from belief structures , 2000, IEEE Trans. Fuzzy Syst..

[8]  Isabelle Bloch,et al.  Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems , 2001, EMMCVPR.

[9]  Pascal Vasseur,et al.  Introduction to Multisensor Data Fusion , 2005, The Industrial Information Technology Handbook.

[10]  Roberto Marcondes Cesar Junior,et al.  Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms , 2005, Pattern Recognit..

[11]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Santanu Chaudhury,et al.  Matching structural shape descriptions using genetic algorithms , 1997, Pattern Recognit..

[13]  Isabelle Bloch,et al.  Inexact graph matching by means of estimation of distribution algorithms , 2002, Pattern Recognit..

[14]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[16]  Xin Yao,et al.  Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems , 2006, Comput. Oper. Res..

[17]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[18]  Laurence Tianruo Yang,et al.  Fuzzy Logic with Engineering Applications , 1999 .

[19]  FoggiaPasquale,et al.  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs , 2004 .

[20]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decision-making , 1988 .

[21]  C. Tsallis.  Nonextensive statistics: theoretical, experimental and computational evidences and connections , 1999, cond-mat/9903356.

[22]  Shengrui Wang,et al.  A new algorithm for inexact graph matching , 2002, Object recognition supported by user interaction for service robots.

[23]  Rakesh Nagi,et al.  Data mining in an engineering design environment: OR applications from graph matching , 2006, Comput. Oper. Res..

[24]  C. Tsallis.  Entropic nonextensivity: a possible measure of complexity , 2000, cond-mat/0010150.

[25]  Edwin R. Hancock,et al.  Symbolic graph matching with the EM algorithm , 1998, Pattern Recognit..

[26]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Rakesh Nagi,et al.  On comparing bills of materials: a similarity/distance measure for unordered trees , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[28]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..