Sciweavers

33 search results - page 4 / 7
» Finding the global minimum for binary image restoration
Sort
View
ECCV
2002
Springer
14 years 9 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
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...
Vladimir Kolmogorov, Ramin Zabih
PAMI
2010
207views more  PAMI 2010»
13 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
CVPR
2010
IEEE
14 years 4 months ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth
TIP
2002
126views more  TIP 2002»
13 years 7 months ago
Template matching based object recognition with unknown geometric parameters
In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image r...
Roger M. Dufour, Eric L. Miller, Nikolas P. Galats...
IMAGING
2001
13 years 9 months ago
Spherical Sampling and Color Transformations
In this paper, we present a spherical sampling technique that can be employed to find optimal sensors for trichromatic color applications. The advantage over other optimization te...
Graham D. Finlayson, Sabine Süsstrunk