1133 search results - page 68 / 227 » Basics of Graph Cuts |
ENTCS
2006
2006
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
13 years 10 months ago
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
DM
2006
13 years 10 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...