Papers › SimMC: Simple Masked Contrastive Learning of Skeleton Representations for Unsupervised...

SimMC: Simple Masked Contrastive Learning of Skeleton Representations for Unsupervised Person Re-Identification

21 Apr 2022arXiv:2204.09826archive 2025-07-28

Haocong Rao, Chunyan Miao

Recent advances in skeleton-based person re-identification (re-ID) obtain impressive performance via either hand-crafted skeleton descriptors or skeleton representation learning with deep learning paradigms. However, they typically require skeletal pre-modeling and label information for training, which leads to limited applicability of these methods. In this paper, we focus on unsupervised skeleton-based person re-ID, and present a generic Simple Masked Contrastive learning (SimMC) framework to learn effective representations from unlabeled 3D skeletons for person re-ID. Specifically, to fully exploit skeleton features within each skeleton sequence, we first devise a masked prototype contrastive learning (MPC) scheme to cluster the most typical skeleton features (skeleton prototypes) from different subsequences randomly masked from raw sequences, and contrast the inherent similarity between skeleton features and different prototypes to learn discriminative skeleton representations without using any label. Then, considering that different subsequences within the same sequence usually enjoy strong correlations due to the nature of motion continuity, we propose the masked intra-sequence contrastive learning (MIC) to capture intra-sequence pattern consistency between subsequences, so as to encourage learning more effective skeleton representations for person re-ID. Extensive experiments validate that the proposed SimMC outperforms most state-of-the-art skeleton-based methods. We further show its scalability and efficiency in enhancing the performance of existing models. Our codes are available at https://github.com/Kali-Hac/SimMC.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2204.09826")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kali-hac/simmc officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Kali-Hac/SimMC. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

compute_jaccard_distance Kali-Hac/SimMC/utils/faiss_rerank.py official repository unverified MIT (permissive) · b6548c531f96defb · report
gen_train_data Kali-Hac/SimMC/utils/process_L3.py official repository unverified MIT (permissive) · 37fb86d5da762cea · report
gen_train_data Kali-Hac/SimMC/utils/process_cme_L3.py official repository unverified MIT (permissive) · 4023b8fa8809a1ef · report
k_reciprocal_neigh Kali-Hac/SimMC/utils/faiss_rerank.py official repository unverified MIT (permissive) · a610e67edff490e6 · report
reduce2body Kali-Hac/SimMC/utils/process_L3.py official repository unverified MIT (permissive) · 677c3e6b941ea5a3 · report
reduce2body Kali-Hac/SimMC/utils/process_cme_L3.py official repository unverified MIT (permissive) · 2f9cbec400e7f8fc · report
reduce2part Kali-Hac/SimMC/utils/process_L3.py official repository unverified MIT (permissive) · 8afab386b1dcf86d · report
reduce2part Kali-Hac/SimMC/utils/process_cme_L3.py official repository unverified MIT (permissive) · 1be88827c6eae5df · report
search_index_pytorch Kali-Hac/SimMC/utils/faiss_utils.py official repository unverified MIT (permissive) · 78ca4879f13cc9d5 · report
swig_ptr_from_FloatTensor Kali-Hac/SimMC/utils/faiss_utils.py official repository unverified MIT (permissive) · f295b8050ce2a4f1 · report
swig_ptr_from_LongTensor Kali-Hac/SimMC/utils/faiss_utils.py official repository unverified MIT (permissive) · 892aeccb03c9a237 · report

Tasks

Contrastive LearningPerson Re-IdentificationRepresentation LearningUnsupervised Person Re-Identification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections