Sciweavers

1539 search results - page 24 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
VLSM
2005
Springer
14 years 1 months ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto
PG
2002
IEEE
14 years 14 days ago
A Physics-Based Framework for Subdivision Surface Design with Automatic Rules Control
The recent non-uniform subdivision approach extends traditional uniform subdivision schemes with variable rules, offering additional shape parameters (such as knot spacings) for f...
Hui Xie, Hong Qin
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 1 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
ARITH
2009
IEEE
14 years 2 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison
ACCV
2006
Springer
14 years 1 months ago
Fast Global Motion Estimation Via Iterative Least-Square Method
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...
Jia Wang, Haifeng Wang, Qingshan Liu, Hanqing Lu