Sciweavers

843 search results - page 12 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
UAI
2004
13 years 8 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
ICIAP
2005
ACM
14 years 7 months ago
Optimal Parameter Estimation for MRF Stereo Matching
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
Riccardo Gherardi, Umberto Castellani, Andrea Fusi...
ICCV
2007
IEEE
14 years 9 months ago
MRF Optimization via Dual Decomposition: Message-Passing Revisited
A new message-passing scheme for MRF optimization is proposed in this paper. This scheme inherits better theoretical properties than all other state-of-the-art message passing met...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
WSCG
2004
217views more  WSCG 2004»
13 years 8 months ago
Blending Textured Images Using a Non-parametric Multiscale MRF Method
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
Bernard Tiddeman
ECCV
2008
Springer
14 years 9 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...