Sciweavers

1439 search results - page 42 / 288
» Fast approximation of centrality
Sort
View
ESANN
2007
14 years 13 days ago
Tracking fast changing non-stationary distributions with a topologically adaptive neural network: application to video tracking
In this paper, an original method named GNG-T, extended from GNG-U algorithm by [1] is presented. The method performs continuously vector quantization over a distribution that chan...
Georges Adrian Drumea, Hervé Frezza-Buet
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 5 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
DAC
2005
ACM
14 years 28 days ago
Piece-wise approximations of RLCK circuit responses using moment matching
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
Chirayu S. Amin, Yehea I. Ismail, Florentin Dartu
ICPR
2002
IEEE
15 years 2 days 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
ACIVS
2008
Springer
14 years 5 months ago
Blur and Contrast Invariant Fast Stereo Matching
We propose a novel approach for estimating a depth-map from a pair of rectified stereo images degraded by blur and contrast change. At each location in image space, information is...
Matteo Pedone, Janne Heikkilä