Fast path localization on graphs via multiscale Viterbi decoding

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a problem of localizing the destination of an activated path signal supported on a graph. An "activated path signal" is a graph signal that evolves over time that can be viewed as the trajectory of a moving agent. We show that by combining dynamic programming and graph partitioning, the computational complexity of destination localization can be significantly reduced. Then, we show that the destination localization error can be upper-bounded using methods based on large-deviation. Using simulation results, we show a tradeoff between the destination localization error and the computation time. We compare the dynamic programming algorithm with and without graph partitioning and show that the computation time can be significantly reduced by using graph partitioning. The proposed technique can scale to the problem of destination localization on a large graph with one million nodes and one thousand time slots.

Original languageEnglish (US)
Title of host publication2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4114-4118
Number of pages5
ISBN (Electronic)9781509041176
DOIs
StatePublished - Jun 16 2017
Event2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - New Orleans, United States
Duration: Mar 5 2017Mar 9 2017

Other

Other2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017
CountryUnited States
CityNew Orleans
Period3/5/173/9/17

Fingerprint

Dynamic programming
Decoding
Computational complexity
Trajectories

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Yang, Y., Chen, S., Ali Maddah-Ali, M., Grover, P., Kar, S., & Kovacevic, J. (2017). Fast path localization on graphs via multiscale Viterbi decoding. In 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings (pp. 4114-4118). [7952930] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.2017.7952930

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

2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. p. 4114-4118 7952930.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, Y, Chen, S, Ali Maddah-Ali, M, Grover, P, Kar, S & Kovacevic, J 2017, Fast path localization on graphs via multiscale Viterbi decoding. in 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings., 7952930, Institute of Electrical and Electronics Engineers Inc., pp. 4114-4118, 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017, New Orleans, United States, 3/5/17. https://doi.org/10.1109/ICASSP.2017.7952930
Yang Y, Chen S, Ali Maddah-Ali M, Grover P, Kar S, Kovacevic J. Fast path localization on graphs via multiscale Viterbi decoding. In 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. p. 4114-4118. 7952930 https://doi.org/10.1109/ICASSP.2017.7952930
Yang, Yaoqing ; Chen, Siheng ; Ali Maddah-Ali, Mohammad ; Grover, Pulkit ; Kar, Soummya ; Kovacevic, Jelena. / Fast path localization on graphs via multiscale Viterbi decoding. 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 4114-4118
@inproceedings{03fab1f9fa3a4d3cb691582b84e780d0,
title = "Fast path localization on graphs via multiscale Viterbi decoding",
abstract = "We consider a problem of localizing the destination of an activated path signal supported on a graph. An {"}activated path signal{"} is a graph signal that evolves over time that can be viewed as the trajectory of a moving agent. We show that by combining dynamic programming and graph partitioning, the computational complexity of destination localization can be significantly reduced. Then, we show that the destination localization error can be upper-bounded using methods based on large-deviation. Using simulation results, we show a tradeoff between the destination localization error and the computation time. We compare the dynamic programming algorithm with and without graph partitioning and show that the computation time can be significantly reduced by using graph partitioning. The proposed technique can scale to the problem of destination localization on a large graph with one million nodes and one thousand time slots.",
author = "Yaoqing Yang and Siheng Chen and {Ali Maddah-Ali}, Mohammad and Pulkit Grover and Soummya Kar and Jelena Kovacevic",
year = "2017",
month = "6",
day = "16",
doi = "10.1109/ICASSP.2017.7952930",
language = "English (US)",
pages = "4114--4118",
booktitle = "2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Fast path localization on graphs via multiscale Viterbi decoding

AU - Yang, Yaoqing

AU - Chen, Siheng

AU - Ali Maddah-Ali, Mohammad

AU - Grover, Pulkit

AU - Kar, Soummya

AU - Kovacevic, Jelena

PY - 2017/6/16

Y1 - 2017/6/16

N2 - We consider a problem of localizing the destination of an activated path signal supported on a graph. An "activated path signal" is a graph signal that evolves over time that can be viewed as the trajectory of a moving agent. We show that by combining dynamic programming and graph partitioning, the computational complexity of destination localization can be significantly reduced. Then, we show that the destination localization error can be upper-bounded using methods based on large-deviation. Using simulation results, we show a tradeoff between the destination localization error and the computation time. We compare the dynamic programming algorithm with and without graph partitioning and show that the computation time can be significantly reduced by using graph partitioning. The proposed technique can scale to the problem of destination localization on a large graph with one million nodes and one thousand time slots.

AB - We consider a problem of localizing the destination of an activated path signal supported on a graph. An "activated path signal" is a graph signal that evolves over time that can be viewed as the trajectory of a moving agent. We show that by combining dynamic programming and graph partitioning, the computational complexity of destination localization can be significantly reduced. Then, we show that the destination localization error can be upper-bounded using methods based on large-deviation. Using simulation results, we show a tradeoff between the destination localization error and the computation time. We compare the dynamic programming algorithm with and without graph partitioning and show that the computation time can be significantly reduced by using graph partitioning. The proposed technique can scale to the problem of destination localization on a large graph with one million nodes and one thousand time slots.

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

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

U2 - 10.1109/ICASSP.2017.7952930

DO - 10.1109/ICASSP.2017.7952930

M3 - Conference contribution

AN - SCOPUS:85023769936

SP - 4114

EP - 4118

BT - 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -