About: An Improved Riemannian Metric Approximation for Graph Cuts

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: An Improved Riemannian Metric Approximation for Graph Cuts Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.springerlink.com/content/g64286w402h4v1p6/
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. 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. (en)
Title	An Improved Riemannian Metric Approximation for Graph Cuts An Improved Riemannian Metric Approximation for Graph Cuts (en)
skos:prefLabel	An Improved Riemannian Metric Approximation for Graph Cuts An Improved Riemannian Metric Approximation for Graph Cuts (en)
skos:notation	RIV/00216224:14330/11:00067211!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(2B06052), P(LC535), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Daněk, Ondřej Matula, Pavel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	185487
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00067211
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	graph cuts; metric approximation; Riemannian metrics; image segmentation (en)
http://linked.open.../riv/klicoveSlovo	Riemannian metrics graph cuts image segmentation metric approximation
http://linked.open...ontrolniKodProRIV	[F2901D16D694]
http://linked.open...v/mistoKonaniAkce	Nancy
http://linked.open...i/riv/mistoVydani	Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje	16th International Conference on Discrete Geometry for Computer Imagery
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Determination of markers, screening and early diagnostics of cancer diseases using highly automated processing of multidimensional biomedical images Chromosome dynamics and organization during the cell cycle in normal and pathologic conditions
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Daněk, Ondřej Matula, Pavel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000297039900006
http://linked.open.../riv/zahajeniAkce	2011-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-19867-0_6
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642198663
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 38 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software