Sciweavers

3211 search results - page 214 / 643
» On the Grundy Number of a Graph
Sort
View
MVA
2008
305views Computer Vision» more  MVA 2008»
15 years 6 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 6 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
SIAMSC
2008
182views more  SIAMSC 2008»
15 years 6 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
JCT
2007
133views more  JCT 2007»
15 years 6 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
TSMC
2008
138views more  TSMC 2008»
15 years 6 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...