1404 search results - page 70 / 281 » Optimization problems in multiple-interval graphs |
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
139
click to vote
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
103
click to vote
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...
100
click to vote
MICCAI
2010
Springer
14 years 8 months ago
2010
Springer
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
100
click to vote
INFOVIS
2002
IEEE
15 years 2 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...