The k-max distance in graphs and images

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10238511" target="_blank" >RIV/61989100:27240/17:10238511 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0167865517303148" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0167865517303148</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.patrec.2017.09.003" target="_blank" >10.1016/j.patrec.2017.09.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The k-max distance in graphs and images

Popis výsledku v původním jazyce

In this paper, we propose a new distance called the k-max distance that is intended for graphs and images. The length of a path is defined as the sum of the k maximum arc weights along the path. The distance between two nodes is the length of the shortest path between them. We show that the k-max distance is a metric. The algorithm for computing the k-max distance is presented. Certain positive properties of the k-max distance are shown, namely in the context of measuring the distances for image segmentation. The comparison with the geodesic distance, the max-arc distance, the minimum barrier distance, and the random walker technique is carried out in the segmentation of real-life images.

Název v anglickém jazyce

The k-max distance in graphs and images

Popis výsledku anglicky

In this paper, we propose a new distance called the k-max distance that is intended for graphs and images. The length of a path is defined as the sum of the k maximum arc weights along the path. The distance between two nodes is the length of the shortest path between them. We show that the k-max distance is a metric. The algorithm for computing the k-max distance is presented. Certain positive properties of the k-max distance are shown, namely in the context of measuring the distances for image segmentation. The comparison with the geodesic distance, the max-arc distance, the minimum barrier distance, and the random walker technique is carried out in the segmentation of real-life images.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

Pattern Recognition Letters

ISSN

0167-8655

e-ISSN

—

Svazek periodika

98

Číslo periodika v rámci svazku

15 October 2017

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

7

Strana od-do

103-109

Kód UT WoS článku

000323710900011

EID výsledku v databázi Scopus

2-s2.0-85029146508