Sciweavers

6365 search results - page 424 / 1273
» Fast Local Computation Algorithms
Sort
View
RAS
2000
70views more  RAS 2000»
15 years 7 months ago
Feature extraction and tracking for scanning range sensors
A solution to the problem of simultaneously extracting and tracking a piecewise-linear range representation of a mobile robot's local environment is presented. The classical ...
Nick E. Pears
ICASSP
2007
IEEE
16 years 1 months ago
Spatiotemporal Algorithm for Background Subtraction
Background modeling and subtraction is a fundamental task in many computer vision and video processing applications. We present a novel probabilistic background modeling and subtr...
S. Derin Babacan, Thrasyvoulos N. Pappas
RT
2005
Springer
16 years 1 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...
AROBOTS
2002
115views more  AROBOTS 2002»
15 years 7 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
ECCV
2010
Springer
16 years 22 days ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...