A New Algorithm for 3D Reconstruction from Support Functions

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.

[1]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[2]  Jens Gregor,et al.  Fast Feldkamp reconstruction based on focus of attention and distributed computing , 2002, Int. J. Imaging Syst. Technol..

[3]  H. Groemer.  Geometric Applications of Fourier Series and Spherical Harmonics , 1996 .

[4]  Jens Gregor,et al.  Three‐dimensional support function estimation and application for projection magnetic resonance imaging , 2002, Int. J. Imaging Syst. Technol..

[5]  Jerry L. Prince,et al.  Reconstructing Convex Sets from Support Line Measurements , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  R. Gardner.  Geometric Tomography: Parallel X-rays of planar convex bodies , 2006 .

[7]  Peter Hall,et al.  On the Estimation of a Convex Set With Corners , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Takashi Ohe,et al.  A numerical method for finding the convex hull of polygonal cavities using the enclosure method , 2002 .

[9]  P. Milanfar,et al.  Convergence of algorithms for reconstructing convex bodies and directional measures , 2006, math/0608011.

[10]  Tomás Lozano-Pérez,et al.  Tactile Recognition and Localization Using Object Models: The Case of Polyhedra on a Plane , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[12]  Thomas B. Sheridan,et al.  An Automated Tactile Sensing Strategy for Planar Object Recognition and Localization , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Sanjeev R. Kulkarni,et al.  Convex-polygon estimation from support-line measurements and applications to target reconstruction from laser-radar data , 1992 .

[14]  E. Mammen,et al.  A General Projection Framework for Constrained Smoothing , 2001 .

[15]  Peyman Milanfar,et al.  Shape Estimation from Support and Diameter Functions , 2006, Journal of Mathematical Imaging and Vision.

[16]  Alfred M. Bruckstein,et al.  Blind approximation of planar convex sets , 1994, IEEE Trans. Robotics Autom..

[17]  Jens Gregor,et al.  A focus-of-attention preprocessing scheme for EM-ML PET reconstruction , 1997, IEEE Transactions on Medical Imaging.

[18]  K. Vinod Kumar,et al.  Support Function Representation of Convex Bodies, Its Application in Geometric Computing, and Some Related Representations , 1998, Comput. Vis. Image Underst..

[19]  Sanjeev R. Kulkarni,et al.  Local tests for consistency of support hyperplane data , 1996, Journal of Mathematical Imaging and Vision.

[20]  Nicholas I. Fisher,et al.  On the Estimation of a Convex Set from Noisy Data on its Support Function , 1997 .