EDBT 2026 Demo / reviewers in the wild / expert
Yongwoon Park
dblp:45/84
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1
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 · 100% | |
| Artificial intelligence
1 paper |
Robot navigation and mapping · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
point cloud processing |
0.1 | 1 | 2011 | Fast and accurate computation of surface normals from range images · ICRA 2011 |
Geometric modeling and processing › point cloud processing
range image processing |
0.1 | 1 | 2011 | Fast and accurate computation of surface normals from range images · ICRA 2011 |
Robotics › Robot navigation and mapping › terrain perception
terrain estimation |
0.0 | 1 | 2011 | Fast and accurate computation of surface normals from range images · ICRA 2011 |
Methods — techniques the papers use, named apart from their topics
total least squares · 0.2spherical range image derivatives · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Fast and accurate computation of surface normals from range imagesabstractThe fast and accurate computation of surface normals from a point cloud is a critical step for many 3D robotics and automotive problems, including terrain estimation, mapping, navigation, object segmentation, and object recognition. To obtain the tangent plane to the surface at a point, the traditional approach applies total least squares to its small neighborhood. However, least squares becomes computationally very expensive when applied to the millions of measurements per second that current range sensors can generate. We reformulate the traditional least squares solution to allow the fast computation of surface normals, and propose a new approach that obtains the normals by calculating the derivatives of the surface from a spherical range image. Furthermore, we show that the traditional least squares problem is very sensitive to range noise and must be normalized to obtain accurate results. Experimental results with synthetic and real data demonstrate that our proposed method is not only more efficienThe fast and accurate computation of surface normals from a point cloud is a critical step for many 3D robotics and automotive problems, including terrain estimation, mapping, navigation, object segmentation, and object recognition. To obtain the tangent plane to the surface at a point, the traditional approach applies total least squares to its small neighborhood. However, least squares becomes computationally very expensive when applied to the millions of measurements per second that current range sensors can generate. We reformulate the traditional least squares solution to allow the fast computation of surface normals, and propose a new approach that obtains the normals by calculating the derivatives of the surface from a spherical range image. Furthermore, we show that the traditional least squares problem is very sensitive to range noise and must be normalized to obtain accurate results. Experimental results with synthetic and real data demonstrate that our proposed method is not only more efficient by up to two orders of magnitude, but provides better accuracy than the traditional least squares for practical neighborhood sizes.t by up to two orders of magnitude, but provides better accuracy than the traditional least squares for practical neighborhood sizes. Hernán Badino, Daniel F. Huber, Yongwoon Park, Takeo Kanade |
ICRA | 3 |