All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Geometric Shape Characterisation Based on a Multi-Sweeping Paradigm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F23%3A43969963" target="_blank" >RIV/49777513:23520/23:43969963 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.mdpi.com/2073-8994/15/6/1212" target="_blank" >https://www.mdpi.com/2073-8994/15/6/1212</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/sym15061212" target="_blank" >10.3390/sym15061212</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Geometric Shape Characterisation Based on a Multi-Sweeping Paradigm

  • Original language description

    The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweeplines having different slopes. The interior shape’s points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape’s characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GF21-08009K" target="_blank" >GF21-08009K: Generalized Symmetries and Equivalences of Geometric Data</a><br>

  • Continuities

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

Others

  • Publication year

    2023

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Symmetry

  • ISSN

    2073-8994

  • e-ISSN

    2073-8994

  • Volume of the periodical

    15

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    15

  • Pages from-to

    1-15

  • UT code for WoS article

    001017821600001

  • EID of the result in the Scopus database

    2-s2.0-85163706628