Journal of Mathematical Imaging and Vision

, Volume 24, Issue 2, pp 229–244 | Cite as

Shape Estimation from Support and Diameter Functions

  • Amyn Poonawala
  • Peyman Milanfar
  • Richard J. Gardner


We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algorithms are proposed, based on the parametrization of the shape by its Extended Gaussian Image. This parametrization facilitates a systematic statistical analysis of the problem via the Cramér-Rao lower bound (CRLB), which provides a fundamental lower bound on the performance of estimation algorithms. Using CRLB, we also generate confidence regions which conveniently display the effect of parameters like eccentricity, scale, noise, and measurement direction set, on the quality of the estimated shapes, as well as allow a performance analysis of the algorithms.


support function diameter function brightness function Extended Gaussian Image parametric shape estimation constrained Cramér-Rao lower bound confidence regions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis, Wiley-Interscience: New York, 1973.Google Scholar
  2. 2.
    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. Amer. Statist. Assoc., Vol. 92, No. 437, pp. 84–91, 1997.MathSciNetGoogle Scholar
  3. 3.
    R.J. Gardner, Geometric Tomography, Cambridge University Press: New York, 1995.Google Scholar
  4. 4.
    R.J. Gardner, M. Kiderlen, and P. Milanfar, “Convergence of algorithms for reconstructing convex bodies and directional measures,” Ann. Statist., to appear.Google Scholar
  5. 5.
    R.J. Gardner and P. Milanfar, “Shape reconstruction from brightness functions,” in SPIE Conference on Advanced Signal Processing Algorithms, Architectures, and Implementations X, Vol. 4474, August 2001, San Diego, CA.Google Scholar
  6. 6.
    R.J. Gardner and P. Milanfar, “Reconstruction of convex bodies from brightness functions,” Discrete Comput. Geom., Vol. 29, pp. 279–303, 2003.MathSciNetGoogle Scholar
  7. 7.
    G.H. Golub and V. Pereyra, “The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate,” SIAM J. Numer. Anal., Vol. 10, pp. 413–432, 1973.CrossRefMathSciNetGoogle Scholar
  8. 8.
    J.D. Gorman and A.O. Hero, “Lower bounds for parametric estimation with constraints,” IEEE Trans. Inform. Theory, Vol. 26. No. 6, pp. 1285–1301, 1990.MathSciNetGoogle Scholar
  9. 9.
    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, 1999.CrossRefGoogle Scholar
  10. 10.
    B.K.P. Horn, Robot Vision, The MIT Press: Cambridge, MA, 1986.Google Scholar
  11. 11.
    V. Hosel and S. Walcher, “Clustering techniques: A brief survey,” Technical Report, Institute of Biomathematics and Biometry, 2001.Google Scholar
  12. 12.
    S. Kay, Fundamentals of Statistical Signal Processing, Prentice-Hall: Englewood Cliffs, NJ, 1993.Google Scholar
  13. 13.
    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. Amer. A, Vol. 9, pp. 1693–1714, 1992.Google Scholar
  14. 14.
    S.Y.R. Li, “Reconstruction of polygons from projections,” Inform. Process. Lett., Vol. 28, pp. 235–240, 1988.Google Scholar
  15. 15.
    M. Lindenbaum and A. Bruckstein, “Blind Approximation of Planar Convex Sets,” IEEE Trans. Robotics and Automation, Vol. 10, No. 4, pp. 517–529, 1994.CrossRefGoogle Scholar
  16. 16.
    J.J. Little, “An iterative method for reconstructing convex polyhedra from extended Gaussian images,” in Proc. AAAI National Conf. Artificial Intelligence, Washington, D.C, 1983, pp. 247–250.Google Scholar
  17. 17.
    S.K. Lodha and R. Franke, “Scattered data techniques for surfaces,” in Proc. Dagstuhl Conf. on Scientific Visualization, IEEE Computer Society Press, 1999, pp. 182–222.Google Scholar
  18. 18.
    E. Mammen, J.S. Marron, B.A. Turlach, and M.P. Wand, “A general projection framework for constrained smoothing,” Statist. Sci., Vol. 16, No. 3, pp. 232–248, 2001.MathSciNetGoogle Scholar
  19. 19.
    K. V. Mardia and P. E. Jupp, Directional Statistics, John Wiley and Sons: Chichester, 2000.Google Scholar
  20. 20.
    A. Poonawala, “Reconstructing shapes from support and brightness functions,” Masters Thesis, Computer Engineering Department, University of California Santa Cruz, 2004.Google Scholar
  21. 21.
    A. Poonawala, P. Milanfar, and R.J. Gardner, “A statistical analysis of shape recontruction from areas of shadows,” in 36th Asilomar Conference on Signal Systems and Computers, Vol. 1, pp. 916–920, November 2002.Google Scholar
  22. 22.
    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, 1990.CrossRefGoogle Scholar
  23. 23.
    A.S. Rao and K.Y. Goldberg, “Shape from diameter: Recognizing polygonal parts with a parallel-jaw gripper,” Intl. J. of Robotics Research, Vol. 13, No. 1, pp. 1637, 1994.Google Scholar
  24. 24.
    T.J. Richardson, “Approximation of planar convex sets from hyperplane probes,” Discrete Comput. Geom., Vol. 18, pp. 151–177, 1997.CrossRefMATHMathSciNetGoogle Scholar
  25. 25.
    R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Cambridge University Press: Cambridge, 1993.Google Scholar
  26. 26.
    P. Stoica and B.C. Ng, “On the Cramér-Rao bound under parametric constraints,” IEEE Signal Processing Letters, Vol. 5, No. 7, pp. 177–179, 1998.CrossRefGoogle Scholar
  27. 27.
    J. C. Ye, Y. Bresler, and P. Moulin, “Asymptotic global confidence regions in parametric shape estimation problems,” IEEE Trans. Inform. Theory, Vol. 46, No. 5, pp. 1881–1895, 2000.MathSciNetGoogle Scholar
  28. 28.
    J.C. Ye, Y. Bresler, and P. Moulin, “Cramér-Rao bounds for parametric shape estimation in inverse problems,” IEEE Trans. on Image Processing, Vol. 12, No. 1, pp. 71–83, 2003.MathSciNetGoogle Scholar
  29. 29.
    P. Zhingeng, Z. Kun, and S. Jiaoying, “A new mesh simplification algorithm based on triangle collapses,” J. Comput. Sci. Tech., Vol. 16, No. 1, pp. 57–63, 2001.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  • Amyn Poonawala
    • 1
  • Peyman Milanfar
    • 2
  • Richard J. Gardner
    • 3
  1. 1.Department of Computer EngineeringUniversity of CaliforniaSanta CruzUSA
  2. 2.Department of Electrical EngineeringUniversity of CaliforniaSanta CruzUSA
  3. 3.Department of MathematicsWestern Washington UniversityBellinghamUSA

Personalised recommendations