Paper detail

Compressive Origin-Destination Matrix Estimation

The paper presents an approach to estimate Origin-Destination (OD) flows and their path splits, based on traffic counts on links in the network. The approach called Compressive Origin-Destination Estimation (CODE) is inspired by Compressive Sensing (CS) techniques. Even though the estimation problem is underdetermined, CODE recovers the unknown variables exactly when the number of alternative paths for each OD pair is small. Noiseless, noisy, and weighted versions of CODE are illustrated for synthetic networks, and with real data for a small region in East Providence. CODE's versatility is suggested by its use to estimate the number of vehicles and the Vehicle-Miles Traveled (VMT) using link counts.

preprint2014arXivOpen access

Signal facts

What is known right now

Open access2 authors2 topics

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.