Learning accurate three-dimensional models from range data using global constraints
| dc.contributor.author | Burgard, Wolfram | |
| dc.contributor.author | Triebel, Rudolph | |
| dc.contributor.editor | Cremers, Armin B. | |
| dc.contributor.editor | Manthey, Rainer | |
| dc.contributor.editor | Martini, Peter | |
| dc.contributor.editor | Steinhage, Volker | |
| dc.date.accessioned | 2019-10-11T07:57:22Z | |
| dc.date.available | 2019-10-11T07:57:22Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | Recently, the acquisition of three-dimensional maps from range scans acquired with mobile robots has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several tasks such as path planning or localizing objects can be carried out more reliably using three-dimensional representations. Key questions in this context are how to reduce the complexity of the data and how to efficiently match scans. Man-made structures such as buildings typically contain many structures such as planes and corners that are parallel. In this presentation we describe recently developed techniques that take into account such constraints to better approximate the data by planes to compute more accurate registrations. For plane extraction we use a hierarchical version of the expectation maximization (EM) algorithm to simultaneously cluster the data points into planes and the planes into their corresponding main directions. The information about the main directions is incorporated in the maximization step to calculate the parameters of the individual planes. We present experimental results obtained with real data and in simulation which demonstrate that our algorithm can accurately extract planes and their orientation from range data. Further results illustrate that our approach yields more accurate planes than the standard EM technique. Additionally, we present an approach that improves the registration process of three-dimensional range scans by introducing global constraints between the poses from which the scans were taken. Our approach minimizes not only the distance between scans, but also the distance of edges extracted from the scans to planes that are supported by the edges. This seriously decreases the required overlap between scans and in this way allows to reduce the number of data points in the model. We present experimental results illustrating that the global cons- traints allow to learn more accurate models even when there only is a small overlap between the scans. | en |
| dc.identifier.isbn | 3-88579-397-0 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/28133 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Informatik 2005 – Informatik Live! Band 2 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-68 | |
| dc.title | Learning accurate three-dimensional models from range data using global constraints | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 667 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 667 | |
| gi.conference.date | 19. bis 22. September 2005 | |
| gi.conference.location | Bonn | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1
Lade...
- Name:
- GI-Proceedings.68-138.pdf
- Größe:
- 293.26 KB
- Format:
- Adobe Portable Document Format