par Dejaegere, Gilles 
;Sakr, Mahmoud
Référence Geoinformatica, 119189
Publication Publié, 2025-05-01
;Sakr, Mahmoud Référence Geoinformatica, 119189
Publication Publié, 2025-05-01
Article révisé par les pairs
| Résumé : | This study introduces new variations of three established trajectory simplification algorithms. All the new algorithms studied are specifically designed to be used in contexts with bandwidth limitations. These variations are achieving compression under the bandwidth limitations by introducing time windows. We present the details of these algorithms and highlight the differences compared to their classical counterparts. To evaluate their performance, we conduct accuracy assessments (for varying sizes of time windows), utilizing four different datasets and different evaluation metrics. The accuracy of the proposed algorithms is compared with newly developed baselines. Some particular attention is also paid to the time delay between the generation of points and their selection. Our findings demonstrate that, for larger time windows, the enhanced versions of the bandwidth-constrained STTrace outperform other algorithms on the average synchronized Euclidean distance, with the bandwidth-constrained of STTrace also yielding satisfactory results at a lower computational cost. Conversely, for short time windows, only the bandwidth-constrained version of Dead Reckoning remains satisfactory. |
