Sciweavers

1539 search results - page 76 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
112
Voted
ICPR
2002
IEEE
16 years 3 months ago
Reliable and Fast Eye Finding in Close-up Images
This paper describes a method for quickly and robustly localizing the iris and pupil boundaries of a human eye in close-up images. Such an algorithm can be critical for iris ident...
Theodore A. Camus, Richard P. Wildes
111
Voted
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 9 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
15 years 2 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 9 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
CVPR
2010
IEEE
15 years 11 months ago
Fast Global Optimization of Curvature
Two challenges in computer vision are to accommodate noisy data and missing data. Many problems in computer vision, such as segmentation, filtering, stereo, reconstruction, inpain...
Noha El-Zehiry, Leo Grady