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. © Springer-Verlag 2003.
CITATION STYLE
Kostková, J., Čech, J., & Šára, R. (2003). Dense stereomatching algorithm performance for view prediction and structure reconstruction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2749, 101–107. https://doi.org/10.1007/3-540-45103-x_14
Mendeley helps you to discover research relevant for your work.