Sciweavers

438 search results - page 37 / 88
» Shape from shading using graph cuts
Sort
View
COMPGEOM
2009
ACM
15 years 4 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
15 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
CVPR
2010
IEEE
15 years 6 months ago
Collect-Cut: Segmentation with Top-Down Cues Discovered in Multi-Object Images
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
Yong Jae Lee, Kristen Grauman
SCALESPACE
2009
Springer
15 years 2 months ago
Semi-supervised Segmentation Based on Non-local Continuous Min-Cut
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...
Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F...
CGF
2008
126views more  CGF 2008»
14 years 9 months ago
Part-type Segmentation of Articulated Voxel-Shapes using the Junction Rule
We present a part-type segmentation method for articulated voxel-shapes based on curve skeletons. Shapes are considered to consist of several simpler, intersecting shapes. Our met...
Dennie Reniers, Alexandru Telea