Enhancements to high level data fusion using graph matching and state space search

The intent of this paper is to show enhancements in Levels 2 and 3 fusion capabilities through a new class of models and algorithms in graph matching. The problem today is not often lack of data, but instead, lack of information and data overload. Graph matching algorithms help us solve this problem by identifying meaningful patterns in voluminous amounts of data to provide information. In this paper we investigate a classical graph matching technique for subgraph isomorphism. A complete implementation of a heuristic approach (since the problem under consideration is NP-Hard) using an inexact isomorphism technique has been used. The heuristic approach is called Truncated Search Tree algorithm (TruST), where the state space of the problem is constrained using breadth and depth control parameters. The breadth and depth control parameters are then studied using design of experiment based inferential statistics. Finally, a software implementation of the procedure has been completed.

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

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

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

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

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

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

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

[8]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[9]  Alan L. Yuille,et al.  Convergence Properties of the Softassign Quadratic Assignment Algorithm , 1999, Neural Computation.

[10]  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.

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

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

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

[14]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

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

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

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

[18]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[21]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.