Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. CUR decomposition for compression and compressed sensing of large-scale traffic data

CUR decomposition for compression and compressed sensing of large-scale traffic data

Thumbnail Image
Download
Name

Jaillet_CUR decomposition.pdf

Size

1.01 MB

Format

Adobe PDF

Checksum (MD5)

9a6fdbdb229d603c327a56a101e018ec

Author(s)
Mitrovic, Nikola
•
Asif, Muhammad Tayyab
•
Rasheed, Umer
•
Dauwels, Justin H. G.
•
Jaillet, Patrick
Date Issued
October 2013
Journal
16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Mitrovic, Nikola, Muhammad Tayyab Asif, Umer Rasheed, Justin Dauwels, and Patrick Jaillet. “CUR Decomposition for Compression and Compressed Sensing of Large-Scale Traffic Data.” 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013) The Hague, The Netherlands, October 6-9, 2013. p.1475-1480.
Version
Author's final manuscript
Abstract
Intelligent Transportation Systems (ITS) often operate on large road networks, and typically collect traffic data with high temporal resolution. Consequently, ITS need to handle massive volumes of data, and methods to represent that data in more compact representations are sorely needed. Subspace methods such as Principal Component Analysis (PCA) can create accurate low-dimensional models. However, such models are not readily interpretable, as the principal components usually involve a large number of links in the traffic network. In contrast, the CUR matrix decomposition leads to low-dimensional models where the components correspond to individual links in the network; the resulting models can be easily interpreted, and can also be used for compressed sensing of the traffic network. In this paper, the CUR matrix decomposition is applied for two purposes: (1) compression of traffic data; (2) compressed sensing of traffic data. In the former, only data from a “random” subset of links and time instances is stored. In the latter, data for the entire traffic network is inferred from measurements at a “random” subset of links. Numerical results for a large traffic network in Singapore demonstrate the feasibility of the proposed approach.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/86879
DOI of Published Version
https://doi.org/10.1109/ITSC.2013.6728438
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.