[Todos] Coloquios del Departamento de Matemática (jueves 13/8/09)

[Daniel Carando]

Próximo coloquio:
Jueves 13 de agosto a las 16:00, aula E24

Akram Aldroubi
Vanderbilt University

An Adaptive and  Information Theoretic Method For Compressed Sampling

Resumen: By considering an s-sparse x signal to be an instance of
vector random variable X=(X_1,...,X_n)^t we determine  a sequence of
binary sampling vectors for characterizing the signal x and completely
determining it from the samples. Unlike the standard approaches, this
one is adaptive and is inspired by ideas from the theory of Huffman
codes. The method seeks to minimize the number of steps needed for the
sampling and reconstruction of any sparse  vector x which is an
instance of X. We prove that the expected total cost (number of
measurements and reconstruction combined) that we need for an s-sparse
vector in R^n is no more than  slog n + 2s.

Están todos cordialmente invitados.

Daniel Carando

http://mate.dm.uba.ar/~dcarando/coloquios/