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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Xia, Yingjie (author) / Liu, Yuncai (author) / Ye, Zhoumin (author) / Wu, Wei (author) / Zhu, Mingzhe (author)


    Publication date :

    2012-09-01


    Size :

    1151862 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Image search based on quadtree Zernike decomposition

    Neri, A. / Carli, M. / Palma, V. et al. | British Library Online Contents | 2010


    Optimal Parallel Algorithms for Quadtree Problems

    Kasif, S. | British Library Online Contents | 1994


    Complementary quadtree

    Kim, Y.-M. / Park, S.-B. | British Library Online Contents | 1993


    Iterated dynamic programming and quadtree subregioning for fast stereo matching

    Leung, C. / Appleton, B. / Sun, C. | British Library Online Contents | 2008


    Quadtree-based representations of grid-oriented data

    Voros, J. | British Library Online Contents | 2006