Power spectra of random spike fields and related processes
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 develop a canonical framework for the study of the problem of registration of multiple point processes subjected to warping, known as the problem of separation of amplitude and phase variation. The amplitude variation of a real random function {Y(x) : x ...
Simulation of GNSS signals is very important to test and validate algorithms. With some algorithms, such as acquisition or tracking, we do not need to simulate a realistic constellation with actual ranges, Doppler or navigation data. We can simply simulate ...
2016
We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions. In proving the theorem, we present a variant of the Campbell-Mecke theorem f ...
We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for ballistic behavior which exten ...
We study stationary max-stable processes {n(t): t is an element of R} admitting a representation of the form n(t) = max(i is an element of N) (U-i +Y-i(t)), where Sigma(infinity)(i=1) delta U-i is a Poisson point process on R with intensity e(-u)du, and Y1 ...
Elsevier2015
, , ,
We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, \ie, independent of the graph structure, and its perform ...
Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total- ...
IEEE2012
In this work and the supporting Parts II and III of this paper, also in the current issue, we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over n ...
Institute of Electrical and Electronics Engineers2015
We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential equations, or, equivalently, in terms of a suitable innovation model; the latter is ana ...
The issue of how to efficiently represent the data collected by a network of microphones recording spatio-temporal acoustic wave fields is addressed. Each sensor node in the network samples the sound field, quantizes the samples and transmits the encoded s ...
