Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
JELÍNEK, A. ŽALUD, L.
Originální název
Line segment similarity criterion for vector images
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
Vector representation of the images, maps, schematics and other information is widely used, and in computer processing of these data, comparison and similarity evaluation of two sets of line segments is often necessary. Various techniques are already in use, but these mostly rely on the algorithmic functions such as minimum/maximum of two or more variables, which limits their applicability for many optimization algorithms. In this paper we propose a novel area based criterion function for line segment similarity evaluation, which is easily differentiable and the derivatives are continuous in the whole domain of definition. The second important feature is the possibility of preprocessing of the input data. Once finished, it takes constant time to evaluate the criterion for different transformations of one of the input sets of line segments. This has potential to greatly speed up iterative matching algorithms. In such case, the computational complexity is reduced from O(pt) to O(p+t), where p is the number of line segment pairs being examined and t is the number of transformations performed.
Klíčová slova
Vector;Line Segment;Similarity;Distance;Criterion
Autoři
JELÍNEK, A.; ŽALUD, L.
Vydáno
1. 6. 2017
Místo
Plzeň
ISBN
978-80-86943-45-9
Kniha
Computer Science Research Notes
Edice
1
ISSN
2464-4617
Periodikum
Stát
Česká republika
Strany od
73
Strany do
79
Strany počet
7
URL
https://dspace5.zcu.cz/handle/11025/29737
BibTex
@inproceedings{BUT138191, author="Aleš {Jelínek} and Luděk {Žalud}", title="Line segment similarity criterion for vector images", booktitle="Computer Science Research Notes", year="2017", series="1", journal="Computer Science Research Notes", pages="73--79", address="Plzeň", isbn="978-80-86943-45-9", issn="2464-4617", url="https://dspace5.zcu.cz/handle/11025/29737" }