CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.03 - March
Issue No.03 - March (2009 vol.31)
Richard j. Gardner , Western Washington University, Bellingham
Markus Kiderlen , University of Aarhus, Aarhus
We introduce a new algorithm for reconstructing an unknown shape from a finite number of noisy measurements of its support function. The algorithm, based on a least squares procedure, is very easy to program in standard software such as Matlab, and it works for both 2D and 3D reconstructions (in fact, in principle, in any dimension). Reconstructions may be obtained without any pre- or post-processing steps and with no restriction on the sets of measurement directions except their number, a limitation dictated only by computing time. An algorithm due to Prince and Willsky was implemented earlier for 2D reconstructions, and we compare the performance of their algorithm and ours. But our algorithm is the first that works for 3D reconstructions with the freedom stated in the previous paragraph. Moreover, under mild conditions, theory guarantees that outputs of the new algorithm will converge to the input shape as the number of measurements increases. In addition we offer a linear program version of the new algorithm that is much faster and better, or at least comparable, in performance at low levels of noise and reasonably small numbers of measurements. Another modification of the algorithm, suitable for use in a "focus of attention" scheme, is also described.
Least squares methods, Optimization, Numerical Analysis, Shape, Inverse problems, Partial Differential Equations, Mathematics of Computing
Richard j. Gardner, Markus Kiderlen, "A New Algorithm for 3D Reconstruction from Support Functions", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 3, pp. 556-562, March 2009, doi:10.1109/TPAMI.2008.190