Demo Data from EDBT 2026 / reviewers in the wild / expert
Tommaso de Fernex
dblp:384/4189
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Computer graphics and multimedia
1 paper |
Geometric modeling and processing · 50% Image and video coding · 50% | |
| Artificial intelligence
1 paper |
3D vision · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
point cloud processing |
0.8 | 1 | 2024 | An Explicit Frame Construction for Normalizing 3D Point Clouds · ICML 2024 |
Image and video coding
reference frame generation |
0.8 | 1 | 2024 | An Explicit Frame Construction for Normalizing 3D Point Clouds · ICML 2024 |
Geometric modeling and processing
shape analysis |
0.8 | 1 | 2024 | An Explicit Frame Construction for Normalizing 3D Point Clouds · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
spectral methods · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | An Explicit Frame Construction for Normalizing 3D Point CloudsabstractMany real-world datasets are represented as 3D point clouds -- yet they often lack a predefined reference frame, posing a challenge for machine learning or general data analysis. Traditional methods for determining reference frames and normalizing 3D point clouds often struggle with specific inputs, lack theoretical guarantees, or require massive data. We introduce a new algorithm that overcomes these limitations and guarantees both universality and compatibility with any learnable framework for 3D point cloud analysis. Our algorithm works with any input point cloud and performs consistently regardless of input complexities, unlike data-driven methods that are susceptible to biases or limited training data. Empirically, our algorithm outperforms existing methods in effectiveness and generalizability across diverse benchmark datasets. Code is available at https://github.com/Utah-Math-Data-Science/alignment. Justin M. Baker, Shih-Hsin Wang, Tommaso de Fernex, Bao Wang 0001 |
ICML | 3 |