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

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

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n13https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F07%3A03135200%21RIV09-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F07%3A03135200%21RIV09-MSM-21230___
rdf:type
skos:Concept n18:Vysledek
dcterms:description
In stereo literature, there is no standard method for evaluating algorithms for semi-dense stereo matching. Moreover, existing evaluations for dense methods require a fixed parameter setting for the tested algorithms. In this paper, we propose a method that overcomes these drawbacks and still is able to compare algorithms based on a simple numerical value, so that reporting results does not take up much space in a paper. We propose evaluation of stereo algorithms based on Receiver Operating Characteristics (ROC) which captures both errors and sparsity. By comparing ROC curves of all tested algorithms we obtain the Feasibility Boundary, the best possible performance achieved by a set of tested stereo algorithms, which allows stereo algorithm users to select the proper method and parameter setting for a required application. In stereo literature, there is no standard method for evaluating algorithms for semi-dense stereo matching. Moreover, existing evaluations for dense methods require a fixed parameter setting for the tested algorithms. In this paper, we propose a method that overcomes these drawbacks and still is able to compare algorithms based on a simple numerical value, so that reporting results does not take up much space in a paper. We propose evaluation of stereo algorithms based on Receiver Operating Characteristics (ROC) which captures both errors and sparsity. By comparing ROC curves of all tested algorithms we obtain the Feasibility Boundary, the best possible performance achieved by a set of tested stereo algorithms, which allows stereo algorithm users to select the proper method and parameter setting for a required application. In stereo literature, there is no standard method for evaluating algorithms for semi-dense stereo matching. Moreover, existing evaluations for dense methods require a fixed parameter setting for the tested algorithms. In this paper, we propose a method that overcomes these drawbacks and still is able to compare algorithms based on a simple numerical value, so that reporting results does not take up much space in a paper. We propose evaluation of stereo algorithms based on Receiver Operating Characteristics (ROC) which captures both errors and sparsity. By comparing ROC curves of all tested algorithms we obtain the Feasibility Boundary, the best possible performance achieved by a set of tested stereo algorithms, which allows stereo algorithm users to select the proper method and parameter setting for a required application.
dcterms:title
Feasibility Boundary in Dense and Semi-Dense Stereo Matching Feasibility Boundary in Dense and Semi-Dense Stereo Matching Feasibility Boundary in Dense and Semi-Dense Stereo Matching
skos:prefLabel
Feasibility Boundary in Dense and Semi-Dense Stereo Matching Feasibility Boundary in Dense and Semi-Dense Stereo Matching Feasibility Boundary in Dense and Semi-Dense Stereo Matching
skos:notation
RIV/68407700:21230/07:03135200!RIV09-MSM-21230___
n4:aktivita
n16:R n16:P
n4:aktivity
P(1ET101210406), R
n4:dodaniDat
n10:2009
n4:domaciTvurceVysledku
n17:8930112 n17:9680411 n17:7610203
n4:druhVysledku
n11:D
n4:duvernostUdaju
n20:S
n4:entitaPredkladatele
n9:predkladatel
n4:idSjednocenehoVysledku
421772
n4:idVysledku
RIV/68407700:21230/07:03135200
n4:jazykVysledku
n7:eng
n4:klicovaSlova
ROC; algorithm; boundary; density; error; evaluation; feasibility; matching; parameters; rate; semi-dense; sparsity; stereo
n4:klicoveSlovo
n6:rate n6:parameters n6:feasibility n6:algorithm n6:evaluation n6:density n6:stereo n6:matching n6:ROC n6:boundary n6:error n6:semi-dense n6:sparsity
n4:kontrolniKodProRIV
[5C9BAEAD1AB0]
n4:mistoKonaniAkce
Minneapolis
n4:mistoVydani
Los Alamitos
n4:nazevZdroje
CVPR 2007: Proceedings of the Computer Vision and Pattern Recognition conference
n4:obor
n21:JD
n4:pocetDomacichTvurcuVysledku
3
n4:pocetTvurcuVysledku
3
n4:projekt
n15:1ET101210406
n4:rokUplatneniVysledku
n10:2007
n4:tvurceVysledku
Kostlivá, Jana Čech, Jan Šára, Radim
n4:typAkce
n5:WRD
n4:zahajeniAkce
2007-06-18+02:00
s:issn
1053-587X
s:numberOfPages
8
n14:hasPublisher
IEEE Computer Society
n13:isbn
1-4244-1180-7
n19:organizacniJednotka
21230