1133 search results - page 134 / 227 » Basics of Graph Cuts |
EUSFLAT
2009
14 years 7 months ago
2009
Abstract-- An L-fuzzy context is a triple consisting of a set of objects, a set of attributes and an L-fuzzy binary relation between them. An l-cut is a classical context over the ...
JSC
2007
14 years 9 months ago
2007
We start the study of the problem of describing the double point locus of a bicubic surface. Our motivation is to determine, whether a real bicubic patch over the unit square will...
ARSCOM
2004
14 years 9 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
CVPR
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
106
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...