63 search results - page 3 / 13 » Connected Components with Split and Merge |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
IVC
2007
13 years 7 months ago
2007
In this paper connected operators from mathematical morphology are extended to a wider class of operators, which are based on connectivities in higher-dimensional spaces, similar ...
ACIVS
2008
Springer
14 years 2 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
JMLR
2012
11 years 10 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
CVBIA
2005
Springer
14 years 1 months ago
2005
Springer
We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automat...