A Stable Numerical Method for Inverting Shape from Moments

Authors:
Gene H. Golub;Peyman Milanfar;James Varah
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
1999

Citing 0
Cited 18

Symbolic-numeric sparse interpolation of multivariate polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Fast communication: The use of total least squares data fitting in the shape-from-moments problem

Signal Processing
Analytically tractable case of fuzzy c-means clustering

Pattern Recognition
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation

Proceedings of the 2007 international workshop on Symbolic-numeric computation
A parallel method for large sparse generalized eigenvalue problems using a GridRPC system

Future Generation Computer Systems
A new algorithm for sparse interpolation of multivariate polynomials

Theoretical Computer Science
A new transform for solving the noisy complex exponentials approximation problem

Journal of Approximation Theory
Symbolic-numeric sparse interpolation of multivariate polynomials

Journal of Symbolic Computation
Parameter estimation for exponential sums by approximate Prony method

Signal Processing
Estimation of a new stochastic transform for solving the complex exponentials approximation problem: Computational aspects and applications

Digital Signal Processing
Reconstructing sparse trigonometric functions

ACM Communications in Computer Algebra
Nonlinear Approximation by Sums of Exponentials and Translates

SIAM Journal on Scientific Computing
A parallel method for large sparse generalized eigenvalue problems by OmniRPC in a grid environment

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
A hybrid parallel method for large sparse eigenvalue problems on a grid computing environment using Ninf-G/MPI

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
A black box method for solving the complex exponentials approximation problem

Digital Signal Processing
Representation of sparse Legendre expansions

Journal of Symbolic Computation
Software for weighted structured low-rank approximation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We derive a stable technique, based upon matrix pencils, for the reconstruction of (or approximation by) polygonal shapes from moments. We point out that this problem can be considered the dual of 2-D numerical quadrature over polygonal domains. An analysis of the sensitivity of the problem is presented along with some numerical examples illustrating the relevant points. Finally, an application to the problem of gravimetry is explored where the shape of a gravitationally anomalous region is to be recovered from measurements of its exterior gravitational field.