Sciweavers

186 search results - page 17 / 38
» Fast Computation of Sparse Datacubes
Sort
View
IJCV
2002
157views more  IJCV 2002»
13 years 9 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
ECCV
2008
Springer
14 years 11 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher
EVOW
2005
Springer
14 years 3 months ago
Design of Fast Multidimensional Filters Using Genetic Algorithms
A method for designing fast multidimensional filters using genetic algorithms is described. The filter is decomposed into component filters where coefficients can be sparsely sc...
Max Langer, Björn Svensson, Anders Brun, Mats...
INTERSPEECH
2010
13 years 4 months ago
Convexity and fast speech extraction by split bregman method
A fast speech extraction (FSE) method is presented using convex optimization made possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 regul...
Meng Yu, Wenye Ma, Jack Xin, Stanley Osher
PPOPP
2010
ACM
14 years 7 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...