Near-Lossless Compression for Large Traffic Networks
Asif, Muhammad Tayyab
Date of Issue2014
School of Electrical and Electronic Engineering
With advancements in sensor technologies, intelligent transportation systems (ITS) can collect traffic data with high spatial and temporal resolution. However, the size of the networks combined with the huge volume of the data puts serious constraints on the system resources. Low-dimensional models can help ease these constraints by providing compressed representations for the networks. In this study, we analyze the reconstruction efficiency of several low-dimensional models for large and diverse networks. The compression performed by low-dimensional models is lossy in nature. To address this issue, we propose a near-lossless compression method for traffic data by applying the principle of lossy plus residual coding. To this end, we first develop low-dimensional model of the network. We then apply Huffman coding in the residual layer. The resultant algorithm guarantees that the maximum reconstruction error will remain below a desired tolerance limit. For analysis, we consider a large and heterogeneous test network comprising of more than 18000 road segments. The results show that the proposed method can efficiently compress data obtained from a large and diverse road network, while maintaining the upper bound on the reconstruction error.
IEEE Transactions on Intelligent Transportation Systems
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TITS.2014.2374335].