EDBT 2026 Demo / reviewers in the wild / expert
Daniel Ménard
dblp:14/1517
· DBLP profile ↗
2ranked-venue papers in the field
0as first author
2since 2021 · last 2026
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Partition Tree Search Acceleration for VVC: Survey and Evaluation with VTM EvolutionabstractVVC achieves up to 50% bit-rate savings over HEVC at the cost of increased encoding complexity, largely due to the QTMTT partitioning structure. This work surveys the evolution of the VVC Test Model (VTM) and evaluates partitioning acceleration techniques considering changes in complexity and internal heuristics across VTM versions. M. E. A. Kherchouche, Franck Galpin, Thierry Dumas, Daniel Ménard |
DCC | 5 |
| 2025 | Complexity Reduction Study Based on RD Costs Approximation for VVC Intra PartitioningabstractThis paper presents a comparison study of two machine-learning techniques to accelerate the Versatile Video Coding (VVC) intra-partitioning process in QuadTree (QT) configuration: a regression model for predicting Rate-Distortion (RD) costs and a Deep Q-Network (DQN)-based Reinforcement Learning (RL) approach that models partitioning as a Markov Decision Process (MDP). Both methods are size-independent and utilize neighboring RD costs and threshold values to optimize the splits of Coding Units (CUs). M. E. A. Kherchouche, Franck Galpin, Thierry Dumas, F. Schnitzler, Daniel Ménard |
DCC | 5 |