A Short Note on Analyzing Sequence Complexity in Trajectory Prediction Benchmarks

03/27/2020
by   Ronny Hug, et al.
0

The analysis and quantification of sequence complexity is an open problem frequently encountered when defining trajectory prediction benchmarks. In order to enable a more informative assembly of a data basis, an approach for determining a dataset representation in terms of a small set of distinguishable prototypical sub-sequences is proposed. The approach employs a sequence alignment followed by a learning vector quantization (LVQ) stage. A first proof of concept on synthetically generated and real-world datasets shows the viability of the approach.

READ FULL TEXT
research
05/28/2020

Quantifying the Complexity of Standard Benchmarking Datasets for Long-Term Human Trajectory Prediction

Methods to quantify the complexity of trajectory datasets are still a mi...
research
03/20/2022

Note on a Fibonacci Parity Sequence

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in...
research
02/24/2019

Machine Learning Aided Anonymization of Spatiotemporal Trajectory Datasets

The big data era requires a growing number of companies to publish their...
research
03/27/2021

Two-Stage Clustering of Human Preferences for Action Prediction in Assembly Tasks

To effectively assist human workers in assembly tasks a robot must proac...
research
03/17/2023

Efficient and Feasible Robotic Assembly Sequence Planning via Graph Representation Learning

Automatic Robotic Assembly Sequence Planning (RASP) can significantly im...
research
01/23/2022

Deep Learning on Attributed Sequences

Recent research in feature learning has been extended to sequence data, ...
research
10/18/2017

On Optimal Operational Sequence of Components in a Warm Standby System

We consider an open problem of optimal operational sequence for the 1-ou...

Please sign up or login with your details

Forgot password? Click here to reset