1957 search results - page 187 / 392 » Approximate algorithms for neural-Bayesian approaches |
CVPR
2004
IEEE
16 years 4 days ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
90
Voted
CVPR
2005
IEEE
16 years 4 days ago
2005
IEEE
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...
103
click to vote
NIPS
1997
14 years 11 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
IR
2010
14 years 8 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
CVPR
2005
IEEE
16 years 4 days ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...