By Topic

Accurate Discovery of Valid Convoys from Moving Object Trajectories

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Given a set of moving object trajectories, it is of interest to find a group of objects, called a convoy, that are spatially density-connected for a certain duration of time. However, existing convoy discovery algorithms have a critical problem of accuracy; they tend to both miss larger convoys and retrieve invalid ones where the density-connectivity among the objects is not completely satisfied. We propose a new valid convoy discovery algorithm, called VCoDA, for the accurate discovery of valid convoys from moving object trajectories. Specifically, VCoDA first retrieves all partially connected convoys while guaranteeing no false dismissal of any valid convoys and then validates their density-connectivity to eventually obtain a complete set of valid convoys. Our extensive experiments on three real-world datasets demonstrate the effectiveness of our technique; VCoDA improves the precision by a factor of 3 on average and the recall by up to 2 orders of magnitude as compared to an existing method.

Published in:

Data Mining Workshops, 2009. ICDMW '09. IEEE International Conference on

Date of Conference:

6-6 Dec. 2009