Resistance-geodesic distance and its use in image processing and segmentation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092202" target="_blank" >RIV/61989100:27240/14:86092202 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-14249-4_23" target="_blank" >http://dx.doi.org/10.1007/978-3-319-14249-4_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-14249-4_23" target="_blank" >10.1007/978-3-319-14249-4_23</a>

Result language
angličtina
Original language name
Resistance-geodesic distance and its use in image processing and segmentation
Original language description
In many clustering and image-segmentation algorithms, measuring distances is used to decide whether two image points belong to a single or, respectively, to two different image segments. In more complicated images, measuring the distances along the surface that is defined by the image function may be more relevant than the Euclidean distance. The geodesic distance, i.e. the shortest path in the corresponding graph, has become popular. The problem is that it is determined on the basis of only one path that can arise accidentally as a result of imperfections in image. Using the k shortest paths solves the problem only partially since more than one path can arise accidentally too. In this paper, we introduce the resistance-geodesic distance with the goalto reduce the possibility that a false accidental path will be used for computing. Firstly, the effective conductance is computed for each pair of neighbouring nodes to determine the local width of the path that could run through the arc
Czech name
—
Czech description
—

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

Similar results(10)