@InProceedings{Kostkova-SCIA2003,
  IS = { zkontrolovano 05 Dec 2003 },
  UPDATE  = { 2003-07-10 },
author = {Kostkov{\'a}, Jana and {\v C}ech, Jan and {\v S}{\'a}ra, Radim},
title = {Dense Stereomatching Algorithm Performance for View Prediction
        and Structure Reconstruction},
  booktitle =    { SCIA 2003: Proceedings of the 13th Scandinavian
                   Conference on Image Analysis },
book_pages  = { 1174 },
publisher   = { Springer-Verlag },
organization = {},
address     = { Berlin, Germany },
pages       = { 101-107 },
year = {2003},
month = {June},
day = {29},
venue = {G{\"o}teborg, Sweden},
isbn        = { 3-540-40601-8 },
project = {GACR 102/01/1371, CTU 0306413, MSM 212300013},
annote = {The knowledge of stereo matching algorithm properties and
behaviour under varying conditions is crucial for the selection of a
proper method for the desired application. In this paper we study the
behaviour of four representative matching algorithms under varying
signal-to-noise ratio in six types of error statistics. The errors are
focused on basic matching failure mechanisms and their definition
observes the principles of independence, symmetry and completeness. A
ground truth experiment shows that the best choice for view prediction
is the Graph Cuts algorithm and for structure reconstruction it is the
Confidently Stable Matching.},
keywords = {performance evaluation, stereoscopic vision},
psurl = {},
autorship = { 33-34-33 },
editor      = { Bigun, Josef and Gustavsson, Tomas },
series      = { Lecture Notes in Computer Science },
number      = { 2749 },
}