Ramin Zabih

A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

Fast approximate energy minimization via graph cuts

Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the labels should vary smoothly almost everywhere while p...

Computing visual correspondence with occlusions using graph cuts

Several new algorithms for visual correspondence based on graph cuts [7, 14, 17] have recently been developed. While these methods give very strong results in practice, they do ...

Markov random fields with efficient approximations

Markov Random Fields (MRFs) can be used for a wide variety of vision problems. In this paper we focus on MRFs with two-valued clique potentials, which form a generalized Potts m...

A variable window approach to early vision

Early vision relies heavily on rectangular windows for tasks such as smoothing and computing correspondence. While rectangular windows are efficient, they yield poor results nea...

A New Algorithm for Energy Minimization with Discontinuities