English  |  正體中文  |  简体中文  |  Items with full text/Total items : 43312/67235
Visitors : 2024528      Online Users : 3
RC Version 5.0 © Powered By DSPACE, MIT. Enhanced by NTU/NCHU Library IR team.

Please use this identifier to cite or link to this item: http://nchuir.lib.nchu.edu.tw/handle/309270000/153917

標題: 應用角度偏差的GPS軌跡簡化演算法
Using Angle Deviation for GPS Trajectory Simplification Algorithm
作者: 沈東耀
Shen, Tung-Yao
Contributors: 廖俊睿
Jan-Ray Liao
通訊工程研究所
關鍵字: 全球衛星定位系統;軌跡簡化;誤差測量
GPS;trajectory simplification;error measure
日期: 2013
Issue Date: 2013-11-19 12:31:26 (UTC+8)
Publisher: 通訊工程研究所
摘要: 當前的全球衛星定位系統(GPS)技術可以讓使用者蒐集大量的軌跡資訊,並且紀錄這些位置的信息。然而對於嵌入式GPS設備而言,通常記錄的資料,比使用到的還多出許多,這將會造成資料儲存以及在瀏覽器上繪圖過程中的計算負擔。
一般在GPS軌跡簡化技術裡面,針對上述的問題可以細分為兩種解決方式,一般都是在簡化效率和計算成本之間做權衡。一種是精確度比較高的優化式方法,但同時也伴隨著較高的計算成本,而另一種啟發式的方法則是以低計算成本為主,但簡化的準確度也有限。
我們提出了一個以角度偏差的方法,當作是多邊形近似法的誤差測量標準,並且以累加的方式來判斷軌跡點是否保留,我們的方法與以累計誤差距離的局部最小平方法(LISE)來做比較,實驗證明我們所提出角度偏差法的計算複雜度低於局部最小平方法,且在簡化比例越高時,總誤差值比局部最小平方法更低。
Global positioning system (GPS) technology allows users to record their location and, thereby, generate a trajectory. However, the data points collected by GPS devices are usually far more than necessary. The redundant data points are a burden to the graphic rendering process and the data storage.
The solutions to simplify GPS trajectory generally need a tradeoff between simplification efficiency and computational cost. An algorithm which results in lower approximation error usually requires more computation time. On the other hand, solutions which use heuristics to reduce computational cost usually generate a simplified trajectory with higher approximation error.
In this thesis, we propose a method which uses the accumulation of angle deviation as an error measure of polygonal approximation. Comparing our method against a traditional algorithm which uses distance deviation as the error measure, experimental results show that the computational cost of our algorithm is less than the distance-based algorithm. Meanwhile, the overall approximation error of our method is better than that of the distance-based algorithm when the number of data points in the approximate trajectory gets smaller.
Appears in Collections:[依資料類型分類] 碩博士論文

Files in This Item:

File Description SizeFormat
nchu-102-7100064108-1.pdf1512Kb323View/Open
index.html0KbHTML129View/Open


 


學術資源

著作權聲明

本網站為收錄中興大學學術著作及學術產出,已積極向著作權人取得全文授權,並盡力防止侵害著作權人之權益。如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員,將盡速為您處理。

本網站之數位內容為國立中興大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用。

聯絡網站維護人員:wyhuang@nchu.edu.tw,04-22840290 # 412。

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU/NCHU Library IR team Copyright ©   - Feedback