The reviewed record of science sign in
Pith

arxiv: 2211.15508 · v1 · pith:YEXC7MVG · submitted 2022-11-24 · cs.CV · cs.LG· cs.RO

Self Supervised Clustering of Traffic Scenes using Graph Representations

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YEXC7MVGrecord.jsonopen to challenge →

classification cs.CV cs.LGcs.RO
keywords trafficgraphscenessimilarityapproachchallengeclusteringembedding
0
0 comments X
read the original abstract

Examining graphs for similarity is a well-known challenge, but one that is mandatory for grouping graphs together. We present a data-driven method to cluster traffic scenes that is self-supervised, i.e. without manual labelling. We leverage the semantic scene graph model to create a generic graph embedding of the traffic scene, which is then mapped to a low-dimensional embedding space using a Siamese network, in which clustering is performed. In the training process of our novel approach, we augment existing traffic scenes in the Cartesian space to generate positive similarity samples. This allows us to overcome the challenge of reconstructing a graph and at the same time obtain a representation to describe the similarity of traffic scenes. We could show, that the resulting clusters possess common semantic characteristics. The approach was evaluated on the INTERACTION dataset.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.