Sciweavers

6365 search results - page 261 / 1273
» Fast Local Computation Algorithms
Sort
View
SI3D
2009
ACM
16 years 1 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
CVPR
2008
IEEE
16 years 8 months ago
Semantic texton forests for image categorization and segmentation
We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not ne...
Jamie Shotton, Matthew Johnson, Roberto Cipolla
CVPR
2008
IEEE
16 years 8 months ago
Fast texture segmentation model based on the shape operator and active contour
We present an approach for unsupervised segmentation of natural and textural images based on active contour, differential geometry and information theoretical concept. More precis...
Nawal Houhou, Jean-Philippe Thiran, Xavier Bresson
ICCV
2007
IEEE
16 years 8 months ago
Fast Bilinear SfM with Side Information
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...
Mahesh Ramachandran, Ashok Veeraraghavan, Rama Che...
ICIP
2004
IEEE
16 years 8 months ago
Fast in-band motion estimation with variable size block matching
In this paper we propose a fast motion estimation technique that works in the wavelet domain. The computational cost of the algorithm turns out to be proportional to the linear si...
Davide Maestroni, Augusto Sarti, Marco Tagliasacch...