Keijo Ruotsalainen - University of Oulu, Finland - INTRODUCTION TO COMPRESSED SENSING
The basic problem in several practical problems of science and technology is the task of inferring quantities of interest from measured information. When the information retrieval is linear, the problem reduces to solving a linear a system of equations Ax = y where A ∈ Cm×D is the linear information retrieval process, x ∈ CD the signal to be reconstructed and y ∈ Cm the measured data. In Big Data application then both m and D are Big Numbers. If we have random signals, then we may include the noise n ∈ Cm: Ax + n = y.
In this lecture series, some basic ideas of compressed sensing will be presented: performing data collection and compression simultaneously. With some simple examples it will be demonstrated that under certain conditions it is possible to reconstruct signals when the number of measurements is less than the signal length, in contrary to Shannon’s sampling theorem.
Mo 21.5 Room 1D 14.30-17
Mo 28.5 Room 2D 14.30-17
Th 31.5 Room 8D 14.30-17
Mo 4.6 Room Buzano at DISMA 14.30-17
Th 7.6 Room Buzano at DISMA 14.30-17
Mo 11.6 Room 1D 14.30-17
Th 14.6 Room Buzano at DISMA 14.30-17
Mo 25.6 Room 1D 14.30-17
Th 28.6 Room Buzano at DISMA 14.30-17
Th 2.7 Room Buzano at DISMA 14.30-17
For more info: firstname.lastname@example.org, email@example.com