Sciweavers

438 search results - page 77 / 88
» Shape from shading using graph cuts
Sort
View
COLT
2007
Springer
14 years 3 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
TOG
2010
181views more  TOG 2010»
13 years 4 months ago
Context-based search for 3D models
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
Matthew Fisher, Pat Hanrahan
LATIN
1998
Springer
14 years 1 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner
CVPR
2003
IEEE
14 years 11 months ago
Stereo Matching with Reflections and Translucency
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
PAMI
2006
111views more  PAMI 2006»
13 years 9 months ago
Stereo Matching with Linear Superposition of Layers
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski