Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 23, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Julia Schulte

Reconstruction of convex bodies from moments

We investigate how much information about a convex body can be retrieved from a finite number of its geometric moments. We give a sufficient condition for a convex body to be uniquely determined by a finite number of its geometric moments, and we show that among all convex bodies, those which are uniquely determined by a finite number of moments form a dense set. Further, we derive a stability result for convex bodies based on geometric moments. It turns out that the stability result is improved considerably by using another set of moments, namely Legendre moments. We present a reconstruction algorithm that approximates a convex body using a finite number of its Legendre moments. The consistency of the algorithm is established using the stability result for Legendre moments. When only noisy measurements of Legendre moments are available, the consistency of the algorithm is established under certain assumptions on the variance of the noise variables.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login