Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F10%3A00043276" target="_blank" >RIV/00216224:14330/10:00043276 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids

Popis výsledku v původním jazyce

Graph cuts can be used to find globally minimal contours and surfaces in 2D and 3D space, respectively. To achieve this, weights of the edges in the graph are set so the capacity of the cut approximates the contour length or surface area under chosen metric. Formulas giving good approximation in the case of the Euclidean metric are known, however, they assume isotropic resolution of the underlying grid of pixels or voxels. Anisotropy has to be simulated using more general Riemannian metrics. In this paper we show how to circumvent this and obtain a good approximation of the Euclidean metric on anisotropic grids directly by exploiting the well-known Cauchy-Crofton formulas and Voronoi diagrams theory. Furthermore, we show that our approach yields much smaller metrication errors and most interestingly, it is in particular situations better even in the isotropic case due to its invariance to mirroring. Finally, we demonstrate an application of the derived formulas to biomedical image segm

Název v anglickém jazyce

Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids

Popis výsledku anglicky

Graph cuts can be used to find globally minimal contours and surfaces in 2D and 3D space, respectively. To achieve this, weights of the edges in the graph are set so the capacity of the cut approximates the contour length or surface area under chosen metric. Formulas giving good approximation in the case of the Euclidean metric are known, however, they assume isotropic resolution of the underlying grid of pixels or voxels. Anisotropy has to be simulated using more general Riemannian metrics. In this paper we show how to circumvent this and obtain a good approximation of the Euclidean metric on anisotropic grids directly by exploiting the well-known Cauchy-Crofton formulas and Voronoi diagrams theory. Furthermore, we show that our approach yields much smaller metrication errors and most interestingly, it is in particular situations better even in the isotropic case due to its invariance to mirroring. Finally, we demonstrate an application of the derived formulas to biomedical image segm

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

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 statě ve sborníku

VISAPP International Conference on Computer Vision Theory and Applications

ISBN

978-989-674-029-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

—

Název nakladatele

Institute for Systems and Technologies of Information, Control and Communication

Místo vydání

Portugal

Místo konání akce

Angers

Datum konání akce

17. 5. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—