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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F05%3A00114015%21RIV10-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F05%3A00114015%21RIV10-MSM-21230___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
In this paper we propose a fast algorithm for disparity component tracing for Stratified Dense Matching approach. The algorithm is based on the approximation using convolution and speed up the tracing process about 100x, while the whole algorithm in average about 74x, as measured on various benchmark images. On a rigorous ground-truth experiment we study properties of the new algorithm in comparison with the original version. Finally, we show results on standard benchmark datasets, as well as on complex outdoor scenes. In this paper we propose a fast algorithm for disparity component tracing for Stratified Dense Matching approach. The algorithm is based on the approximation using convolution and speed up the tracing process about 100x, while the whole algorithm in average about 74x, as measured on various benchmark images. On a rigorous ground-truth experiment we study properties of the new algorithm in comparison with the original version. Finally, we show results on standard benchmark datasets, as well as on complex outdoor scenes.
dcterms:title
Fast Disparity Components Tracing Algorithm for Stratified Dense Matching Approach Fast Disparity Components Tracing Algorithm for Stratified Dense Matching Approach
skos:prefLabel
Fast Disparity Components Tracing Algorithm for Stratified Dense Matching Approach Fast Disparity Components Tracing Algorithm for Stratified Dense Matching Approach
skos:notation
RIV/68407700:21230/05:00114015!RIV10-MSM-21230___
n3:aktivita
n9:P n9:V
n3:aktivity
P(1ET101210406), V
n3:dodaniDat
n7:2010
n3:domaciTvurceVysledku
n11:7610203 n11:8930112
n3:druhVysledku
n4:O
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
521404
n3:idVysledku
RIV/68407700:21230/05:00114015
n3:jazykVysledku
n16:eng
n3:klicovaSlova
computer vision; stereoscopic matching
n3:klicoveSlovo
n13:computer%20vision n13:stereoscopic%20matching
n3:kontrolniKodProRIV
[F734F08479A4]
n3:obor
n5:JD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n10:1ET101210406
n3:rokUplatneniVysledku
n7:2005
n3:tvurceVysledku
Šára, Radim Kostková, Jana
n12:organizacniJednotka
21230