Fast total least squares vectorization

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Fast total least squares vectorization

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Fast total least squares vectorization

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

<a href="/cs/project/TE01020197" target="_blank" >TE01020197: Centrum aplikované kybernetiky 3</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název periodika

Journal of Real-Time Image Processing

ISSN

1861-8200

e-ISSN

1861-8219

Svazek periodika

11

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

17

Strana od-do

459-475

Kód UT WoS článku

000464759600014

EID výsledku v databázi Scopus

2-s2.0-84954559462