Sciweavers

133 search results - page 5 / 27
» Simple and practical algorithm for sparse Fourier transform
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Influence of the boundary conditions on the result of non-linear image registration
The focus of many non-parametric image registration algorithms lies on the solution of non-linear partial differential equations. We offer a simple solution procedure therefor bas...
Ulf-Dietrich Braumann, Jens-Peer Kuska
BMVC
2000
13 years 8 months ago
Statistical Properties of the Hybrid Radon-Fourier Technique
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...
Violet F. Leavers
FOCM
2008
156views more  FOCM 2008»
13 years 7 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
JVCIR
2010
162views more  JVCIR 2010»
13 years 5 months ago
Tetrolet transform: A new adaptive Haar wavelet algorithm for sparse image representation
In order to get an efficient image representation we introduce a new adaptive Haar wavelet transform, called Tetrolet Transform. Tetrolets are Haar-type wavelets whose supports ar...
Jens Krommweh
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous