Sciweavers

25 search results - page 3 / 5
» Bayesian Solutions to the Label Switching Problem
Sort
View
ECCV
1994
Springer
13 years 11 months ago
Markov Random Field Models in Computer Vision
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Stan Z. Li
ML
2002
ACM
220views Machine Learning» more  ML 2002»
13 years 7 months ago
Bayesian Methods for Support Vector Machines: Evidence and Predictive Class Probabilities
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...
Peter Sollich
EMMCVPR
1999
Springer
13 years 11 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICC
2007
IEEE
162views Communications» more  ICC 2007»
13 years 11 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
CVPR
2009
IEEE
15 years 3 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...