Fast temporal path localization on graphs via multiscale viterbi decoding

Yaoqing Yang, Siheng Chen, Mohammad Ali Maddah-Ali, Pulkit Grover, Soummya Kar, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

We consider a problem of localizing a temporal path signal that evolves over time on a graph. A path signal represents the trajectory of a moving agent on a graph in a series of consecutive time stamps. Through combining dynamic programing and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. To analyze the localization performance, we use two evaluation metrics to quantify the localization error: The Hamming distance and the destination's distance between the ground-truth path and the estimated path. In random geometric graphs, we provide a closed-form expression for the localization error bound, and a tradeoff between localization error and the computational complexity. Finally, we compare the proposed technique with the maximum likelihood estimate in terms of computational complexity and localization error, and show significant speedup (100×) with comparable localization error (4×) on a graph from real data.

Original languageEnglish (US)
Article number8458140
Pages (from-to)5588-5603
Number of pages16
JournalIEEE Transactions on Signal Processing
Volume66
Issue number21
DOIs
StatePublished - Nov 1 2018

Fingerprint

Decoding
Computational complexity
Hamming distance
Maximum likelihood
Trajectories

Keywords

  • graph partitioning
  • Graph signal processing
  • Viterbi decoding

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Fast temporal path localization on graphs via multiscale viterbi decoding. / Yang, Yaoqing; Chen, Siheng; Maddah-Ali, Mohammad Ali; Grover, Pulkit; Kar, Soummya; Kovacevic, Jelena.

In: IEEE Transactions on Signal Processing, Vol. 66, No. 21, 8458140, 01.11.2018, p. 5588-5603.

Research output: Contribution to journalArticle

Yang, Yaoqing ; Chen, Siheng ; Maddah-Ali, Mohammad Ali ; Grover, Pulkit ; Kar, Soummya ; Kovacevic, Jelena. / Fast temporal path localization on graphs via multiscale viterbi decoding. In: IEEE Transactions on Signal Processing. 2018 ; Vol. 66, No. 21. pp. 5588-5603.
@article{fcf3f0c81b3345da8dfa15984a28d0cd,
title = "Fast temporal path localization on graphs via multiscale viterbi decoding",
abstract = "We consider a problem of localizing a temporal path signal that evolves over time on a graph. A path signal represents the trajectory of a moving agent on a graph in a series of consecutive time stamps. Through combining dynamic programing and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. To analyze the localization performance, we use two evaluation metrics to quantify the localization error: The Hamming distance and the destination's distance between the ground-truth path and the estimated path. In random geometric graphs, we provide a closed-form expression for the localization error bound, and a tradeoff between localization error and the computational complexity. Finally, we compare the proposed technique with the maximum likelihood estimate in terms of computational complexity and localization error, and show significant speedup (100×) with comparable localization error (4×) on a graph from real data.",
keywords = "graph partitioning, Graph signal processing, Viterbi decoding",
author = "Yaoqing Yang and Siheng Chen and Maddah-Ali, {Mohammad Ali} and Pulkit Grover and Soummya Kar and Jelena Kovacevic",
year = "2018",
month = "11",
day = "1",
doi = "10.1109/TSP.2018.2869119",
language = "English (US)",
volume = "66",
pages = "5588--5603",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "21",

}

TY - JOUR

T1 - Fast temporal path localization on graphs via multiscale viterbi decoding

AU - Yang, Yaoqing

AU - Chen, Siheng

AU - Maddah-Ali, Mohammad Ali

AU - Grover, Pulkit

AU - Kar, Soummya

AU - Kovacevic, Jelena

PY - 2018/11/1

Y1 - 2018/11/1

N2 - We consider a problem of localizing a temporal path signal that evolves over time on a graph. A path signal represents the trajectory of a moving agent on a graph in a series of consecutive time stamps. Through combining dynamic programing and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. To analyze the localization performance, we use two evaluation metrics to quantify the localization error: The Hamming distance and the destination's distance between the ground-truth path and the estimated path. In random geometric graphs, we provide a closed-form expression for the localization error bound, and a tradeoff between localization error and the computational complexity. Finally, we compare the proposed technique with the maximum likelihood estimate in terms of computational complexity and localization error, and show significant speedup (100×) with comparable localization error (4×) on a graph from real data.

AB - We consider a problem of localizing a temporal path signal that evolves over time on a graph. A path signal represents the trajectory of a moving agent on a graph in a series of consecutive time stamps. Through combining dynamic programing and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. To analyze the localization performance, we use two evaluation metrics to quantify the localization error: The Hamming distance and the destination's distance between the ground-truth path and the estimated path. In random geometric graphs, we provide a closed-form expression for the localization error bound, and a tradeoff between localization error and the computational complexity. Finally, we compare the proposed technique with the maximum likelihood estimate in terms of computational complexity and localization error, and show significant speedup (100×) with comparable localization error (4×) on a graph from real data.

KW - graph partitioning

KW - Graph signal processing

KW - Viterbi decoding

UR - http://www.scopus.com/inward/record.url?scp=85053153125&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053153125&partnerID=8YFLogxK

U2 - 10.1109/TSP.2018.2869119

DO - 10.1109/TSP.2018.2869119

M3 - Article

VL - 66

SP - 5588

EP - 5603

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 21

M1 - 8458140

ER -