288 search results - page 30 / 58 » Notes on computing minimal approximant bases |
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
ECCV
2004
Springer
14 years 1 months ago
2004
Springer
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through si...
SAGA
2009
Springer
14 years 4 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
PG
2003
IEEE
14 years 3 months ago
2003
IEEE
Constrictions on a surface are defined as simple closed curves whose length is locally minimal. In particular, constrictions are periodic geodesics. We use constrictions in order...
IVC
2010
13 years 8 months ago
2010
Traditional shape from silhouette methods compute the 3D shape as the intersection of the back-projected silhouettes in the 3D space, the so called visual hull. However, silhouett...