Authors: | Rosin, Paul Žunić, Joviša |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | Measuring convexity via convex polygons | Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Volume: | 9555 | First page: | 38 | Last page: | 47 | Issue Date: | 1-Jan-2016 | Rank: | M33 | ISBN: | 978-3-319-30284-3 | ISSN: | 0302-9743 | DOI: | 10.1007/978-3-319-30285-0_4 | Abstract: | This paper describes a general approach to compute a family of convexity measures. Inspired by the use of geometric primitives (such as circles) which are often fitted to shapes to approximate them, we use convex polygons for this task. Convex polygons can be generated in many ways, and several are demonstrated here. These polygons are scaled and translated to ensure that they fit the input shape and produce a meaningful convexity measure. Subsequently, a convexity measure can be computed based on the degree of overlap between the two shapes. |
Keywords: | Classification | Convexity | Shape measure | Publisher: | Springer Link | Project: | Advanced Techniques of Cryptology, Image Processing and Computational Topology for Information Security Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education |
Show full item record
SCOPUSTM
Citations
1
checked on Dec 20, 2024
Page view(s)
30
checked on Dec 22, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.