Resistance-Geodesic Distance and Its Use in Image Segmentation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86100047" target="_blank" >RIV/61989100:27240/16:86100047 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1142/S0218213016400029" target="_blank" >http://dx.doi.org/10.1142/S0218213016400029</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218213016400029" target="_blank" >10.1142/S0218213016400029</a>

Result language

angličtina

Original language name

Resistance-Geodesic Distance and Its Use in Image Segmentation

Original language description

Measuring the distance is an important task in many clustering and image-segmentation algorithms. The value of the distance decides whether two image points belong to a single or, respectively, to two different image segments. The Euclidean distance is used quite often. In more complicated cases, measuring the distances along the surface that is defined by the image function may be more appropriate. The geodesic distance, i.e. the shortest path in the corresponding graph, has become popular in this context. The problem is that it is determined on the basis of only one path that can be viewed as infinitely thin and that can arise accidentally as a result of imperfections in the image. Considering the k shortest paths can be regarded as an effort towards the measurement of the distance that is more reliable. The drawback remains that measuring the distance along several paths is burdened with the same problems as the original geodesic distance. Therefore, it does not guarantee significantly better results. In addition to this, the approach is computationally demanding. This paper introduces the resistance-geodesic distance with the goal to reduce the possibility of using a false accidental path for measurement. The approach can be briefly characterised in such a way that the path of a certain chosen width is sought for, which is in contrast to the geodesic distance. Firstly, the effective conductance is computed for each pair of the neighbouring nodes to determine the local width of the path that could possibly run through the arc connecting them. The width computed in this way is then used for determining the costs of arcs; the arcs whose use would lead to a small width of the final path are penalised. The usual methods for computing the shortest path in a graph are then used to compute the final distances. The corresponding theory and the experimental results are presented in this paper.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2016

Confidentiality

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

Name of the periodical

International Journal on Artificial Intelligence Tools

ISSN

0218-2130

e-ISSN

—

Volume of the periodical

25

Issue of the periodical within the volume

5

Country of publishing house

SG - SINGAPORE

Number of pages

16

Pages from-to

1-16

UT code for WoS article

000384410200003

EID of the result in the Scopus database

—