MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Vehicle Tracking Using the k-shortest Paths Algorithm and Dual Graphs

Author(s)
Azevedo, Carlos Lima; Cardoso, João Lourenço; Ben-Akiva, Moshe E
Thumbnail
Download1-s2.0-S2352146514000039-main.pdf (1.257Mb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/3.0/
Metadata
Show full item record
Abstract
Vehicle trajectory descriptions are required for the development of driving behavior models and in the calibration of several traffic simulation applications. In recent years, the progress in aerial sensing technologies and image processing algorithms allowed for easier collection of such detailed traffic datasets and multiple-object tracking based on constrained flow optimization has been shown to produce very satisfactory results, even in high density traffic situations. This method uses individual image features collected for each candidate vehicle as criteria in the optimization process. When dealing with poor image quality or low ground sampling distances, feature-based optimization may produce unreal trajectories. In this paper we extend the application of the k-shortest paths algorithm for multiple-object tracking to the motion-based optimization. A graph of possible connections between successive candidate positions was built using a first level criteria based on speeds. Dual graphs were built to account for acceleration-based and acceleration variation-based criteria. With this framework both longitudinal and lateral motion-based criteria are contemplated in the optimization process. The k-shortest disjoints paths algorithm was then used to determine the optimal set of trajectories (paths) on the constructed graph. The proposed algorithm was successfully applied to a vehicle positions dataset, collected through aerial remote sensing on a Portuguese suburban motorway. Besides the importance of a new trajectory dataset that will allow for the estimation of new behavioral models and the validation of existing ones, the motion-based multiple-vehicle tracking algorithm allowed for a fast and effective processing using a simple optimization formulation. Keywords: vehicle trajectories; image processing; driver behaviour; remote sensing.
Date issued
2014-08
URI
http://hdl.handle.net/1721.1/117173
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Journal
Transportation Research Procedia
Publisher
Elsevier BV
Citation
Azevedo, Carlos Lima et al.“Vehicle Tracking Using the k-Shortest Paths Algorithm and Dual Graphs.” Transportation Research Procedia 1, 1 (2014): 3–11 © 2014 Elsevier B.V.
Version: Final published version
ISSN
2352-1465

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.