Weak matching of temporal interval graphs of sensors for robust multimodal event detection in noise

Lakshman Prasad; Boian S. Alexandrov; Benjamin T. Nebgen

doi:10.1117/12.2558683

15 May 2020 Weak matching of temporal interval graphs of sensors for robust multimodal event detection in noise

Lakshman Prasad, Boian S. Alexandrov, Benjamin T. Nebgen

Proceedings Volume 11423, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIX; 114230N (2020) https://doi.org/10.1117/12.2558683
Event: SPIE Defense + Commercial Sensing, 2020, Online Only

Abstract

We present a weak matching algorithm for interval graphs, to detect recurrent patterns in multimodal temporal data, with feature time series extracted by nonnegative tensor factorization (NTF). NTF enables latent feature extraction as well as uniform representation of multimodal observables. This work builds on our previous work introducing an interval graph representation framework for multi-sensor data. Salient data regions and their relationships are represented by temporal interval graphs, where observables are captured as time intervals (nodes), and temporally proximate nodes are related by edges. Comparing events is then posed as a subgraph matching problem. However, subgraph matching is notoriously difficult (NP-complete) with polynomial algorithms for only very restricted families of graphs. Even in these cases, perturbations to graph structure from missing or extra nodes and edges can lead to brittle matching results. Indeed, realworld sensing involves noisy environments where extraneous or missing observables interfere with event interval graph structures. To cope with these challenges, we propose a proxy representation of interval graphs via their shortest and longest paths and compare graphs by matching their path sets. We describe an attributed path matching scheme that is robust to inclusions and exclusions of nodes by adapting the longest common subsequence algorithm using dynamic programming for attributed path matching. We demonstrate the efficacy of interval graph analysis of tensor features on real-world multimodal sensor data where we investigate the detectability, similarity, and distinguishability of three sets of known events based on ground truth. We illustrate our results with match matrices and ROC curves.

Citation Download Citation

Lakshman Prasad, Boian S. Alexandrov, and Benjamin T. Nebgen "Weak matching of temporal interval graphs of sensors for robust multimodal event detection in noise", Proc. SPIE 11423, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIX, 114230N (15 May 2020); https://doi.org/10.1117/12.2558683

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Sensors

Matrices

Process modeling

Computer programming

Analytical research

Feature extraction

Signal processing

Keywords/Phrases

Search In:

Publication Years