Sciweavers

27 search results - page 2 / 6
» Continuously-adaptive discretization for message-passing alg...
Sort
View
ECCV
2008
Springer
14 years 6 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
PDPTA
2007
13 years 6 months ago
A Parallel Algorithm for Discrete Gabor Transforms
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
Kshitij Sudan, Nipun Saggar, Asok De
JMLR
2010
149views more  JMLR 2010»
12 years 11 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
CVPR
2012
IEEE
11 years 7 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
CVPR
2009
IEEE
14 years 12 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...