Abstract: We consider the problem of reconstruction of planar domains from their moments. Specifically, we consider domains with boundary which can be represented by a union of a finite number of pieces whose graphs are solutions of a linear differential equation with polynomial coefficients. This includes domains with piecewise-algebraic and, in particular, piecewise-polynomial boundaries. Our approach is based on one-dimensional reconstruction method of [Bat]* and a kind of "separation of variables" which reduces the planar problem to two one-dimensional problems, one of them parametric. Several explicit examples of reconstruction are given. Another main topic of the paper concerns "invisible sets" for various types of incomplete moment measurements. We suggest a certain point of view which stresses remarkable similarity between several apparently unrelated problems. In particular, we discuss zero quadrature domains (invisible for harmonic polynomials), invisibility for powers of a given polynomial, and invisibility for complex moments (Wermer's theorem and further developments). The common property we would like to stress is a "rigidity" and symmetry of the invisible objects.
Introduction
In many scientific domains—ranging from medical imaging and tomography to potential theory—the challenge of reconstructing an object's shape from indirect measurements is paramount. This paper addresses the inverse problem of recovering a 2D planar domain $G$ using only a finite set of its "moments," which are weighted averages of the object's characteristic function. The central inquiry revolves around uniqueness and efficiency: can a shape be uniquely identified by a finite number of moments, and what is the minimum number of measurements required?
While well-understood for simple polygons, the problem becomes significantly more complex for domains with curved boundaries. This research focuses on domains where the boundary is "D-finite," meaning the boundary segments are solutions to linear differential equations with polynomial coefficients. This broad class encompasses piecewise-algebraic and piecewise-polynomial shapes.
Methodology: The 2D-to-1D Pipeline
The core innovation of this work is a "separation of variables" technique that bridges the gap between 1D signal processing and 2D geometry. The 2D reconstruction problem is reduced to two 1D problems by integrating the domain along one axis. This process creates a 1D function representing a "slice" of the domain.
As illustrated in the figure above, the domain $G$ is partitioned into segments $S_k$ over intervals $\Delta_j = [\xi_j, \xi_{j+1}]$. By proving that a D-finite boundary results in a piecewise D-finite 1D "slice" function, the authors apply a 1D reconstruction algorithm to recover the parameters of these slices. To solve the resulting non-linear algebraic equations, they employ the Prony system, a classical signal processing method for estimating frequencies and amplitudes.
Key Theoretical Results
The paper provides rigorous mathematical foundations for this reconstruction framework:
- Theorem 3.1: Establishes that any D-finite domain can be uniquely reconstructed from a finite collection of double moments $m_{\alpha,\beta}$.
- The "7-Moment" Rule (Theorem 4.1): In a striking practical application, the authors prove that a domain bounded by an elliptic curve (e.g., $y^2 = ax^3 + bx^2 + cx + d$) can be perfectly reconstructed using only seven specific moments ($m_{0,0}, m_{1,0}, m_{2,0}, m_{3,0}, m_{4,0}, m_{0,2}, m_{1,2}$).
- Finite Measurement Bounds: The authors provide explicit formulas for the number of moments $\mu$ required for unique reconstruction based on the degree $d$ and number of segments $\kappa$ of the polynomial boundaries.
The Geometry of Invisibility
A significant portion of the paper is dedicated to "invisible sets"—geometric shapes that remain undetected by certain classes of mathematical measurements. The authors reframe invisibility not as a lack of data, but as a manifestation of deep structural symmetry and "rigidity."
By using Multi-dimensional Composition Conditions (MCC), they analyze sets that produce zero moments against specific polynomials. This links seemingly unrelated mathematical problems, such as the Jacobian conjecture and Wermer’s theorem, under a unified framework of moment vanishing problems. For instance, a set is invisible to harmonic polynomials if it is a "null quadrature domain," such as a half-space or the exterior of an ellipsoid.
Limitations and Future Directions
While providing a powerful framework, the current method has constraints. The singular points of the differential operator defining the boundary must lie outside the projection of the domain, which currently limits the reconstruction of general semi-algebraic domains with vertical tangents or cusps. Furthermore, while the reconstruction is exact in noiseless environments, the robustness of the method against measurement errors remains a critical open question for practical engineering applications. Future work may also explore extending the "separation of variables" approach to 3D reconstruction, despite the increased complexity of the resulting parametric equations.
Summary updated