4.7 Article

Spatio-Temporal Constraint-Based Low Rank Matrix Completion Approaches for Road Traffic Networks

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2021.3124613

关键词

Roads; Matrix decomposition; Optimization; Probes; Sensors; Iterative methods; Correlation; Sparsity regularized matrix factorization; temporal and adaptive spatial constrained low rank; low rank matrix completion approaches; traffic sensing

向作者/读者索取更多资源

The paper discusses the importance of road traffic sensing in Intelligent Transportation Systems (ITS) and the use of Low Rank Matrix Completion (LR-MC) approaches for accurate matrix reconstruction. Two new LR-MC approaches, AL-SRMF and C-LR, are developed and experimentally validated for traffic matrices of Californian road network. The results show that these new methods outperform existing approaches with significantly better performance.
Road traffic sensing is pivotal in all the imperative services offered by Intelligent Transportation Systems (ITS). Both static and probe based traffic sensing technologies aid in the acquisition of road traffic parameters, represented as spatio-temporal traffic data matrices. These matrices suffer from inevitable data losses, urging accurate matrix reconstruction. Many Low Rank Matrix Completion (LR-MC) approaches have been formulated in the literature, with varied optimization problems and solution methods. The subsequent approaches have exploited spatio-temporal constraints to further reduce the reconstruction error. In this paper, these formulations are modified to develop two new LR-MC approaches, the Augmented Lagrangian Sparsity Regularized Matrix Factorization (AL-SRMF) and the Constrained Low Rank (C-LR). AL-SRMF replaces the Alternating Least Squares (ALS) solution method of SRMF with an AL based method. Optimization in C-LR inherits its temporal constraint from the Temporal and Adaptive Spatial constrained Low Rank (TAS-LR) approach, while adopting its spatial constraint similar to SRMF. Spatial constraint in both C-LR and AL-SRMF is deduced by computing an adjacency matrix that leverages graph notion of the geographical road traffic network. For experimental validations of the proposed approaches, traffic matrices of Californian road network are obtained from PEMS database. Investigations reveal that for a signal integrity (SI) of 0.5, C-LR demonstrated a Normalized Mean Absolute Error (NMAE) of 3.4% and a Root Mean Square Error (RMSE) of 3.2. With a slight increase in computational time, the AL-SRMF rendered least values of NMAE and RMSE, 2.4% and 2.3 respectively, demonstrating significantly better performance than the state-of-the-art approaches.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据