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”

Image segmentation based on electrical proximity in a resistor-capacitor network

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080938" target="_blank" >RIV/61989100:27240/11:86080938 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-23687-7_20" target="_blank" >http://dx.doi.org/10.1007/978-3-642-23687-7_20</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-23687-7_20" target="_blank" >10.1007/978-3-642-23687-7_20</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Image segmentation based on electrical proximity in a resistor-capacitor network

  • Original language description

    Measuring the distances is an important problem in many image-segmentation algorithms. The distance should tell whether two image points belong to a single or, respectively, to two different image segments. The paper deals with the problem of measuring the distance along the manifold that is defined by image. We start from the discussion of difficulties that arise if the geodesic distance, diffusion distance, and some other known metrics are used. Coming from the diffusion equation and inspired by the diffusion distance, we propose to measure the proximity of points as an amount of substance that is transferred in diffusion process. The analogy between the images and electrical circuits is used in the paper, i.e., we measure the proximity as an amountof electrical charge that is transported, during a certain time interval, between two nodes of a resistor-capacitor network. We show how the quantity we introduce can be used in the algorithms for supervised (seeded) and unsupervised imag

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2011

  • 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

    Lecture Notes in Computer Science

  • ISSN

    0302-9743

  • e-ISSN

  • Volume of the periodical

    2011

  • Issue of the periodical within the volume

    6915

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    12

  • Pages from-to

    216-227

  • UT code for WoS article

  • EID of the result in the Scopus database