Sciweavers

1115 search results - page 13 / 223
» Active Graph Cuts
Sort
View
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
14 years 6 days ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
IPMI
2005
Springer
14 years 8 months ago
Analysis of Event-Related fMRI Data Using Diffusion Maps
The blood oxygen level-dependent (BOLD) signal in response to brief periods of stimulus can be detected using event-related functional magnetic resonance imaging (ER-fMRI). In this...
François G. Meyer, Xilin Shen
ICPR
2008
IEEE
14 years 9 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof
MVA
2007
137views Computer Vision» more  MVA 2007»
13 years 9 months ago
Object Based Contour Detection by Using Graph-cut on Stereo Image
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
Taehoon Kang, Jaeseung Yu, Jangseok Oh, Yunhwan Se...
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann