Recovering an homogeneous polynomial from moments of its level set

DOI10.1007/S00454-013-9537-6zbMATH Open1311.44009arXiv1208.6401OpenAlexW2051830113MaRDI QIDQ377495FDOQ377495

Authors: Jean B. Lasserre 

Publication date: 6 November 2013

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

Abstract: Let $K:=x:g(x)leq1$ be the compact sub-level set of some homogeneous polynomial $g$. Assume that the only knowledge about $K$ is the degree of $g$ as well as the moments of the Lebesgue measure on $K$ up to order 2d. Then the vector of coefficients of $g$ is solution of a simple linear system whose associated matrix is nonsingular. In other words, the moments up to order 2d of the Lebesgue measure on $K$ encode all information on the homogeneous polynomial $g$ that defines $K$ (in fact, only moments of order $d$ and 2d are needed).

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

Recommendations

• On the minimal number of moments required to recover the sublevel set of a homogeneous polynomial
• scientific article; zbMATH DE number 3888036
• Measuring the level sets of generalized homogeneous functions
• Convergence of Polynomial Level Sets
• scientific article; zbMATH DE number 1893725
• Homogenized polynomials and curves with many points
• The recovery of even polynomial potentials
• Measuring the level sets of anisotropic homogeneous functions

zbMATH Keywords

momentshomogeneous polynomialsinverse problem from momentssublevel sets

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377495)