Demo Data from EDBT 2026 / reviewers in the wild / expert
Hojun Song
dblp:301/2310
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0007-4491-6458ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 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.
| Artificial intelligence
1 paper |
3D vision · 50% Efficient and distributed learning · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › 3d scene understanding
3d scene graph |
1.0 | 1 | 2026 | Compression Framework for Light 3D Scene Graph Generation via Pruning-as-Search and Distillation · IEEE Trans. Multim. 2026 |
Computer vision › 3D vision
3d scene understanding |
1.0 | 1 | 2026 | Compression Framework for Light 3D Scene Graph Generation via Pruning-as-Search and Distillation · IEEE Trans. Multim. 2026 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | Compression Framework for Light 3D Scene Graph Generation via Pruning-as-Search and Distillation · IEEE Trans. Multim. 2026 |
Machine learning › Efficient and distributed learning › model compression
pruning and distillation |
1.0 | 1 | 2026 | Compression Framework for Light 3D Scene Graph Generation via Pruning-as-Search and Distillation · IEEE Trans. Multim. 2026 |
Methods — techniques the papers use, named apart from their topics
structured pruning · 1.0pruning-as-search · 1.0knowledge distillation · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Compression Framework for Light 3D Scene Graph Generation via Pruning-as-Search and Distillationabstract3D scene graph generation (3DSGG), which involves classifying objects and predicates, is an emerging topic in 3D scene understanding. Recent studies leveraging graph neural networks (GNNs) have introduced sophisticated architectures that enhance classification performance. However, since GNNs serve as the core and constitute the majority of parameters in 3DSGG models, their computational demands substantially increase overall complexity, which makes it difficult to determine the optimal model capacity. In this paper, we propose the first compression framework for lightweight 3DSGG models, based on pruning-as-search and knowledge distillation. This framework integrates multiple strategies and modules. In phase 1, the framework identifies the optimal compression ratio through pruning-as-search. In phase 2, to mitigate the accuracy loss incurred during compression, we employ structured pruning and a novel knowledge distillation strategy that effectively transfers precise information from the teacher to the compressed model. Experimental results show that our approach reduces model size by more than half while improving classification accuracy. Code is available athttps://github.com/hojunking/3DSGG-compression. Hojun Song, Chae-yeong Song, Heejung Choi, Sungjei Kim, Sanghyo Park 0001 |
IEEE Trans. Multim. | 1 |