17 search results - page 2 / 4 » A Simple Topology Preserving Max-Flow Algorithm for Graph Cu... |
PAMI
2010
13 years 3 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
PAMI
2010
13 years 3 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
ICIAR
2009
Springer
2009
Springer
Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior
13 years 11 months ago
Abstract. A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge whi...
IJCV
2006
13 years 4 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...
BMVC
2010
12 years 12 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...