Sciweavers

101 search results - page 20 / 21
» Graph Partition by Swendsen-Wang Cuts
Sort
View
VLSM
2005
Springer
13 years 11 months ago
Trimap Segmentation for Fast and User-Friendly Alpha Matting
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
Olivier Juan, Renaud Keriven
TMI
2008
140views more  TMI 2008»
13 years 5 months ago
Hamilton-Jacobi Skeleton on Cortical Surfaces
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
Yonggang Shi, Paul M. Thompson, Ivo D. Dinov, Arth...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 6 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 17 days ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
ECCV
2008
Springer
14 years 7 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal