Sciweavers

70 search results - page 4 / 14
» Signal approximation using the bilinear transform
Sort
View
CVPR
2010
IEEE
13 years 6 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
TVCG
2008
136views more  TVCG 2008»
13 years 7 months ago
Hierarchical Tensor Approximation of Multi-Dimensional Visual Data
Abstract-- Visual data comprise of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop a compact data representation technique based ...
Qing Wu, Tian Xia, Chun Chen, Hsueh-Yi Sean Lin, H...
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
DCC
2004
IEEE
14 years 7 months ago
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...
Onur G. Guleryuz

Book
4675views
15 years 5 months ago
Mathematics of The Discrete Fourier Transform (DFT) with Audio Applications
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
Julius O. Smith III