Skip to main content
Log in

Consistency method for measurements of the support function of a convex body in the metric of L

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

A new algorithm is proposed for estimation of convex body support function measurements in L metric, which allows us to obtain the solution in quadratic time (with respect to the number of measurements) not using linear programming. The rate of convergence is proved to be stable for quite weak conditions on input data. This fact makes the algorithm robust for a wider class of problems than it was previously. The implemented algorithm is stable and predictable unlike other existing support function estimation algorithms. Implementation details and testing results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. L. Prince and A. S. Willsky, “Reconstructing Convex Sets from Support Line Measurements,” IEEE Trans. Pattern Anal. and Machine Intel. 12 (4), 377 (1990).

    Article  Google Scholar 

  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. Opt. Soc. Amer. A. 9 (10), 1693 (1992).

    Article  Google Scholar 

  3. J. Gregor and F. R. Rannou, “Least-Squares Framework for Projection {MRI} Reconstruction,” Proc. SPIE. 4322, 888 (2001).

    Article  Google Scholar 

  4. J. Gregor and F. R. Rannou, “Three-Dimensional Support Function Estimation and Application for Projection Magnetic Resonance Imaging,” Int. J. Imaging Systems and Technol. 12 (1), 43 (2002).

    Article  Google Scholar 

  5. I. A. Palachev, “The Method of Exclusion of Redundant Restrictions in the Problem of Body Reconstruction from its Support Function Measurements,” Vychisl. Metody Program. 16, 348 (2015).

    Google Scholar 

  6. R. J. Gardner and M. Kiderlen, “A New Algorithm for 3D Reconstruction from Support Functions,” IEEE Trans. Pattern Anal. and Machine Intel. 31 (3), 556 (2009).

    Article  MathSciNet  Google Scholar 

  7. A. Wachter and L. T. Biegler, “On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming,” Math. Program. 106 (1), 25 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Wachter and L. T. Biegler, “Line Search Filter Methods for Nonlinear Programming: Local Convergence,” SIAM J. Optim. 16 (1), 32 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  9. A. Wachter and L. T. Biegler, “Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence,” SIAM J. Optim. 16 (1), 1 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  10. O. Devillers, “The Delaunay Hierarchy,” Int. J. Foundations of Computer Science. 13, 163 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  11. D. Attali and J.-D. Boissonnat, “A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces,” Discr. and Comp. Geom. 31 (3), 369 (2004).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. A. Palachev.

Additional information

Original Russian Text © I.A. Palachev, 2017, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2017, Vol. 72, No. 4, pp. 27–31.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Palachev, I.A. Consistency method for measurements of the support function of a convex body in the metric of L . Moscow Univ. Math. Bull. 72, 161–164 (2017). https://doi.org/10.3103/S0027132217040040

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132217040040

Navigation