Sciweavers

759 search results - page 7 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
ICIP
2007
IEEE
15 years 3 months ago
Graph Cut Segmentation with Nonlinear Shape Priors
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
James G. Malcolm, Yogesh Rathi, Allen Tannenbaum
97
Voted
ICML
2009
IEEE
15 years 10 months ago
Spectral clustering based on the graph p-Laplacian
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
Matthias Hein, Thomas Bühler
100
Voted
CVPR
2010
IEEE
15 years 6 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
ICIP
2009
IEEE
15 years 10 months ago
Modified Grabcut For Unsupervised Object Segmentation
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
CVPR
2008
IEEE
15 years 11 months ago
FusionFlow: Discrete-continuous optimization for optical flow estimation
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
Victor S. Lempitsky, Stefan Roth, Carsten Rother