Subscribe
Issue No.03 - March (2009 vol.31)
pp: 556-562
Richard j. Gardner , Western Washington University, Bellingham
Markus Kiderlen , University of Aarhus, Aarhus
ABSTRACT
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.
INDEX TERMS
Least squares methods, Optimization, Numerical Analysis, Shape, Inverse problems, Partial Differential Equations, Mathematics of Computing
CITATION
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
REFERENCES
 [1] J.L. Prince and A.S. Willsky, “Estimating Convex Sets from Noisy Support Line Measurements,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 4, pp. 377-389, Apr. 1990. [2] A.S. Lele, S.R. Kulkarni, and A.S. Willsky, “Convex Polygon Estimation from Support Line Measurements and Applications to Target Reconstruction from Laser Radar Data,” J. Optical Soc. Am. A, vol. 9, pp. 1693-1714, 1992. [3] J. Gregor and D. Huff, “A Focus of Attention Preprocessing Scheme for EM-ML PET Reconstruction,” IEEE Trans. Medical Imaging, vol. 16, pp. 218-233, 1997. [4] J. Gregor and F.R. Rannou, “Three-Dimensional Support Function Estimation and Application for Projection Magnetic Resonance Imaging,” Int'l J. Imaging Systems and Technology, vol. 12, pp. 43-50, 2002. [5] J. Gregor, S. Gleason, M. Paulus, and J. Cates, “Fast Feldkamp Reconstruction Based on Focus of Attention and Distributed Computing,” Int'l J. Imaging Systems and Technology, vol. 12, pp. 229-234, 2002. [6] M. Ikehata and T. Ohe, “A Numerical Method for Finding the Convex Hull of Polygonal Cavities Using the Enclosure Method,” Inverse Problems, vol. 18, pp. 111-124, 2002. [7] R. Schneider, Convex Bodies: The Brunn-Minkowski Theory. Cambridge Univ. Press, 1993. [8] R.J. Gardner, Geometric Tomography, second ed. Cambridge Univ. Press, 2006. [9] J. Serra, Image Analysis and Mathematical Morphology. Academic Press, 1982. [10] W.C. Karl, S.R. Kulkarni, G.V. Verghese, and A.S. Willsky, “Local Tests for Consistency of Support Hyperplane Data,” J. Math. Imaging and Vision, vol. 6, pp. 249-269, 1995. [11] P.C. Gaston and R. Lozano-Perez, “Tactile Recognition and Localization Using Model Objects: The Case of Polyhedra on the Plane,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 257-266, 1984. [12] J.L. Schneiter and T.B. Sheridan, “An Automated Tactile Sensing Strategy for Planar Object Recognition and Localization,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 8, pp. 775-786, Aug. 1990. [13] M. Lindenbaum and A. Bruckstein, “Blind Approximation of Planar Convex Sets,” IEEE Trans. Robotics and Automation, vol. 10, no. 4, pp. 517-529, 1994. [14] P.K. Ghosh and K.V. Kumar, “Support Function Representation of Convex Bodies, Its Application in Geometric Computing, and Some Related Representations,” Computer Vision and Image Understanding, vol. 72, no. 3, pp. 379-403, 1998. [15] N.I. Fisher, P. Hall, B. Turlach, and G.S. Watson, “On the Estimation of a Convex Set from Noisy Data on Its Support Function,” J. Am. Statistical Assoc., vol. 92, no. 937, pp. 84-91, 1997. [16] P. Hall and B. Turlach, “On the Estimation of a Convex Set with Corners,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 3, pp. 225-234, Mar. 1999. [17] E. Mammen, J.S. Marron, B.A. Turlach, and M.P. Wand, “A General Projection Framework for Constrained Smoothing,” Statistical Science, vol. 16, no. 3, pp. 232-248, 2001. [18] H. Groemer, Geometric Applications of Fourier Series and Spherical Harmonics. Cambridge Univ. Press, 1996. [19] R.J. Gardner, M. Kiderlen, and P. Milanfar, “Convergence of Algorithms for Reconstructing Convex Bodies and Directional Measures,” Annals of Statistics, vol. 34, pp. 1331-1374, 2006. [20] A. Poonawala, P. Milanfar, and R.J. Gardner, “Shape Estimation from Support and Diameter Functions,” J. Math. Imaging Vision, vol. 24, pp. 229-244, 2006.