Ayman Zureiki

Learn More
Some recent stereo matching algorithms are based on graph cuts. They transform the matching problem to a minimisation of a global energy function. The minimisation can be done by finding out an optimal cut in a special graph. Different methods were proposed to construct the graph. But all of them, consider for each pixel, all possible disparities between(More)
Simultaneous Localization and Mapping (SLAM) has been studied a lot since 20 years in the robotics community: a SLAM method copes with the incremental construction of a geometrical model from the successive fusion of observations acquired from moving sensors. When sensors are embedded on a mobile robot, robot localization and environment mapping must be(More)
The stereo matching aims to find corresponding entities between two (or more) images, i.e. entities that are projections of the same 3D object in the scene. Constraints used in stereo matching can be classified into two categories: local constraints, which rely only on a pixel and on some pixels in its surrounding, and global constraints, which must be(More)
  • 1