Sciweavers

6365 search results - page 170 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2011
IEEE
15 years 1 months ago
Making the Right Moves: Guiding Alpha-Expansion using Local Primal-Dual Gaps
This paper presents a new adaptive graph-cut based move-making algorithm for energy minimization. Traditional move-making algorithms such as Expansion and Swap operate by searchin...
Dhruv Batra, Pushmeet Kohli
ICCV
2003
IEEE
16 years 7 months ago
Fast Vehicle Detection with Probabilistic Feature Grouping and its Application to Vehicle Tracking
Generating vehicle trajectories from video data is an important application of ITS (Intelligent Transportation Systems). We introduce a new tracking approach which uses model-base...
Zu Whan Kim, Jitendra Malik
SCALESPACE
2007
Springer
15 years 11 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
VIS
2004
IEEE
186views Visualization» more  VIS 2004»
16 years 6 months ago
Hardware-Accelerated Adaptive EWA Volume Splatting
We present a hardware-accelerated adaptive EWA volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image qual...
Wei Chen, Liu Ren, Matthias Zwicker, Hanspeter Pfi...
GD
2000
Springer
15 years 8 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren