Fast Temporal Path Localization on Graphs via Multiscale Viterbi Decoding.

IEEE Transactions on Signal Processing(2018)

引用 3|浏览59
暂无评分
摘要
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, w...
更多
查看译文
关键词
Trajectory,Heuristic algorithms,Signal processing algorithms,Maximum likelihood decoding,Partitioning algorithms,Measurement,Hamming distance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要