By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Moises Sudit ; Center for Multisource Information Fusion, University at Buffalo, Buffalo, NY, U.S.A. ; Rakesh Nagi ; Adam Stotz ; Kedar Sambhoos

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)

Published in:

2006 9th International Conference on Information Fusion

Date of Conference:

10-13 July 2006