Pith. sign in

REVIEW 1 cited by

MeshWalker: Deep Mesh Understanding by Random Walks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.05353 v3 pith:HAUSKL5Q submitted 2020-06-09 cs.CV cs.CGcs.LG

classification cs.CVcs.CGcs.LG
keywords meshdeeplearningshapewalkapproachattemptsmeshwalker
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Most attempts to represent 3D shapes for deep learning have focused on volumetric grids, multi-view images and point clouds. In this paper we look at the most popular representation of 3D shapes in computer graphics - a triangular mesh - and ask how it can be utilized within deep learning. The few attempts to answer this question propose to adapt convolutions & pooling to suit Convolutional Neural Networks (CNNs). This paper proposes a very different approach, termed MeshWalker, to learn the shape directly from a given mesh. The key idea is to represent the mesh by random walks along the surface, which "explore" the mesh's geometry and topology. Each walk is organized as a list of vertices, which in some manner imposes regularity on the mesh. The walk is fed into a Recurrent Neural Network (RNN) that "remembers" the history of the walk. We show that our approach achieves state-of-the-art results for two fundamental shape analysis tasks: shape classification and semantic segmentation. Furthermore, even a very small number of examples suffices for learning. This is highly important, since large datasets of meshes are difficult to acquire.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MeshConv3D: Efficient convolution and pooling operators for triangular 3D meshes

    cs.CV 2025-01 conditional novelty 4.0 of 10

    A mesh-native CNN with variable-size convolution regions and parallel face-collapse pooling achieves competitive classification with substantially lower memory use.

Pith tools