2016
DOI: 10.1007/s11554-016-0562-6
|View full text |Cite
|
Sign up to set email alerts
|

Fast total least squares vectorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 38 publications
0
7
0
Order By: Relevance
“…All of these examples prove that geometrical primitives have their benefits. In [23], we have shown, that proper approximation using a more complex geometric primitive can reliably reduce the noise inherently present in the point cloud, which disproves the criticism in [18]. In combination with the general tendency towards object-oriented mapping in robotics [3], the complex object registration seems to be a viable research direction.…”
Section: Geometrical Primitives In the Registration Processmentioning
confidence: 81%
See 1 more Smart Citation
“…All of these examples prove that geometrical primitives have their benefits. In [23], we have shown, that proper approximation using a more complex geometric primitive can reliably reduce the noise inherently present in the point cloud, which disproves the criticism in [18]. In combination with the general tendency towards object-oriented mapping in robotics [3], the complex object registration seems to be a viable research direction.…”
Section: Geometrical Primitives In the Registration Processmentioning
confidence: 81%
“…Number of points per scan and Gaussian noise can be set individually for every measurement. Point-like data are processed using the total least squares vectorization algorithm [23], providing a set of line segments to be registered with the map. Exactly given poses of the scanner serve for the verification of quality of the registration process.…”
Section: Experimental Verificationmentioning
confidence: 99%
“…Traditional point-eliminating approaches are covered and Douglas-Peucker [19] algorithm), but the main focus is on total least squares (TLS) fitting. There is an implementation of the fast total least squares (FTLS) vectorization [11] and the augmentation [13] for optimization of global error. These fast algorithms are used for extraction of approximation lines in 2D and 3D and for planes in 3D (see Figure 3).…”
Section: Implementation and Architecturementioning
confidence: 99%
“…These algorithms are also what make RTL truly unique among other similar projects. RTL provides an implementation of the fast total least squares (FTLS) vectorization [11] of the ordered point clouds -an optimized algorithm for approximation of ordered data, which provides computational performance similar to the point-eliminating methods [12], while preserving all the benefits of the TLS regression. An augmentation of the previous approach [13] for optimization of global error is present in RTL as well.…”
Section: (1) Overview Introductionmentioning
confidence: 99%
“…The second thing we want to explore is what effect will have different environment parametrization on these conditions. Because as we can see for example in [6,7] the environment structure does not have to always be represented by a point set and by exploiting assumption that the environment can be represented by some lower dimensional parametrization (for example that is composed strictly of planar elements [9]) we can reduce problem dimensionality for the price of adding additional nonlinearity to the edges which are connecting the environment and pose nodes. This can have actually two results either the additional nonlinearity makes the marginalization more difficult or the lower dimensionality will cause central limit theorem to be basically valid sooner and on the contrary makes the marginalization easier.…”
Section: Introductionmentioning
confidence: 99%