Sciweavers

302 search results - page 44 / 61
» Reducing graphs in graph cut segmentation
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
ICIP
2008
IEEE
15 years 6 months ago
Time-sequential extraction of motion layers
A new time-sequential approach for motion layer extraction is presented. We assume that the scene can be described by a set of layers associated to affine motion models. In one o...
Matthieu Fradet, Patrick Pérez, Philippe Ro...
ECCV
2010
Springer
15 years 5 months ago
Category Independent Object Proposals
We propose a category-independent method to produce a bag of regions and rank them, such that top-ranked regions are likely to be good segmentations of different objects. Our key ...
IJCV
2012
13 years 2 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
ICDAR
2009
IEEE
14 years 9 months ago
Graph b-Coloring for Automatic Recognition of Documents
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
Djamel Gaceb, Véronique Eglin, Frank Lebour...