Sciweavers

165 search results - page 16 / 33
» Computing hereditary convex structures
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
14 years 1 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
SIAMJO
2010
79views more  SIAMJO 2010»
13 years 6 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...
COMPUTE
2009
ACM
13 years 11 months ago
Segmentation of touching characters in upper zone in printed Gurmukhi script
A new technique for segmenting touching characters in upper zone of printed Gurmukhi script has been presented in this paper. The technique is based on the structural properties o...
Manish Kumar Jindal, Rajendra Kumar Sharma, Gurpre...
RT
2000
Springer
13 years 11 months ago
Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
Luc Leblanc, Pierre Poulin