Sciweavers

6365 search results - page 860 / 1273
» Fast Local Computation Algorithms
Sort
View
EGH
2005
Springer
16 years 1 months ago
Split-plane shadow volumes
We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is ma...
Samuli Laine
EUROPAR
2008
Springer
15 years 9 months ago
Parallel Lattice Boltzmann Flow Simulation on Emerging Multi-core Platforms
Abstract. A parallel Lattice Boltzmann Method (pLBM), which is based on hierarchical spatial decomposition, is designed to perform large-scale flow simulations. The algorithm uses ...
Liu Peng, Ken-ichi Nomura, Takehiro Oyakawa, Rajiv...
244
Voted

Source Code
2231views
17 years 1 months ago
The Berkeley Segmentation Engine (BSE)
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...
Charless Fowlkes
ICCV
2009
IEEE
17 years 15 days ago
Body-Relative Navigation Guidance Using Uncalibrated Cameras
We present a vision-based method that assists human navigation within unfamiliar environments. Our main contribution is a novel algorithm that learns the correlation between use...
Olivier Koch, Seth Teller
204
Voted
CVPR
2003
IEEE
16 years 9 months ago
Mean-shift Blob Tracking through Scale Space
The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently n...
Robert T. Collins