Skip to main content
SpringerLink
Log in

A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10043))

  • 1201 Accesses

Abstract

We study heuristics to accelerate existing state-of-the-art algorithms for the minimum-volume enclosing ellipsoid problem. We propose a new filtering heuristic that can significantly reduce the number of distance computations performed in algorithms derived from Khachiyan’s first-order algorithm. Our experiments indicate that in high dimensions, the filtering heuristic is more effective than the elimination heuristic proposed by Harman and Pronzato. In lower dimensions, the elimination heuristic is superior.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahipaşaoğlu, S.D., Yıldırım, E.A.: Identification and elimination of interior points for the minimum enclosing ball problem. SIAM J. Optim. 19(3), 1392–1396 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barnett, V.: The ordering of multivariate data. J. Roy. Stat. Soc. Ser. A (Gen.) 139(3), 318–355 (1976)

    Article  MathSciNet  Google Scholar 

  3. Betke, U., Henk, M.: Approximating the volume of convex bodies. Discret. Comput. Geom. 10(1), 15–21 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bouville, C.: Bounding ellipsoids for ray-fractal intersection. In: Proceedings of SIGGRAPH 1985, pp. 45–52. ACM (1985)

    Google Scholar 

  5. Chazelle, B., Matoušek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579–597 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ding, J., Zhou, A.: Eigenvalues of rank-one updated matrices with some applications. Appl. Math. Lett. 20(12), 1223–1226 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Galkovskyi, T., Gärtner, B., Rublev, B.: The domination heuristic for LP-type problems. In: Proceedings of the Meeting on Algorithm Engineering and Experiments, pp. 74–84. Society for Industrial and Applied Mathematics (2009)

    Google Scholar 

  8. Harman, R., Pronzato, L.: Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms. Stat. Probab. Lett. 77(1), 90–94 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, Presented to R. Courant on His 60th Birthday, pp. 187–204. Wiley Interscience (1984)

    Google Scholar 

  10. Källberg, L., Larsson, T.: Faster approximation of minimum enclosing balls by distance filtering and GPU parallelization. J. Graph. Tools 17(3), 67–84 (2013)

    Article  Google Scholar 

  11. Källberg, L., Larsson, T.: Improved pruning of large data sets for the minimum enclosing ball problem. Graph. Models 76(6), 609–619 (2014)

    Article  Google Scholar 

  12. Khachiyan, L.G.: Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21(2), 307–320 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kumar, P., Yildirim, E.A.: Minimum-volume enclosing ellipsoids and core sets. J. Optim. Theor. Appl. 126(1), 1–21 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Liu, S., Wang, C.C.L., Hui, K.-C., Jin, X., Zhao, H.: Ellipsoid-tree construction for solid objects. In: Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, pp. 303–308 (2007)

    Google Scholar 

  15. Rimon, E., Boyd, S.P.: Obstacle collision detection using best ellipsoid fit. J. Intell. Rob. Syst. 18(2), 105–126 (1997)

    Article  MATH  Google Scholar 

  16. Sun, P., Freund, R.M.: Computation of minimum-volume covering ellipsoids. Oper. Res. 52(5), 690–706 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Titterington, D.M.: Optimal design: some geometrical aspects of \(D\)-optimality. Biometrika 62(2), 313–320 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  18. Titterington, D.M.: Estimation of correlation coefficients by ellipsoidal trimming. Appl. Stat. 27(3), 227–234 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  19. Todd, M.J., Yıldırım, E.A.: On Khachiyan’s algorithm for the computation of minimum-volume enclosing ellipsoids. Discret. Appl. Math. 155(13), 1731–1744 (2007)

    Article  MATH  Google Scholar 

  20. Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  21. Yıldırım, E.A.: On the minimum volume covering ellipsoid of ellipsoids. SIAM J. Optim. 17(3), 621–641 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mälardalen University, Västerås, Sweden

    Linus Källberg & Thomas Larsson

Authors
  1. Linus Källberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Larsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linus Källberg .

Editor information

Editors and Affiliations

  1. University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  2. City University of Hong Kong, Hong Kong, China

    Minming Li

  3. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Källberg, L., Larsson, T. (2016). A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48749-6_56

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation