724 search results - page 7 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
106
click to vote
CVPR
2008
IEEE
16 years 1 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...
171
click to vote
IJCV
2006
14 years 11 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
117
Voted
CNIS
2006
15 years 1 months ago
2006
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
102
click to vote
MP
2006
14 years 11 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...