This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n6http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n11http://purl.org/net/nknouf/ns/bibtex#
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n25http://linked.opendata.cz/resource/domain/vavai/subjekt/
n22http://linked.opendata.cz/ontology/domain/vavai/
n7http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F11%3A00067229%21RIV14-MSM-14330___/
n18https://schema.org/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n13http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n23http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n24http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F11%3A00067229%21RIV14-MSM-14330___
rdf:type
n22:Vysledek skos:Concept
rdfs:seeAlso
http://www.springerlink.com/content/q82839476621k687/
dcterms: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.
dcterms:title
On Euclidean Metric Approximation via Graph Cuts On Euclidean Metric Approximation via Graph Cuts
skos:prefLabel
On Euclidean Metric Approximation via Graph Cuts On Euclidean Metric Approximation via Graph Cuts
skos:notation
RIV/00216224:14330/11:00067229!RIV14-MSM-14330___
n22:predkladatel
n25:orjk%3A14330
n4:aktivita
n5:P n5:Z n5:S
n4:aktivity
P(2B06052), P(LC535), S, Z(MSM0021622419)
n4:dodaniDat
n24:2014
n4:domaciTvurceVysledku
n12:9465146 n12:8900736
n4:druhVysledku
n20:D
n4:duvernostUdaju
n9:S
n4:entitaPredkladatele
n7:predkladatel
n4:idSjednocenehoVysledku
218014
n4:idVysledku
RIV/00216224:14330/11:00067229
n4:jazykVysledku
n19:eng
n4:klicovaSlova
graph cuts; euclidean metric; anisotropic grids; image segmentation
n4:klicoveSlovo
n10:euclidean%20metric n10:graph%20cuts n10:anisotropic%20grids n10:image%20segmentation
n4:kontrolniKodProRIV
[67E06B49ABA2]
n4:mistoKonaniAkce
Angers
n4:mistoVydani
Berlin, Heidelberg
n4:nazevZdroje
Computer Vision, Imaging and Computer Graphics. Theory and Applications.
n4:obor
n23:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n8:2B06052 n8:LC535
n4:rokUplatneniVysledku
n24:2011
n4:tvurceVysledku
Daněk, Ondřej Matula, Pavel
n4:typAkce
n6:WRD
n4:zahajeniAkce
2010-01-01+01:00
n4:zamer
n15:MSM0021622419
s:issn
1865-0929
s:numberOfPages
11
n13:doi
10.1007/978-3-642-25382-9_9
n11:hasPublisher
Springer-Verlag
n18:isbn
9783642253812
n17:organizacniJednotka
14330