By Topic

Quadtree-based domain decomposition for parallel map-matching on GPS data

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

5 Author(s)
Yingjie Xia ; Hangzhou Inst. of Service Eng., Hangzhou Normal Univ., Hangzhou, China ; Yuncai Liu ; Zhoumin Ye ; Wei Wu
more authors

This paper presents a quadtree-based domain decomposition method for matching Global Positioning System (GPS) data onto the digital map in parallel. The method uses two basic tools, quadtree and interval distance measurement. Quadtree is a structure which can facilitate to decompose massive GPS data in a domain into multiple data pieces in the sub-domains. These data pieces with the underlying boundary-extended maps create the computing tasks, which are assigned to Cyberinfrastructure (CI) resources for parallel map-matching. In the task, each GPS point measures the interval distances between itself and the projected points on the road segments surrounding in its sub-domain, and selects the shortest one to determine the mapped point. The experiments show that this method can achieve efficient speedup in computational time by load balancing, and keep high accuracy on the matching results.

Published in:

Intelligent Transportation Systems (ITSC), 2012 15th International IEEE Conference on

Date of Conference:

16-19 Sept. 2012