Reconstructing Humpty Dumpty: Multi-feature Graph Autoencoder for Open Set Action Recognition
Most action recognition datasets and algorithms assume a closed world, where all test samples are instances of the known classes. In open set problems, test samples may be drawn from either known or unknown classes. Existing open set action recognition methods are typically based on extending closed set methods by adding post hoc analysis of classification scores or feature distances and do not capture the relations among all the video clip elements. Our approach uses the reconstruction error to determine the novelty of the video since unknown classes are harder to put back together and thus have a higher reconstruction error than videos from known classes. We refer to our solution to the open set action recognition problem as "Humpty Dumpty", due to its reconstruction abilities. Humpty Dumpty is a novel graph-based autoencoder that accounts for contextual and semantic relations among the clip pieces for improved reconstruction. A larger reconstruction error leads to an increased likelihood that the action can not be reconstructed, i.e., can not put Humpty Dumpty back together again, indicating that the action has never been seen before and is novel/unknown. Extensive experiments are performed on two publicly available action recognition datasets including HMDB-51 and UCF-101, showing the state-of-the-art performance for open set action recognition.
Code (0)
등록된 구현이 없습니다.
Tasks
Action RecognitionOpen Set Action RecognitionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Humpty Dumpty: Controlling Word Meanings via Corpus Poisoning
Word embeddings, i.e., low-dimensional vector representations such as GloVe and SGNS, encode word "meaning" in the sense that distances between words' vectors correspond to their semantic proximity. This enables transfer…
Data PoisoningInformation RetrievalLanguage Modellingnamed-entity-recognition+5Graph Context Encoder: Graph Feature Inpainting for Graph Generation and Self-supervised Pretraining
We propose the Graph Context Encoder (GCE), a simple but efficient approach for graph representation learning based on graph feature masking and reconstruction. GCE models are trained to efficiently reconstruct input gra…
Graph GenerationGraph Representation LearningRepresentation LearningReconstruction of Graph Signals on Complex Manifolds with Kernel Methods
Graph signals are widely used to describe vertex attributes or features in graph-structured data, with applications spanning the internet, social media, transportation, sensor networks, and biomedicine. Graph signal proc…
Topology-aware Reinforcement Feature Space Reconstruction for Graph Data
Feature space is an environment where data points are vectorized to represent the original dataset. Reconstructing a good feature space is essential to augment the AI power of data, improve model generalization, and incr…
feature selectionGraph Neural NetworkFeature-aware Hypergraph Generation via Next-Scale Prediction
Hypergraphs generalize traditional graphs by allowing hyperedges to connect multiple nodes, making them well-suited for modeling complex structures with higher-order relationships, such as 3D meshes, molecular systems, a…
Prediction