Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Fast Approximate Energy Minimization via Graph Cuts

- Yuri Boykov, Olga Veksler, R. Zabih
- Computer Science
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1 November 2001

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 preserving sharp… Expand

Fast approximate energy minimization via graph cuts

- Yuri Boykov, Olga Veksler, R. Zabih
- Computer Science
- Proceedings of the Seventh IEEE International…
- 1999

In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothness term must only involve… Expand

A taxonomy and evaluation of dense two-frame stereo correspondence algorithms

- D. Scharstein, R. Szeliski, R. Zabih
- Proceedings IEEE Workshop on Stereo and Multi…
- 2001

Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little work has been done on… Expand

What Energy Functions Can Be Minimized via Graph Cuts?

- V. Kolmogorov, R. Zabih
- Computer Science
- IEEE Trans. Pattern Anal. Mach. Intell.
- 2004

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that… Expand

Image indexing using color correlograms

- Jing Huang, Ravi Kumar, M. Mitra, Wei-Jing Zhu, R. Zabih
- Computer Science
- Proceedings of IEEE Computer Society Conference…
- 17 June 1997

We define a new image feature called the color correlogram and use it for image indexing and comparison. This feature distills the spatial correlation of colors, and is both effective and inexpensive… Expand

Non-parametric Local Transforms for Computing Visual Correspondence

- R. Zabih, J. Woodfill
- Computer Science
- ECCV
- 7 May 1994

We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms rely on the relative ordering… Expand

Computing visual correspondence with occlusions using graph cuts

- V. Kolmogorov, R. Zabih
- Computer Science
- Proceedings Eighth IEEE International Conference…
- 7 March 2001

Several new algorithms for visual correspondence based on graph cuts have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly.… Expand

What energy functions can be minimized via graph cuts?

- V. Kolmogorov, R. Zabih
- Computer Science, Medicine
- IEEE Transactions on Pattern Analysis and Machine…
- 28 May 2002

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that… Expand

Multi-camera Scene Reconstruction via Graph Cuts

- V. Kolmogorov, R. Zabih
- Computer Science
- ECCV
- 28 May 2002

We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural generalization of the… Expand

A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors

- R. Szeliski, R. Zabih, +5 authors C. Rother
- Computer Science, Medicine
- IEEE Transactions on Pattern Analysis and Machine…
- 1 June 2008

Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation. It has been known… Expand