Learning event representations for temporal segmentation of image sequences by dynamic graph embedding
Mariella Dimiccoli, Herwig Wendt

TL;DR
This paper introduces Dynamic Graph Embedding (DGE), a novel self-supervised method that learns event representations for temporal segmentation of image sequences without requiring training data, by iteratively updating a graph and its embedding.
Contribution
The paper proposes DGE, a training-free, iterative graph-based approach that captures semantic and temporal similarities for event segmentation in image sequences.
Findings
DGE outperforms state-of-the-art methods on EDUBSeg datasets.
DGE demonstrates strong generalization on human motion segmentation datasets.
The approach effectively captures semantic and temporal relations without training data.
Abstract
Recently, self-supervised learning has proved to be effective to learn representations of events suitable for temporal segmentation in image sequences, where events are understood as sets of temporally adjacent images that are semantically perceived as a whole. However, although this approach does not require expensive manual annotations, it is data hungry and suffers from domain adaptation problems. As an alternative, in this work, we propose a novel approach for learning event representations named Dynamic Graph Embedding (DGE). The assumption underlying our model is that a sequence of images can be represented by a graph that encodes both semantic and temporal similarity. The key novelty of DGE is to learn jointly the graph and its graph embedding. At its core, DGE works by iterating over two steps: 1) updating the graph representing the semantic and temporal similarity of the data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
