759 search results - page 16 / 152 » Optimal Graph Search with Iterated Graph Cuts |
SIBGRAPI
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
103
Voted
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
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...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...