#### Filter Results:

- Full text PDF available (90)

#### Publication Year

1986

2017

- This year (3)
- Last 5 years (20)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Yuri Boykov, Olga Veksler, Ramin Zabih
- IEEE Trans. Pattern Anal. Mach. Intell.
- 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 pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is… (More)

- Vladimir Kolmogorov, Ramin Zabih
- IEEE Transactions on Pattern Analysis and Machine…
- 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 the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function,… (More)

- Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih
- CVPR
- 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 for content-based image retrieval. The correlogramrobustly tolerates large changes in appearance and shape caused by changes in viewing positions, camera… (More)

- Ramin Zabih, John Woodfill
- ECCV
- 1994

We propose a new approach to the correspondence prob lem that makes use of non parametric local transforms as the basis for correlation Non parametric local transforms rely on the relative order ing of local intensity values and not on the intensity values themselves Correlation using such transforms can tolerate a signi cant number of outliers This can… (More)

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 not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image.… (More)

- Vladimir Kolmogorov, Ramin Zabih
- ECCV
- 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 stereo matching problem. However, it is much more difficult than stereo, primarily due to the difficulty of reasoning about visibility. In this paper, we take… (More)

- Richard Szeliski, Ramin Zabih, +5 authors Carsten Rother
- IEEE Transactions on Pattern Analysis and Machine…
- 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 for decades that such problems can be elegantly expressed as Markov random fields, yet the resulting energy minimization problems have been widely viewed as… (More)

- Greg Pass, Ramin Zabih, Justin Miller
- ACM Multimedia
- 1996

Color histograms are used to compare images in many applications. Their advantages are efficiency, and insensitivity to small changes in camera viewpoint. However, color histograms lack spatial information, so images with very different appearances can have similar histograms. For example, a picture of fall foliage might contain a large number of scattered… (More)

- Yuri Boykov, Olga Veksler, Ramin Zabih
- CVPR
- 1998

Markov Random Fields (MRF’s) can be used for a wide variety of vision problems. In this paper we focus on MRF’s with two-valued clique potentials, which form a generalized Potts model. We show that the maximum a posteriori estimate of such an MRF can be obtained by solving a multiway minimum cut problem on a graph. We develop efficient algorithms for… (More)

- Greg Pass, Ramin Zabih
- WACV
- 1996

Color histograms are widely used for content-based image retrieval. Their advantages are efficiency, and insensitivity to small changes in camera viewpoint. However, a histogram is a coarse characterization of an image, and so images with very different appearances can have similar histograms. We describe a technique for comparing images called histogram… (More)