Pith. sign in

REVIEW

A Graph-based U-Net Model for Predicting Traffic in unseen Cities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.06725 v4 pith:A637BH4Y submitted 2022-02-11 cs.LG cs.AI

classification cs.LGcs.AI
keywords trafficu-netgraphheatmapsoperationsroadspeedunseen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Accurate traffic prediction is a key ingredient to enable traffic management like rerouting cars to reduce road congestion or regulating traffic via dynamic speed limits to maintain a steady flow. A way to represent traffic data is in the form of temporally changing heatmaps visualizing attributes of traffic, such as speed and volume. In recent works, U-Net models have shown SOTA performance on traffic forecasting from heatmaps. We propose to combine the U-Net architecture with graph layers which improves spatial generalization to unseen road networks compared to a Vanilla U-Net. In particular, we specialize existing graph operations to be sensitive to geographical topology and generalize pooling and upsampling operations to be applicable to graphs.

Discussion (0). Continue with ORCID to comment.

Pith tools