Random Walks in Self-supervised Learning for Triangular Meshes

Gal Yefet, Ayellet Tal
3/2/2025
cs.GRcs.CVcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

This study addresses the challenge of self-supervised learning for 3D mesh analysis. It presents an new approach that uses random walks as a form of data augmentation to generate diverse representations of mesh surfaces. Furthermore, it employs a combination of contrastive and clustering losses. The contrastive learning framework maximizes similarity between augmented instances of the same mesh while minimizing similarity between different meshes. We integrate this with a clustering loss, enhancing class distinction across training epochs and mitigating training variance. Our model's effectiveness is evaluated using mean Average Precision (mAP) scores and a supervised SVM linear classifier on extracted features, demonstrating its potential for various downstream tasks such as object classification and shape retrieval.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yefet2025random,
  title  = {Random Walks in Self-supervised Learning for Triangular Meshes},
  author = {Gal Yefet and Ayellet Tal},
  year   = {2025},
  eprint = {2503.00816},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.00816v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.00816.svg)](https://codeofpaper.com/paper/2503.00816)

Discussion