Demo Data from EDBT 2026 / reviewers in the wild / expert
Daebeom Kim
dblp:345/8325
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
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 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 · 67% Representation and self-supervised learning · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
feature extraction |
0.9 | 1 | 2025 | KISS-Matcher: Fast and Robust Point Cloud Registration Revisited · ICRA 2025 |
Computer vision › 3D vision › point cloud registration › robust registration
outlier-robust registration |
0.9 | 1 | 2025 | KISS-Matcher: Fast and Robust Point Cloud Registration Revisited · ICRA 2025 |
Computer vision › 3D vision
point cloud registration |
0.9 | 1 | 2025 | KISS-Matcher: Fast and Robust Point Cloud Registration Revisited · ICRA 2025 |
Methods — techniques the papers use, named apart from their topics
pose solver · 0.9k-core graph pruning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | KISS-Matcher: Fast and Robust Point Cloud Registration RevisitedabstractWhile global point cloud registration systems have advanced significantly in all aspects, many studies have focused on specific components, such as feature extraction, graph-theoretic pruning, or pose solvers. In this paper, we take a holistic view on the registration problem and develop an open-source and versatile C++ library for point cloud registration, called KISS-Matcher. KISS-Matcher combines a novel feature detector, Faster-PFH, that improves over the classical fast point feature histogram (FPFH). Moreover, it adopts a k-core-based graph-theoretic pruning to reduce the time complexity of rejecting outlier correspondences. Finally, it combines these modules in a complete, user-friendly, and ready-to-use pipeline. As verified by extensive experiments, KISS-Matcher has superior scalability and broad applicability, achieving a substantial speed-up compared to state-of-the-art outlier-robust registration pipelines while preserving accuracy. Our code will be available at https://github.com/MIT-SPARK/KISS-Matcher. Hyungtae Lim, Daebeom Kim, Gunhee Shin, Jingnan Shi, Ignacio Vizzo, Hyun Myung, Jaesik Park, Luca Carlone |
ICRA | 2 |