Demo Data from EDBT 2026 / reviewers in the wild / expert
Chae-yeong Song
dblp:414/0229
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0006-0192-336XORCID · corroborated
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 · 2 since 2021Databases, data management, data science and information retrieval · 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 | Extended Scene Description using Relationship Information for Manipulating 3D Reconstructed DataabstractIn this paper, we identify a critical limitation in the MPEG-I Scene Description (SD) format: the absence of a native mechanism for representing semantic relationships between objects. To address this, we propose a relationship extension framework that enables both static and dynamic inter-object semantics within 3D scenes. The proposed solution includes two integration strategies: (1) embedding relationship information within existing extensions such as scene interactivity and scene dynamic, and (2) introducing external relationship extensions that preserve the integrity of the core SD specification. We provide a concrete syntax and demonstrate the utility of our approach through applications in scene reconstruction and ISOBMFF-based integration. The results show that both options enable context-aware manipulation and efficient restoration of inter-object relations, supporting advanced interactive and media synchronization scenarios. We propose further evaluation and adoption of these extensions to enhance interoperability and backward compatibility in future MPEG standards. Chae-yeong Song, Chaewon Moon, Aro Kim, Sanghyo Park 0001, Suhyeon Lee 0002, Sungjei Kim |
DCC | 1 |
| 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. | 2 |