Fast total least squares vectorization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26620%2F19%3APU117512" target="_blank" >RIV/00216305:26620/19:PU117512 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s11554-016-0562-6" target="_blank" >https://link.springer.com/article/10.1007/s11554-016-0562-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11554-016-0562-6" target="_blank" >10.1007/s11554-016-0562-6</a>

Result language
angličtina
Original language name
Fast total least squares vectorization
Original language description
This paper proposes a novel algorithm for the vectorization of ordered sets of points, named Fast Total Least Squares (FTLS) vectorization. The emphasis was put on low computational complexity, which allows it to be run online on a mobile device at a speed comparable to the fastest algorithms, such as the Douglas–Peucker (DP) algorithm, while maintaining a much higher quality of the approximation. Our approach is based on the total least squares method, therefore all the points from the cloud contribute to its approximation. This leads to better utilization of the information contained in the point cloud, compared to those algorithms based on point elimination, such as DP. Several experiments and performance comparisons are presented to demonstrate the most important attributes of the FTLS algorithm.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering

Project
<a href="/en/project/TE01020197" target="_blank" >TE01020197: Centre for Applied Cybernetics 3</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)