843 search results - page 5 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
109
click to vote
MICCAI
2008
Springer
15 years 11 months ago
2008
Springer
In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi-spectral 3-D magnetic resonance images. It is a top-down segmentation app...
115
click to vote
ICIAR
2009
Springer
2009
Springer
Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior
15 years 4 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...
PAMI
2010
14 years 8 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 ...