About: A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en) 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. (cs)
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 (en) A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching (cs)
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 (en) A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching (cs)
skos:notation	RIV/68407700:21230/07:03135475!RIV08-AV0-21230___
http://linked.open.../vavai/riv/strany	Nečíslováno
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1ET101210406)
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Bujňák, Martin Šára, Radim
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	408158
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/07:03135475
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	computer vision; graph stablity; matching; stereo (en)
http://linked.open.../riv/klicoveSlovo	computer vision matching stereo graph stablity
http://linked.open...ontrolniKodProRIV	[DFE9C2496E19]
http://linked.open...v/mistoKonaniAkce	Rio de Janeiro
http://linked.open...i/riv/mistoVydani	Madison
http://linked.open...i/riv/nazevZdroje	ICCV 2007: Proceedings of Eleventh IEEE International Conference on Computer Vision
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Automatic 3D Virtual Model Builder from Photographs
http://linked.open...UplatneniVysledku	2007
http://linked.open...iv/tvurceVysledku	Bujňák, Martin Šára, Radim
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2007-10-14 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Omnipress
https://schema.org/isbn	978-1-4244-1630-1
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software