270 search results - page 14 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
ICPR
2010
IEEE
14 years 26 days ago
2010
IEEE
We propose a novel Markovian segmentation
model which takes into account edge information. By construction,
the model uses only pairwise interactions and its
energy is submodula...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
IJISTA
2008
13 years 7 months ago
2008
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
CVPR
1999
IEEE
14 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
ICIP
2005
IEEE
14 years 1 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...