Sciweavers

1115 search results - page 64 / 223
» Active Graph Cuts
Sort
View
FOCM
2007
76views more  FOCM 2007»
13 years 8 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
CVPR
2004
IEEE
14 years 10 months ago
Motion Estimation by Swendsen-Wang Cuts
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
Adrian Barbu, Alan L. Yuille
ICCV
2001
IEEE
14 years 10 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum