Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Is Medoid Suitable for Averaging GPS Trajectories

Bibliographic Data

ID22031298
AuthorsBiliaminu Jimoh (University of Eastern Finland), Radu Mariescu-Istodor (0000-0002-0721-041X, University of Eastern Finland), Pasi Fränti (0000-0002-9554-2827, University of Eastern Finland, corresponding author)
Year2022
Volume11
Issue2
Pages133
Publication date2022-02-14
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueISPRS International Journal of Geo-Information (JOURNAL)
Journal identifiersISSN: 2220-9964 • E-ISSN: 2220-9964
PublisherMDPI AG (PUBLISHER • IT)
DOI10.3390/ijgi11020133
OpenAlexW4213316034
LanguageEN
References cited39

Averaging GPS trajectories is needed in applications such as clustering and automatic extraction of road segments. Calculating mean for trajectories and other time series data is non-trivial and shown to be an NP-hard problem. medoid has therefore been widely used as a practical alternative and because of its (assumed) better noise tolerance. In this paper, we study the usefulness of the medoid to solve the averaging problem with ten different trajectory-similarity/-distance measures. Our results show that the accuracy of medoid depends mainly on the sample size. Compared to other averaging methods, the performance deteriorates especially when there are only few samples from which the medoid must be selected. Another weakness is that medoid inherits properties such as the sample frequency of the arbitrarily selected sample. The choice of the trajectory distance function becomes less significant. For practical applications, other averaging methods than medoid seem a better alternative for higher accuracy

Cluster analysis · Data mining · Global Positioning System · Medoid · Trajectory · Automated Road and Building Extraction · Computer Science · Data Management and Algorithms · Mathematics · Remote Sensing and LiDAR Applications · Artificial Intelligence

  • Trajectory Similarity Analysis with the Weight of Direction and k-Neighborhood for AIS Data

    Open Access•Pin Nie, Zhenjie Chen et al.•ISPRS International Journal of…•2021

  • The Weber Problem

    Zvi Drezner, Klamroth et al.•Facility Location•2002

  • Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature

    DAVID H DOUGLAS, THOMAS K PEUCKER•Cartographica The International…•1973

Citation velocityhistorical
Highly citedNo

Tools

Open DOIOpen Access
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae