Sciweavers

40 search results - page 6 / 8
» Efficient Belief Propagation for Early Vision
Sort
View
CVPR
2009
IEEE
16 years 4 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2006
IEEE
15 years 11 months ago
Robust Tracking and Stereo Matching under Variable Illumination
Illumination inconsistencies cause serious problems for classical computer vision applications such as tracking and stereo matching. We present a new approach to model illuminatio...
Jingdan Zhang, Leonard McMillan, Jingyi Yu
CVPR
2008
IEEE
15 years 11 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
CVPR
2009
IEEE
16 years 4 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
CVPR
2008
IEEE
15 years 11 months ago
Visibility in bad weather from a single image
Bad weather, such as fog and haze, can significantly degrade the visibility of a scene. Optically, this is due to the substantial presence of particles in the atmosphere that abso...
Robby T. Tan