A Fast O(N) Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification

作者：Chen Minjie^*; Xu Mantao; Franti Pasi

来源：IEEE Transactions on Image Processing, 2012, 21(5): 2770-2785.

DOI：10.1109/TIP.2012.2186146

• Geographic information systems (GISs)
• global positioning system trajectory simplification (GPS TS)
• polygonal approximation
• priority queue
• reduced search dynamic programming (RSDP)

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.

• 出版日期2012-5
• 单位上海电机学院