273 search results - page 11 / 55 » Can Pure Cutting Plane Algorithms Work |
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Images taken from scenes under water suffer distortion due to refraction. While refraction causes magnification with mild distortion on the observed images, severe distortions in...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...