Seminar Details
2018-10-23 (14:00) : Interferometry and convex programming
At Euler building (room A.002)
Organized by Mathematical Engineering
Speaker :
Demanet, Laurent
Abstract :
A number of hard estimation questions in science and engineering can be expressed as recovering a rank-1 matrix from linear measurements. One example that I will cover in this talk is "interferometry", a trick in signal processing and imaging consisting in taking cross-correlations to attenuate incoherent noise. I show that recovery for inverse problems involving interferometric combinations is sometimes possible with varying levels of convex relaxations, and depends on the underlying graph of measurements being an expander. I also show an example of "interferometric thinking" to blind deconvolution, where it enables the design of new sparse regularizers.