All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids

The result's identifiers

  • Result code in 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>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    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

Others

  • Publication year

    2010

  • 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

  • Article name in the collection

    VISAPP International Conference on Computer Vision Theory and Applications

  • ISBN

    978-989-674-029-0

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    Institute for Systems and Technologies of Information, Control and Communication

  • Place of publication

    Portugal

  • Event location

    Angers

  • Event date

    May 17, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article