EDBT 2026 Demo / reviewers in the wild / expert
Yuexin Mu
dblp:399/9649
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0002-0170-6526ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 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 |
Robot navigation and mapping · 67% 3D vision · 33% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot navigation and mapping › localization › odometry
LiDAR-inertial odometry |
0.9 | 1 | 2025 | LIO-DPC: Accurate and Fast LiDAR-Inertial Odometry with Dynamic Pose Chain · DAC 2025 |
Robotics › Robot navigation and mapping
localization |
0.9 | 1 | 2025 | LIO-DPC: Accurate and Fast LiDAR-Inertial Odometry with Dynamic Pose Chain · DAC 2025 |
Computer vision › 3D vision
pose estimation |
0.9 | 1 | 2025 | LIO-DPC: Accurate and Fast LiDAR-Inertial Odometry with Dynamic Pose Chain · DAC 2025 |
Graph algorithms and graph theory
graph optimization |
0.9 | 1 | 2025 | LIO-DPC: Accurate and Fast LiDAR-Inertial Odometry with Dynamic Pose Chain · DAC 2025 |
Methods — techniques the papers use, named apart from their topics
loop sparsification · 1.7graph optimization · 1.7filter-based estimation · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LIO-DPC: Accurate and Fast LiDAR-Inertial Odometry with Dynamic Pose ChainabstractLiDAR-inertial odometry is widely used in robotics navigation, autonomous driving, and drone operation to provide precise, low-latency motion estimation. Filter-based methods are fast but suffer from significant cumulative errors. Graph optimization methods reduce cumulative errors through loop closure detection but are computationally expensive. In this work, we propose LIO-DPC, a framework that combines the benefits of the filter-based approach and graph-based approach. First, we propose a dynamic pose chain optimization method. It generates an initial pose chain using the fast filter. This is followed by applying computationally efficient local graph optimization to a set of local pose chains to generate refined relative poses, which are then used to update the motion estimation. Second, we propose a loop sparsification approach to select representative loops that are both temporally and spatially proximate, to reduce the computational complexity in graph optimization and minimize loop errors. Extensive experiments demonstrate that LIO-DPC achieves real-time performance and outperforms state-of-the-art methods in accuracy. Yuexin Mu, Ao Ren, Duo Liu 0002, Zihao Zhang 0002, Haojie Lu, Longyi Zhou, Huachen Tan, Kan Zhong, Yujuan Tan, Chaoxia Qin |
DAC | 1 |
| 2024 | Rethinking Literary Plagiarism in LLMs through the Lens of Copyright Laws
Huachen Tan, Moming Duan, Duo Liu 0002, Haojie Lu, Yuexin Mu, Longyi Zhou, Ao Ren, Yujuan Tan, Kan Zhong |
ACML | 5 |