Sciweavers

1594 search results - page 27 / 319
» Sampling and Reconstruction of Operators
Sort
View
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
CAD
2006
Springer
13 years 7 months ago
Field modeling with sampled distances
Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mes...
Michael Freytag, Vadim Shapiro, Igor G. Tsukanov
CORR
2008
Springer
197views Education» more  CORR 2008»
13 years 7 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
TMI
2010
298views more  TMI 2010»
13 years 2 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser
TIT
2002
81views more  TIT 2002»
13 years 7 months ago
On sampling in shift invariant spaces
Abstract-- In this paper, a necessary and sufficient condition for sampling in the general framework of shift invariant spaces is derived. Then this result is applied respectively ...
Wen Chen, S. Itoh, J. Shiki