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”

Normalised diffusion cosine similarity and its use for image segmentation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096742" target="_blank" >RIV/61989100:27240/15:86096742 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=L9hSRTARUnM%3d&t=1" target="_blank" >http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=L9hSRTARUnM%3d&t=1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0005220601210129" target="_blank" >10.5220/0005220601210129</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Normalised diffusion cosine similarity and its use for image segmentation

  • Original language description

    In many image-segmentation algorithms, measuring the distances is a key problem since the distance is often used to decide whether two image points belong to a single or, respectively, to two different image segments. The usual Euclidean distance need not be the best choice. Measuring the distances along the surface that is defined by the image function seems to be more relevant in more complicated images. Geodesic distance, i.e. the shortest path in the corresponding graph, or the k shortest paths canbe regarded as the simplest methods. It might seem that the diffusion distance should provide the properties that are better since all the paths (not only their limited number) are taken into account. In this paper, we firstly show that the diffusion distance has the properties that make it difficult to use it image segmentation, which extends the recent observations of some other authors. Afterwards, we propose a new measure called normalised diffusion cosine similarity that is more sui

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

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

    ICPRAM 2015 - 4th International Conference on Pattern Recognition Applications and Methods, Proceedings

  • ISBN

    978-989-758-076-5

  • ISSN

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    121-129

  • Publisher name

    INSTICC - Institute for Systems and Technologies of Information, Control and Communication

  • Place of publication

    Setubal

  • Event location

    Lisabon

  • Event date

    Jan 10, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article