[IPOL announce] new preprint: Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm
announcements about the IPOL journal
announce at list.ipol.im
Fri Jun 21 12:11:53 CEST 2013
A new preprint is available in IPOL: http://www.ipol.im/pub/pre/97/
Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm
by Vladimir Kolmogorov, Pascal Monasse, Pauline Tan
Abstract
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).
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://tools.ipol.im/mailman/archive/announce/attachments/20130621/51efaf27/attachment.html>
More information about the announce
mailing list