Sciweavers

13 search results - page 2 / 3
» Nonequispaced Hyperbolic Cross Fast Fourier Transform
Sort
View
121
Voted
FOCM
2008
156views more  FOCM 2008»
14 years 11 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
115
Voted
TIT
2008
121views more  TIT 2008»
14 years 11 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
SIGPRO
2010
122views more  SIGPRO 2010»
14 years 10 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche
91
Voted
JCPHY
2011
87views more  JCPHY 2011»
14 years 2 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
ICIP
2001
IEEE
16 years 1 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen