On Euclidean Metric Approximation via Graph Cuts
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00051516" target="_blank" >RIV/00216224:14330/11:00051516 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/11:00067229
Result on the web
<a href="http://www.springerlink.com/content/q82839476621k687/" target="_blank" >http://www.springerlink.com/content/q82839476621k687/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Euclidean Metric Approximation via Graph Cuts
Original language description
The graph cut framework presents a popular energy minimization tool. In order to be able to minimize contour length dependent energy terms an appropriate metric approximation has to be embedded into the graph such that the cost of every cut approximatesthe length of a corresponding contour under a given metric. Formulas giving a good approximation have been introduced by Boykov and Kolmogorov for both Euclidean and Riemannian metrics. In this paper, we improve their method and obtain a better approximation in case of the Euclidean metric. In our approach, we combine the well-known Cauchy-Crofton formulas with Voronoi diagrams theory to devise a general method with straightforward extension from 2D to 3D space. Our edge weight formulas are invariant tomirroring and directly applicable to grids with anisotropic node spacing.
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
2011
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
Computer Vision, Imaging and Computer Graphics. Theory and Applications.
ISBN
978-3-642-25381-2
ISSN
1865-0929
e-ISSN
—
Number of pages
11
Pages from-to
125-134
Publisher name
Springer-Verlag
Place of publication
Berlin, Heidelberg
Event location
Angers
Event date
Jan 1, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—