Georgia Institute of Technology College of Sciences

In this talk we discuss some nonlinear transformations between moment sequences. One of these transformations is the following: if (a_n)_n is a non-vanishing Hausdorff moment sequence then the sequence defined by 1/(a_0 ... a_n) is a Stieltjes moment sequence. Our approach is constructive and use Euler's idea of developing q-infinite products in power series. Some others transformations will be considered as well as some relevant moment sequences and analytic functions related to them. We will also propose some conjectures about moment transformations defined by means of continuous fractions.

This talks introduces a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach combines multiple structured illuminations together with ideas from convex programming to recover the phase from intensity measurements, typically from the modulus of the diffracted wave. We demonstrate empirically that any complex-valued object can be recovered from the knowledge of the magnitude of just a few diffracted patterns by solving a simple convex optimization problem inspired by the recent literature on matrix completion. More importantly, we also demonstrate that our noise-aware algorithms are stable in the sense that the reconstruction degrades gracefully as the signal-to-noise ratio decreases. Finally, we present some novel theory showing that our entire approach may be provably surprisingly effective.

This talk is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program. This suggests the possibility of a principled approach to robust principal component analysis since our methodology and results assert that one can recover the principal components of a data matrix even though a positive fraction of its entries are arbitrarily corrupted. This extends to the situation where a fraction of the entries are missing as well. In the second part of the talk, we present applications in computer vision. In video surveillance, for example, our methodology allows for the detection of objects in a cluttered background. We show how the methodology can be adapted to simultaneously align a batch of images and correct serious defects/corruptions in each image, opening new perspectives.

[This talk is canceled. Sep 9, 2012 ] Centroidal Voronoi Tessellations(CVTs) are special Voronoi Tessellations where the centroidal of each segments coincides with its Voronoi generators. CVT has broad applications in various fields. In this talk, we will present a new development for CVT algorithms, Edge-weighted CVTs, which puts the segment boundary length information to the consideration of CVT algorithms. We will demonstrate how EWCVTs can be applied in image segmentations, superpixels, etc.