Title: Line segment similarity criterion for vector images
Authors: Jelínek, Aleš
Žalud, Luděk
Citation: WSCG '2017: short communications proceedings: The 25th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2016 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech RepublicMay 29 - June 2 2017, p. 73-79.
Issue Date: 2017
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
conferenceObject
URI: wscg.zcu.cz/WSCG2017/!!_CSRN-2702.pdf
http://hdl.handle.net/11025/29737
ISBN: 978-80-86943-45-9
ISSN: 2464-4617
Keywords: vektor;úsečka;podobnost;vzdálenost;kritérium
Keywords in different language: vector;line segment;similarity;distance;criterion
Abstract: 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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2017: Short Papers Proceedings

Files in This Item:
File Description SizeFormat 
Jelinek.pdfPlný text1,11 MBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/29737

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.