The k-max distance in graphs and images
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
The k-max distance in graphs and images
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
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
Pattern Recognition Letters
ISSN
0167-8655
e-ISSN
—
Volume of the periodical
98
Issue of the periodical within the volume
15 October 2017
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
103-109
UT code for WoS article
000323710900011
EID of the result in the Scopus database
2-s2.0-85029146508