Sciweavers

2899 search results - page 143 / 580
» Dynamic Trees in Practice
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Segmenting Foreground Objects from a Dynamic Textured Background via a Robust Kalman Filter
The algorithm presented in this paper aims to segment the foreground objects in video (e.g., people) given timevarying, textured backgrounds. Examples of time-varying backgrounds ...
Jing Zhong, Stan Sclaroff
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
15 years 10 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
JACM
2010
135views more  JACM 2010»
15 years 2 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
WACV
2008
IEEE
15 years 10 months ago
Background Subtraction for Temporally Irregular Dynamic Textures
In the traditional mixture of Gaussians background model, the generating process of each pixel is modeled as a mixture of Gaussians over color. Unfortunately, this model performs ...
Gerald Dalley, Joshua Migdal, W. Eric L. Grimson
JCC
2002
81views more  JCC 2002»
15 years 4 months ago
Multiple grid methods for classical molecular dynamics
: Presented in the context of classical molecular mechanics and dynamics are multilevel summation methods for the fast calculation of energies/forces for pairwise interactions, whi...
Robert D. Skeel, Ismail Tezcan, David J. Hardy