Data Reduction of Spatio-temporal Trajectories using a Modified Online Compression Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Nasiri Afsaneh; Azimi sanaz; ABBASPOUR RAHIM ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY Year:2018 | Volume:6 | Issue:3 Page(s): 15-30

Download Full-Text

Persian Verion

View:

473

Download:

Cites:

Information Journal Paper

Title

Data Reduction of Spatio-temporal Trajectories using a Modified Online Compression Algorithm

Author(s)

Nasiri Afsaneh | Azimi sanaz | ABBASPOUR RAHIM ALI | Issue Writer Certificate

Keywords

Spatio-temporal TrajectoriesQ1

CompressionQ2

SQUISH-E AlgorithmQ1

Priority WindowQ1

Abstract

With development of mobile devices equipped with a global positioning system, such as smartphones, large amounts of spatial information are generated. These data, which are often stored and modeled as a sequence of spatial locations over time, are called trajectory. The large amount of trajectory data has increased the cost of transferring, storing and processing such data. To overcome these problems, a number of Compression algorithms have been proposed for reducing the size of trajectory data. In this paper, seven algorithms including uniform sampling, Douglas Poker, TD-TR, Opening Window, OPW-TR, TD-SB and SQUISH-E Algorithms are being discussed and the advantages and disadvantages of these algorithms are investigated as well. The SQUISH-E Algorithm can create a balance between the Compression rate and the Synchronized Euclidean Distance error, but has a high Compression rate than other Compression algorithms. To solve mentioned problem, this paper proposed a method for changing the Priority Window of the SQUISH-E Algorithm, which improves the Compression rate of this algorithm. In order to evaluate the performance of the proposed method, all algorithms are implemented on six trajectories of varying complexity and compared with each other in terms of criteria such as Compression rate, run-time, and concurrency Euclidean distance errors. The results of implementation of the proposed method indicate the improvement of the proposed algorithm at the Compression rate, computation time, and Synchronized Euclidean Distance error. In compare to SQUISH-E Algorithm, the computation time and Compression rate of proposed algorithm is decreased about 130 millisecond and 0. 015, respectively.

Cites

No record.

References

No record.

Cite

APA: Copy

Nasiri, Afsaneh, Azimi, sanaz, & ABBASPOUR, RAHIM ALI. (2018). Data Reduction of Spatio-temporal Trajectories using a Modified Online Compression Algorithm. ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY, 6(3 ), 15-30. SID. https://sid.ir/paper/230074/en

Vancouver: Copy

Nasiri Afsaneh, Azimi sanaz, ABBASPOUR RAHIM ALI. Data Reduction of Spatio-temporal Trajectories using a Modified Online Compression Algorithm. ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY[Internet]. 2018;6(3 ):15-30. Available from: https://sid.ir/paper/230074/en

IEEE: Copy

Afsaneh Nasiri, sanaz Azimi, and RAHIM ALI ABBASPOUR, “Data Reduction of Spatio-temporal Trajectories using a Modified Online Compression Algorithm,” ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY, vol. 6, no. 3 , pp. 15–30, 2018, [Online]. Available: https://sid.ir/paper/230074/en

Related Journal Papers