Hledat
Zobrazují se záznamy 1-10 z 110
What Is Decreased by the Max-sum Arc Consistency Algorithm?
(ACM, 2007)
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 is equivalent to the weighted (maxsum) CSP. ...
A Linear Programming Approach to Max-sum Problem: A Review
(Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University, 2005-12)
The max-sum labeling problem, de ned as maximizing a sum of functions of pairs of discrete variables, is a general optimization problem with numerous applications, e.g., computing MAP assignments of a Markov random eld. ...
Revisiting the Decomposition Approach to Inference in Exponential Families and Graphical Models
(Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University, 2009-05)
Fixed Points of Loopy Belief Propagation as Zero Gradients of a Function of Reparameterizations
(Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University, 2010-02)
The existing view on loopy belief propagation sees it as an algorithm to nd a common zero of a system of non-linear functions, not explicitly related to each other. We show that these functions are in fact related { they ...
Joint Orientation of Epipoles
(British Machine Vision Association, 2003-09)
It is known that epipolar constraint can be augmented with orientation by formulating it in the oriented projective geometry. This oriented epipolar constraint requires knowing the orientations (signs of overall scales) ...
Model Selection for Automated Architectural Reconstruction from Multiple Views
(British Machine Vision Conference (BMVC), 2002-09)
We describe progress in automatically fitting a plane plus modelled perturbation surface model to represent architectural scenes. There are two areas of novelty. The first is a method of fitting parametrized models in which ...
Marginal Consistency: Unifying Constraint Propagation on Commutative Semirings
(Institute National de la Recherche Agronomique, 2008-09)
We generalise the linear programming relaxation approach to Weighted CSP by Schlesinger and the max-sum diffusion algorithm by Koval and Kovalevsky twice: from Weighted CSP to Semiring CSP, and from binary networks to ...
Primal View on Belief Propagation
(AUAI Press, 2010-07)
It is known that xed points of loopy belief propagation (BP) correspond to stationary points of the Bethe variational problem, where we minimize the Bethe free energy subject to normalization and marginalization constraints. ...
Unified Framework for Semiring-Based Arc Consistency and Relaxation Labeling
(Verlag der Technischen Universität Graz, 2007-02)
Constraint Satisfaction Problem (CSP), including its soft modifications, is ubiquitous in artificial intelligence and related fields. In computer vision and pattern recognition, the crisp CSP is more known as the consistent ...