Robust Online Trajectory Clustering without Computing Trajectory Distances

Michael Ulm (Speaker), Norbert Brändle

Research output: Chapter in Book or Conference ProceedingsConference Proceedings with Poster Presentationpeer-review

Abstract

We propose a novel trajectory clustering algorithm which is suitable for online processing of pedestrian or vehicle trajectories computed with a vision-based tracker. Our approach does not require defining distances between trajectories, and can thus process broken trajectories which are inevitable in most cases when object trackers are applied to real world video footage. Clusters are defined as smooth vector fields on a bounded connected set, and cluster distance is based on pairwise distances between vector sets. The results are illustrated on a trajectory set from the Edinburgh Informatics Forum Pedestrian Dataset, on a trajectory set from a public transport junction, and trajectories from an experimental setup in a corridor.
Original languageEnglish
Title of host publicationICPR 2012
Pages2270-2273
Number of pages4
Publication statusPublished - 2012
EventInternational Conference on Pattern Recognition 2012 -
Duration: 11 Nov 201215 Nov 2012

Conference

ConferenceInternational Conference on Pattern Recognition 2012
Period11/11/1215/11/12

Research Field

  • Former Research Field - Mobility Systems

Fingerprint

Dive into the research topics of 'Robust Online Trajectory Clustering without Computing Trajectory Distances'. Together they form a unique fingerprint.

Cite this