Sciweavers

132 search results - page 9 / 27
» Fast Occlusion Sweeping
Sort
View
CVPR
2003
IEEE
16 years 5 months ago
On Region Merging: The Statistical Soundness of Fast Sorting, with Applications
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
Frank Nielsen, Richard Nock
JUCS
2010
265views more  JUCS 2010»
15 years 1 months ago
A General Framework for Multi-Human Tracking using Kalman Filter and Fast Mean Shift Algorithms
: The task of reliable detection and tracking of multiple objects becomes highly complex for crowded scenarios. In this paper, a robust framework is presented for multi-Human track...
Ahmed Ali, Kenji Terada
CGI
2003
IEEE
15 years 8 months ago
Fast Depth of Field Rendering with Surface Splatting
We present a new fast algorithm for rendering the depthof-field effect for point-based surfaces. The algorithm handles partial occlusion correctly, it does not suffer from intens...
Jaroslav Krivánek, Jiri Zara, Kadi Bouatouc...
142
Voted
IJCV
2000
109views more  IJCV 2000»
15 years 3 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
ICANN
2005
Springer
15 years 9 months ago
Fast Color-Based Object Recognition Independent of Position and Orientation
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
Martijn van de Giessen, Jürgen Schmidhuber