Robust Correspondence Recognition for Computer Vision

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03124635" target="_blank" >RIV/68407700:21230/06:03124635 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Robust Correspondence Recognition for Computer Vision
Original language 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.
Czech name
Není k dispozici
Czech description
Není k dispozici

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
2006
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
COMPSTAT 2006: Proceedings in Computational Statistics of 17th ERS-IASC Symposium
ISBN
3-7908-1708-2
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
119-131
Publisher name
Physica-verlag
Place of publication
Heidelberg
Event location
Rome
Event date
Aug 28, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)