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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n11http://purl.org/net/nknouf/ns/bibtex#
n3http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
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/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F07%3A03135475%21RIV08-AV0-21230___/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F07%3A03135475%21RIV08-AV0-21230___
rdf:type
n4:Vysledek skos:Concept
dcterms:description
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible correspondences, whose edges capture the structure of the constraints and whose edge orientation represents pairwise comparison 'is better' based on correspondence quality, including the uncertainty of this comparison. We show SIS possess properties of both robustness and weak optimality. The main contribution of this paper is algorithmic speedup that results from exploiting the dependence between the standard uniqueness constraint and the parametric constraint. The general theory is demonstrated on the example of image stitching using homography model. The algorithm needs at most kN^2 calls of a procedure testing if two ellipse correspondences are consistent with a general homography. The previous known SIS algorithm needed $O(N^4)$ tests. The method gives good results and is fast in practice with k ~ 0.3. We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible correspondences, whose edges capture the structure of the constraints and whose edge orientation represents pairwise comparison 'is better' based on correspondence quality, including the uncertainty of this comparison. We show SIS possess properties of both robustness and weak optimality. The main contribution of this paper is algorithmic speedup that results from exploiting the dependence between the standard uniqueness constraint and the parametric constraint. The general theory is demonstrated on the example of image stitching using homography model. The algorithm needs at most kN^2 calls of a procedure testing if two ellipse correspondences are consistent with a general homography. The previous known SIS algorithm needed $O(N^4)$ tests. The method gives good results and is fast in practice with k ~ 0.3. We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible correspondences, whose edges capture the structure of the constraints and whose edge orientation represents pairwise comparison 'is better' based on correspondence quality, including the uncertainty of this comparison. We show SIS possess properties of both robustness and weak optimality. The main contribution of this paper is algorithmic speedup that results from exploiting the dependence between the standard uniqueness constraint and the parametric constraint. The general theory is demonstrated on the example of image stitching using homography model. The algorithm needs at most kN^2 calls of a procedure testing if two ellipse correspondences are consistent with a general homography. The previous known SIS algorithm needed $O(N^4)$ tests. The method gives good results and is fast in practice with k ~ 0.3.
dcterms:title
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
skos:prefLabel
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
skos:notation
RIV/68407700:21230/07:03135475!RIV08-AV0-21230___
n5:strany
Nečíslováno
n5:aktivita
n21:P
n5:aktivity
P(1ET101210406)
n5:dodaniDat
n8:2008
n5:domaciTvurceVysledku
n10:6479243 n10:8930112
n5:druhVysledku
n15:D
n5:duvernostUdaju
n7:S
n5:entitaPredkladatele
n20:predkladatel
n5:idSjednocenehoVysledku
408158
n5:idVysledku
RIV/68407700:21230/07:03135475
n5:jazykVysledku
n14:eng
n5:klicovaSlova
computer vision; graph stablity; matching; stereo
n5:klicoveSlovo
n6:stereo n6:computer%20vision n6:matching n6:graph%20stablity
n5:kontrolniKodProRIV
[DFE9C2496E19]
n5:mistoKonaniAkce
Rio de Janeiro
n5:mistoVydani
Madison
n5:nazevZdroje
ICCV 2007: Proceedings of Eleventh IEEE International Conference on Computer Vision
n5:obor
n13:JD
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:projekt
n18:1ET101210406
n5:rokUplatneniVysledku
n8:2007
n5:tvurceVysledku
Šára, Radim Bujňák, Martin
n5:typAkce
n16:WRD
n5:zahajeniAkce
2007-10-14+02:00
s:numberOfPages
8
n11:hasPublisher
Omnipress
n19:isbn
978-1-4244-1630-1
n3:organizacniJednotka
21230