Demo Data from EDBT 2026 / reviewers in the wild / expert
Alon Lahav
dblp:267/2269
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 67% Image and video processing · 33% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image segmentation
semantic segmentation |
0.4 | 1 | 2020 | MeshWalker: deep mesh understanding by random walks · ACM Trans. Graph. 2020 |
Geometric modeling and processing
shape analysis |
0.4 | 1 | 2020 | MeshWalker: deep mesh understanding by random walks · ACM Trans. Graph. 2020 |
Geometric modeling and processing › shape analysis
shape classification |
0.4 | 1 | 2020 | MeshWalker: deep mesh understanding by random walks · ACM Trans. Graph. 2020 |
Machine learning › Deep learning architectures and training
recurrent neural network |
0.1 | 1 | 2020 | MeshWalker: deep mesh understanding by random walks · ACM Trans. Graph. 2020 |
Methods — techniques the papers use, named apart from their topics
recurrent neural network · 0.9random walk · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | AttWalk: Attentive Cross-Walks for Deep Mesh AnalysisabstractMesh representation by random walks has been shown to benefit deep learning. Randomness is indeed a powerful concept. However, it comes with a price—some walks might wander around non-characteristic regions of the mesh, which might be harmful to shape analysis, especially when only a few walks are utilized. We propose a novel walk-attention mechanism that leverages the fact that multiple walks are used for a single mesh representation. The key idea is that the walks may provide each other with information regarding the meaningful (attentive) features of the mesh. We utilize this mutual information to extract a single descriptor of the mesh. This differs from common attention mechanisms that use attention to improve the representation of each individual descriptor. Our approach achieves SOTA results for two basic 3D shape analysis tasks: classification and retrieval. Even a handful of walks along a mesh suffice for learning. Furthermore, our approach provides insight into mesh importance detection. Ran Ben Izhak, Alon Lahav, Ayellet Tal |
WACV | 2 |
| 2020 | MeshWalker: deep mesh understanding by random walksabstractMost 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. Alon Lahav, Ayellet Tal |
ACM Trans. Graph. | 1 |