Sciweavers

2869 search results - page 208 / 574
» The Inference Problem: A Survey
Sort
View
EXPCS
2007
15 years 8 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne
ICCV
2009
IEEE
16 years 9 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
CVPR
2004
IEEE
16 years 6 months ago
Gibbs Likelihoods for Bayesian Tracking
Bayesian methods for visual tracking model the likelihood of image measurements conditioned on a tracking hypothesis. Image measurements may, for example, correspond to various fi...
Stefan Roth, Leonid Sigal, Michael J. Black
ECCV
2006
Springer
16 years 6 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
ICML
2007
IEEE
16 years 5 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner