Recovering an homogeneous polynomial from moments of its level set

DOI10.1007/s00454-013-9537-6zbMath1311.44009arXiv1208.6401OpenAlexW2051830113MaRDI QIDQ377495

Jean-Bernard Lasserre

Publication date: 6 November 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.6401

zbMATH Keywords

momentshomogeneous polynomialsinverse problem from momentssublevel sets

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Moment problems (44A60) Real polynomials: location of zeros (26C10) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (4)

Algebraic-exponential data recovery from moments ⋮ A generalization of Löwner-John's ellipsoid theorem ⋮ Lebesgue decomposition in action via semidefinite relaxations ⋮ On the minimal number of moments required to recover the sublevel set of a homogeneous polynomial

Cites Work

• The inverse moment problem for convex polytopes
• New and old results in resultant theory
• A Stable Numerical Method for Inverting Shape from Moments
• Multidimensional Integral Inversion, with Applications in Shape Reconstruction

This page was built for publication: Recovering an homogeneous polynomial from moments of its level set