Sciweavers

1236 search results - page 38 / 248
» fast 2010
Sort
View
147
Voted

Publication
241views
15 years 5 months ago
Fast compositing for cluster-parallel rendering
The image compositing stages in cluster-parallel rendering for gathering and combining partial rendering results into a final display frame are fundamentally limited by node-to-nod...
Maxim Makhinya, Stefan Eilemann, Renato Pajarola
192
Voted
JUCS
2010
265views more  JUCS 2010»
15 years 2 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
127
Voted
NA
2010
117views more  NA 2010»
15 years 2 months ago
A fast solver for linear systems with displacement structure
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
Antonio Arico, Giuseppe Rodriguez
131
Voted
ICIP
2010
IEEE
15 years 1 months ago
Fast semantic scene segmentation with conditional random field
In this paper, we present a fast approach to obtain semantic scene segmentation with high precision. We employ a two-stage classifier to label all image pixels. First, we use the ...
Wen Yang, Dengxin Dai, Bill Triggs, Gui-Song Xia, ...
139
Voted
CVPR
2010
IEEE
15 years 12 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang