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”

Labyrinth arrangement analysis based on image processing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F15%3A39899508" target="_blank" >RIV/00216275:25530/15:39899508 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-19824-8_25" target="_blank" >http://dx.doi.org/10.1007/978-3-319-19824-8_25</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-19824-8_25" target="_blank" >10.1007/978-3-319-19824-8_25</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Labyrinth arrangement analysis based on image processing

  • Original language description

    The approach described in this paper has been developed as a supporting tool for practical exercises based on a teaching aid; however, its application is far from being limited to be used only in the education process. The main task of the approach is extraction of information about structure of a working environment from color images and its transformation to an appropriate form suitable for path-planning. The working environment considered in this paper is a labyrinth. Since the information is to be used further by path-planning, its expression in the form of a graph is required, or, more precisely, the adjacency matrix is required as the output. The transformation of the real world into a discreet representation is based on the exact cell decomposition in this approach. The approach employs the well-known image processing algorithms; however, the procedure of the labyrinth layout analysis as well as the transformation of the acquired information into the adjacency matrix has been de

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • 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

  • Article name in the collection

    Mendel 2015: Recent Advances in Soft Computing

  • ISBN

    978-3-319-19823-1

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    305-316

  • Publisher name

    Springer

  • Place of publication

    Dordrecht

  • Event location

    Brno

  • Event date

    Jun 23, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article