Sciweavers

3491 search results - page 562 / 699
» Cascaded Markov Models
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
201
Voted
CVPR
2009
IEEE
17 years 2 months ago
An Empirical Bayes Approach to Contextual Region Classification
This paper presents a nonparametric approach to labeling of local image regions that is inspired by recent developments in information-theoretic denoising. The chief novelty of ...
Svetlana Lazebnik (UNC Chapel Hill), Maxim Raginsk...
CVPR
2009
IEEE
17 years 2 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
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
17 years 1 days ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
ICCV
2009
IEEE
17 years 1 days ago
A Global Perspective on MAP Inference for Low-Level Vision
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for low-level vision applications. However, in a maximum a posteriori (MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...