کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
528314 869554 2010 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Enhancements to high level data fusion using graph matching and state space search
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Fusion - Volume 11, Issue 4, October 2010, Pages 351–364
نویسندگان
, , , ,