1133 search results - page 113 / 227 » Basics of Graph Cuts |
192
click to vote
IPMI
2011
Springer
14 years 1 months ago
2011
Springer
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
JCT
2008
14 years 10 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
MMM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Cooking is a human activity with sophisticated process. Underlying the multitude of culinary recipes, there exist a set of fundamental and general cooking techniques, suc...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
GD
1998
Springer
15 years 2 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...