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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03135475" target="_blank" >RIV/68407700:21230/07:03135475 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language 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 andwhose 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.

Czech name

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

Czech 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 andwhose 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.

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/1ET101210406" target="_blank" >1ET101210406: Automatic 3D Virtual Model Builder from Photographs</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

ICCV 2007: Proceedings of Eleventh IEEE International Conference on Computer Vision

ISBN

978-1-4244-1630-1

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

—

Publisher name

Omnipress

Place of publication

Madison

Event location

Rio de Janeiro

Event date

Oct 14, 2007

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—