Sciweavers

1170 search results - page 49 / 234
» How Fast Is Too Fast
Sort
View
127
Voted
TOG
2002
129views more  TOG 2002»
15 years 2 months ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey
143
Voted
TSP
2010
14 years 9 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
114
Voted
ICASSP
2011
IEEE
14 years 6 months ago
A fast transform for acoustic imaging with separable arrays
Acoustic imaging is a computationally intensive and ill-conditioned inverse problem, which involves estimating high resolution source distributions with large microphone arrays. I...
Flavio P. Ribeiro, Vitor H. Nascimento
153
Voted
CVPR
2004
IEEE
16 years 4 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
94
Voted
CVPR
2007
IEEE
16 years 4 months ago
A Binning Scheme for Fast Hard Drive Based Image Search
In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the featur...
David Nistér, Friedrich Fraundorfer, Henrik...