Sciweavers

30 search results - page 6 / 6
» Synchronous Random Fields and Image Restoration
Sort
View
137
Voted
TIT
2008
90views more  TIT 2008»
15 years 3 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav
140
Voted
PAMI
2007
176views more  PAMI 2007»
15 years 3 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
153
Voted
CVPR
2009
IEEE
16 years 10 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
142
Voted
CVPR
2010
IEEE
16 years 19 hour ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth
142
Voted
ECCV
2006
Springer
16 years 5 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