An Improved Riemannian Metric Approximation for 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%3A00051457" target="_blank" >RIV/00216224:14330/11:00051457 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/11:00067211
Result on the web
<a href="http://www.springerlink.com/content/g64286w402h4v1p6/" target="_blank" >http://www.springerlink.com/content/g64286w402h4v1p6/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An Improved Riemannian Metric Approximation for Graph Cuts
Original language description
Boykov and Kolmogorov showed that it is possible to find globally minimal contours and surfaces via graph cuts by embedding an appropriate metric approximation into the graph edge weights and derived the requisite formulas for Euclidean and Riemannian metrics. In [2] we have proposed an improved Euclidean metric approximation that is invariant under (horizontal and vertical) mirroring, applicable to grids with anisotropic resolution and with a smaller approximation error. In this paper, we extend our method to general Riemannian metrics that are essential for graph cut based image segmentation or stereo matching. It is achieved by the introduction of a transformation reducing the Riemannian case to the Euclidean one and adjusting the formulas from [9]to be able to cope with non-orthogonal grids. We demonstrate that the proposed method yields smaller approximation errors than the previous approaches both in theory and practice.
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
16th International Conference on Discrete Geometry for Computer Imagery
ISBN
978-3-642-19866-3
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
71-82
Publisher name
Springer-Verlag
Place of publication
Berlin, Heidelberg
Event location
Nancy
Event date
Jan 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000297039900006