Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang-Fix
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We prove a general subconvex bound in the level aspect for Rankin–Selberg L-functions associated with two primitive holomorphic or Maass cusp forms over Q. We use this bound to establish the equidistribution of incomplete Galois orbits of Heegner points on ...
The purpose of this paper is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit with some structured dictionaries for ``simple'' functions in finite or infinite dimension. Our results are based on an extension of ...
We present an optimal spline-based algorithm for the enlargement or reduction of digital images with arbitrary (noninteger) scaling factors. This projection-based approach can be realized thanks to a new finite difference method that allows the computation ...
The main goal of this article is to establish a priori and a posteriori error estimates for the numerical approximation of some non linear elliptic problems arising in glaciology. The stationary motion of a glacier is given by a non-Newtonian fluid flow mo ...
Sampling theory has prospered extensively in the last century. The elegant mathematics and the vast number of applications are the reasons for its popularity. The applications involved in this thesis are in signal processing and communications and call out ...
Recently, it was shown that it is possible to develop exact sampling schemes for a large class of parametric nonban- dlimited signals, namely certain signals of finite rate of innovation. A common feature of such signals is that they have a finite number o ...
Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform ...
Institute of Electrical and Electronics Engineers2002
Sampling theory has experienced a strong research revival over the past decade, which led to a generalization of Shannon's original theory and development of more advanced formulations with immediate relevance to signal processing and communications. For e ...
We discuss stabilized Galerkin approximations in a new framework, widening the scope from the usual dichotomy of the discontinuous Galerkin method on the one hand and Petrov--Galerkin methods such as the SUPG method on the other. The idea is to use interio ...
We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampli ...
