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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A03124635%21RIV07-AV0-21230___
rdf:type
skos:Concept n18:Vysledek
dcterms:description
We introduce a new robust framework suitable for the task of finding correspondences in computer vision. If the problem domain is general enough, the correspondence problem can seldom employ any well-structured prior knowledge. This leads to tasks that have to find maximum cardinality solutions satisfying some weak optimality condition and a set of constraints. To avoid artifacts, robustness is required to cope with decision under occlusion, uncertainty or insufficiency of data and local violations of prior model. The proposed framework is based on a robust modification of graph-theoretic notion known as digraph kernel. Není k dispozici We introduce a new robust framework suitable for the task of finding correspondences in computer vision. If the problem domain is general enough, the correspondence problem can seldom employ any well-structured prior knowledge. This leads to tasks that have to find maximum cardinality solutions satisfying some weak optimality condition and a set of constraints. To avoid artifacts, robustness is required to cope with decision under occlusion, uncertainty or insufficiency of data and local violations of prior model. The proposed framework is based on a robust modification of graph-theoretic notion known as digraph kernel.
dcterms:title
Není k dispozici Robust Correspondence Recognition for Computer Vision Robust Correspondence Recognition for Computer Vision
skos:prefLabel
Robust Correspondence Recognition for Computer Vision Není k dispozici Robust Correspondence Recognition for Computer Vision
skos:notation
RIV/68407700:21230/06:03124635!RIV07-AV0-21230___
n3:strany
119 ; 131
n3:aktivita
n20:P
n3:aktivity
P(1ET101210406)
n3:dodaniDat
n6:2007
n3:domaciTvurceVysledku
n16:8930112
n3:druhVysledku
n15:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
497763
n3:idVysledku
RIV/68407700:21230/06:03124635
n3:jazykVysledku
n17:eng
n3:klicovaSlova
computer vision; digraph kernel; robust matching
n3:klicoveSlovo
n8:computer%20vision n8:robust%20matching n8:digraph%20kernel
n3:kontrolniKodProRIV
[15F2EF91F2A7]
n3:mistoKonaniAkce
Rome
n3:mistoVydani
Heidelberg
n3:nazevZdroje
COMPSTAT 2006: Proceedings in Computational Statistics of 17th ERS-IASC Symposium
n3:obor
n4:JD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n19:1ET101210406
n3:rokUplatneniVysledku
n6:2006
n3:tvurceVysledku
Šára, Radim
n3:typAkce
n11:WRD
n3:zahajeniAkce
2006-08-28+02:00
s:numberOfPages
13
n9:hasPublisher
Physica-verlag
n14:isbn
3-7908-1708-2
n21:organizacniJednotka
21230