paper-with-me

홈 › Papers

Multi-view Action Recognition via Directed Gromov-Wasserstein Discrepancy

2024-05-02 · Hoang-Quan Nguyen, Thanh-Dat Truong, Khoa Luu

Action recognition has become one of the popular research topics in computer vision. There are various methods based on Convolutional Networks and self-attention mechanisms as Transformers to solve both spatial and temporal dimensions problems of action recognition tasks that achieve competitive performances. However, these methods lack a guarantee of the correctness of the action subject that the models give attention to, i.e., how to ensure an action recognition model focuses on the proper action subject to make a reasonable action prediction. In this paper, we propose a multi-view attention consistency method that computes the similarity between two attentions from two different views of the action videos using Directed Gromov-Wasserstein Discrepancy. Furthermore, our approach applies the idea of Neural Radiance Field to implicitly render the features from novel views when training on single-view datasets. Therefore, the contributions in this work are three-fold. Firstly, we introduce the multi-view attention consistency to solve the problem of reasonable prediction in action recognition. Secondly, we define a new metric for multi-view consistent attention using Directed Gromov-Wasserstein Discrepancy. Thirdly, we built an action recognition model based on Video Transformers and Neural Radiance Fields. Compared to the recent action recognition methods, the proposed approach achieves state-of-the-art results on three large-scale datasets, i.e., Jester, Something-Something V2, and Kinetics-400.

📄 PDF Abstract BibTeX arXiv:2405.01337

Code (0)

등록된 구현이 없습니다.

Tasks

Action Recognition

Similar Papers 제목 키워드 기반

Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clustering

2026-04-26 · Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante arxiv

Learning low-dimensional representations from multi-view relational data is challenging when underlying geometries differ across views. We propose Bary-GWMDS, a Gromov-Wasserstein-based method that operates directly on d…

Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks

2023-09-13 · James S. Nagai, Ivan G. Costa, Michael T. Schaub

Comparing graphs by means of optimal transport has recently gained significant attention, as the distances induced by optimal transport provide both a principled metric between graphs as well as an interpretable descript…

Shrinkage Optimized Directed Information using Pictorial Structures for Action Recognition

2014-04-12 · Xu Chen, Alfred Hero, Silvio Savarese

In this paper, we propose a novel action recognition framework. The method uses pictorial structures and shrinkage optimized directed information assessment (SODA) coupled with Markov Random Fields called SODA+MRF to mod…

Action RecognitionTemporal Action Localization

Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transport

2026-04-03 · Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante arxiv

Multi-view data analysis seeks to integrate multiple representations of the same samples in order to recover a coherent low-dimensional structure. Classical approaches often rely on feature concatenation or explicit alig…

Representation Learning

Optimal Transport for structured data with application on graphs

2018-05-23 · Titouan Vayer, Laetitia Chapel, Rémi Flamary, Romain Tavenard 외

This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance (i.e. t…

ClusteringGraph ClassificationGraph ClusteringTime Series Analysis