1133 search results - page 87 / 227 » Basics of Graph Cuts |
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a system and a set of tools for producing special effects in film/video making by applying image processing and human centered computing techniques. A combination of s...
GD
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
MIAR
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
WG
2004
Springer
15 years 3 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...