<html> <head> <meta content="text/html; charset=windows-1252" http-equiv="Content-Type"> </head> <body bgcolor="#FFFFFF" text="#000000"> A new preprint is available in IPOL: <a class="moz-txt-link-freetext" href="http://www.ipol.im/pub/pre/82/">http://www.ipol.im/pub/pre/97/</a> Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm by <meta charset="utf-8"> Vladimir Kolmogorov, Pascal Monasse, Pauline Tan Abstract <meta charset="utf-8"> Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes Kolmogorov and Zabih’s method, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement). </body> </html>