paper-with-me

Papers

Motif Guided Graph Transformer with Combinatorial Skeleton Prototype Learning for Skeleton-Based Person Re-Identification

2024-12-12 · Haocong Rao, Chunyan Miao

Person re-identification (re-ID) via 3D skeleton data is a challenging task with significant value in many scenarios. Existing skeleton-based methods typically assume virtual motion relations between all joints, and adopt average joint or sequence representations for learning. However, they rarely explore key body structure and motion such as gait to focus on more important body joints or limbs, while lacking the ability to fully mine valuable spatial-temporal sub-patterns of skeletons to enhance model learning. This paper presents a generic Motif guided graph transformer with Combinatorial skeleton prototype learning (MoCos) that exploits structure-specific and gait-related body relations as well as combinatorial features of skeleton graphs to learn effective skeleton representations for person re-ID. In particular, motivated by the locality within joints' structure and the body-component collaboration in gait, we first propose the motif guided graph transformer (MGT) that incorporates hierarchical structural motifs and gait collaborative motifs, which simultaneously focuses on multi-order local joint correlations and key cooperative body parts to enhance skeleton relation learning. Then, we devise the combinatorial skeleton prototype learning (CSP) that leverages random spatial-temporal combinations of joint nodes and skeleton graphs to generate diverse sub-skeleton and sub-tracklet representations, which are contrasted with the most representative features (prototypes) of each identity to learn class-related semantics and discriminative skeleton representations. Extensive experiments validate the superior performance of MoCos over existing state-of-the-art models. We further show its generality under RGB-estimated skeletons, different graph modeling, and unsupervised scenarios.

📄 PDF Abstract BibTeX arXiv:2412.09044

Code (1)

kali-hac/mocos 공식 구현 pytorch

Tasks

Person Re-Identification

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Adam 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Position-Wise Feed-Forward Layer 설명 없음
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.

Similar Papers 제목 키워드 기반

Enhanced graph-learning schemes driven by similar distributions of motifs

2022-07-11 · Samuel Rey, T. Mitchell Roddenberry, Santiago Segarra, Antonio G. Marques

This paper looks at the task of network topology inference, where the goal is to learn an unknown graph from nodal observations. One of the novelties of the approach put forth is the consideration of prior information ab…

Graph LearningInference Optimization

Local Motif Clustering via (Hyper)Graph Partitioning

2022-05-11 · Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz

A widely-used operation on graphs is local clustering, i.e., extracting a well-characterized community around a seed node without the need to process the whole graph. Recently local motif clustering has been proposed: it…

Clusteringgraph partitioning

Approximate Network Motif Mining Via Graph Learning

2022-06-02 · Carlos Oliver, Dexiong Chen, Vincent Mallet, Pericles Philippopoulos 외

Frequent and structurally related subgraphs, also known as network motifs, are valuable features of many graph datasets. However, the high computational complexity of identifying motif sets in arbitrary datasets (motif m…

BIG-bench Machine LearningGraph ClassificationGraph Learning

Core motifs predict dynamic attractors in combinatorial threshold-linear networks

2021-09-06 · Caitlyn Parmelee, Samantha Moore, Katherine Morrison, Carina Curto

Combinatorial threshold-linear networks (CTLNs) are a special class of inhibition-dominated TLNs defined from directed graphs. Like more general TLNs, they display a wide variety of nonlinear dynamics including multistab…

Accurate and Fast Estimation of Temporal Motifs using Path Sampling

2024-09-13 · Yunjie Pan, Omkar Bhalerao, C. Seshadhri, Nishil Talati

Counting the number of small subgraphs, called motifs, is a fundamental problem in social network analysis and graph mining. Many real-world networks are directed and temporal, where edges have timestamps. Motif counting…

GPUGraph Mining