About: On Euclidean Metric Approximation via Graph Cuts

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

About: On Euclidean Metric Approximation via 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/q82839476621k687/
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 approximates the 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 to mirroring and directly applicable to grids with anisotropic node spacing. 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 approximates the 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 to mirroring and directly applicable to grids with anisotropic node spacing. (en)
Title	On Euclidean Metric Approximation via Graph Cuts On Euclidean Metric Approximation via Graph Cuts (en)
skos:prefLabel	On Euclidean Metric Approximation via Graph Cuts On Euclidean Metric Approximation via Graph Cuts (en)
skos:notation	RIV/00216224:14330/11:00067229!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	218014
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00067229
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	graph cuts; euclidean metric; anisotropic grids; image segmentation (en)
http://linked.open.../riv/klicoveSlovo	anisotropic grids euclidean metric graph cuts image segmentation
http://linked.open...ontrolniKodProRIV	[67E06B49ABA2]
http://linked.open...v/mistoKonaniAkce	Angers
http://linked.open...i/riv/mistoVydani	Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje	Computer Vision, Imaging and Computer Graphics. Theory and Applications.
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.../riv/zahajeniAkce	2010-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	1865-0929
number of pages	11 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-25382-9_9
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642253812
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