Name
Abstract | ||
|---|---|---|
In this paper we discuss the problem of recovering the vertices of a planar polygon from its measured complex moments. Because the given, measured moments can be noisy, the recovered vertices are only estimates of the true ones. The literature offers many algorithms for solving such an estimation problem. We will restrict our discussion to the Total Least Squares (TLS) data fitting models HTLS and STLS and the matrix pencil method GPOF. We show the close link between the HTLS and the GPOF method. We use the HTLS method to compute starting values for the STLS method. We compare the accuracy of these three methods on simulated data. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.sigpro.2005.09.008 | Signal Processing |
Keywords | Field | DocType |
HTLS,STLS,GPOF,Matrix pencil,Rank reduction | Least squares,Polygon,Mathematical optimization,Matrix pencil,Curve fitting,Algorithm,Matrix method,Estimation theory,Total least squares,Moment problem,Mathematics,Calculus | Journal |
Volume | Issue | ISSN |
86 | 5 | 0165-1684 |
Citations | PageRank | References |
4 | 0.67 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Schuermans | 1 | 8 | 1.47 |
| Philippe Lemmerling | 2 | 131 | 22.31 |
| L. De Lathauwer | 3 | 320 | 48.18 |
| S. Van Huffel | 4 | 260 | 32.75 |