Journal
IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume 21, Issue 5, Pages 2770-2785Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2012.2186146
Keywords
Geographic information systems (GISs); global positioning system trajectory simplification (GPS TS); polygonal approximation; priority queue; reduced search dynamic programming (RSDP)
Funding
- Tekniikan edistamissaatio under Nokia
- Tekniikan edistamissaatio under MOPSI
- National Natural Science Foundation of China [61072146]
- Shanghai Committee of Science and Technology, China [10PJ1404400]
Ask authors/readers for more resources
Recent advances in geopositioning mobile phones have made it possible for users to collect a large number of GPS trajectories by recording their location information. However, these mobile phones with built-in GPS devices usually record far more data than needed, which brings about both heavy data storage and a computationally expensive burden in the rendering process for a Web browser. To address this practical problem, we present a fast polygonal approximation algorithm in 2-D space for the GPS trajectory simplification under the so-called integral square synchronous distance error criterion in a linear time complexity. The underlying algorithm is designed and implemented using a bottom-up multiresolution method, where the input of polygonal approximation in the coarser resolution is the polygonal curve achieved in the finer resolution. For each resolution (map scale), priority-queue structure is exploited in graph construction to construct the initialized approximated curve. Once the polygonal curve is initialized, two fine-tune algorithms are employed in order to achieve the desirable quality level. Experimental results validated that the proposed algorithm is fast and achieves a better approximation result than the existing competitive methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available