View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Extensive Comparison of Trajectory Simplification Algorithms

        Thumbnail
        View/Open
        Rence van Hunnik thesis.pdf (3.051Mb)
        Publication date
        2017
        Author
        Hunnik, R.R. van
        Metadata
        Show full item record
        Summary
        In this study we compare ten simplification algorithms consisting of both line and trajectory simplification algorithms. Namely, Uniform Sampling, Douglas-Peucker, Visvalingam-Whyatt, Imai-Iri, TD-TR, SQUISH-E(μ), STTrace, OPW-TR, OPW-SP, and a newly introduced algorithm VW-TS. This newly introduced algorithm is an adaptation of the Visvalingam-Whyatt algorithm that uses Time-Space. This comparison is performed using three distinct real world datasets. Also, five error metrics are described and used to compare the simplifications’ performance. These five error metrics are: Spatial Distance, Temporal Distance, Speed Deviation, Heading Deviation, and Acceleration Deviation. TD-TR, VW-TS, and SQUISH-E(μ) prove to have the lowest error across all but one error metric. On the Acceleration Deviation metric, OPW-SP gives the lowest error with a significant margin.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/25654
        Collections
        • Theses
        Utrecht university logo