Quantile approximation for robust statistical estimation and k-enclosing problems

International Journal of Computational Geometry and Applications

Volumn 10, Issue 6, 2000, Pages 593-608

  Mount, David M ^a   Netanyahu, Nathan S ^b,c   Piatko, Christine D ^d   Silverman, Ruth ^c   Wu, Angela Y ^e  

^a University of Maryland ^*  (United States)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF MARYLAND   (United States)

^d JOHNS HOPKINS UNIVERSITY   (United States)

^e AMERICAN UNIVERSITY   (United States)

Author keywords

LMS regression; Minimum enclosing disk; Minimum volume ball ellipsoid annulus estimator; Robust estimation

Indexed keywords

EID: 0034555431     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000334     Document Type: Article

References (38)

1. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. Journal of Algorithms, 17:292-318, 1994.
2. A. Aggarwal, H. Imai, N. Katoh, and S. Suri. Finding k points with minimum diameter and related problems. Journal of Algorithms, 12:38-56, 1991.
3. J. Agulló. Exact iterative computation of the multivariate minimum volume ellipsoid estimator with a branch and bound algorithm. Proceedings of the Twelfth COMPSTAT Symposium on Computational Statistics, Barcelona, Spain, August 1996. A. Prat, ed., Physica-Verlag, 175-180.
4. J. Agulló. Exact algorithms for computing the least median of squares estimate in multiple linear regression algorithm. Presented at the Third International Conference on Statistical Data Analysis based on the L1-Norm and Related Methods, Neuchatel, Switzerland, August, 1997.
5. R. D. Cook, D. M. Hawkins, and S. Weisberg. Exact iterative computation of the robust multivariate minimum volume ellipsoid estimator. Statistics and Probability Letters, 16:213-218, 1993.
6. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. Journal of Algorithms, 21:579-597, 1996.
7. L. Danzer, D. Laugwitz, and H. Lenz. Über das Löwnersche Ellipsoid und sein Analogon unter sen einem Eikörper eingeschriebenen Ellipsoiden. Arch. Math., 8:214-219, 1957.
8. A. Datta, H. P. Lenhof, C. Schwarz, M. Smid. Static and dynamic algorithms for k-point clustering problems. Lecture Notes in Computer Science, vol. 70, Springer, Berlin, 1993, 265-276.
9. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9:66-104, 1990.
10. H. Edelsbrunner and D. L. Souvaine. Computing median-of-squares regression lines and guided topological sweep. Journal of the American Statistical Association, 85:115-119, 1990.
11. A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Computational Geometry Theory and Applications, 4:119-136, 1994.
12. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete & Computational Geometry, 11: 321-350, 1994.
13. J. García-López, P. Ramos and J. Snoeyink. Fitting a set of points by a circle. Discrete & Computational Geometry, 20: 389-402, 1998.
14. B. Gärtner and S. Schönherr. Smallest enclosing ellipses - Fast and exact. Technical report B 97-03, Freie University, Berlin, 1997.
15. D. M. Hawkins. The feasible set algorithm for least median of squares regression. Computational Statistics and Data Analysis, 16:81-101, 1993.
16. D. M. Hawkins. The feasible set algorithm for the minimum volume ellipsoid estimator in multivariate data. Computational Statistics, 8:95-107, 1993.
17. J. Matoušek. Efficient partition trees. Discrete & Computational Geometry, 8:315-334, 1992.
18. J. Matoušek. On enclosing k points by a circle. Information Processing Letters, 53:217-221, 1995.
19. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16:498-516.
20. P. Meer, D. Mintz, A. Rosenfeld, and D. Y. Kim. Robust regression methods for computer vision - A review. International Journal of Computer Vision, 6:59-70, 1991.
21. D. M. Mount, N. S. Netanyahu, K. Romanik, R. Silverman, and A. Wu. A practical approximation algorithm for the LMS line estimator. Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, January 1997, 473-482.
22. N. S. Netanyahu, V. Philomin, A. Rosenfeld, and A. J. Stromberg. Robust detection of road segments in noisy aerial images. Pattern Recognition, 30:1673-1686, 1997.
23. J. O'Rourke. Finding minimal enclosing boxes. International Journal of Computer and Information Sciences, 14:183-199, 1985.
24. J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin. An optimal algorithm for finding minimal enclosing triangles. Journal of Algorithms, 7:258-269, 1986.
25. P. J. Rousseeuw. Least median-of-squares regression. Journal of the American Statistical Association, 79:871-880, 1984.
26. P. J. Rousseeuw and A. M. Leroy. Robust Regression and Outlier Detection. Wiley, New York, 1987.
27. P. J. Rousseeuw and B. L. van Zomeren. Unmasking multiple outliers and leverage points (with comments and rejoinder). Journal of the American Statistical Association, 85:633-651, 1990.
28. S. Schönherr. Berechnung kleinster Ellipsoide um Punktemengen. Diploma thesis, Freie University Berlin, 1994.
29. M. Segal and K. Kedem. Enclosing k points in the smallest axis parallel rectangle. Information Processing Letters, 65:95-99, 1998.
30. B. W. Silverman and D. M. Titterington. Minimum covering ellipses. SIAM Journal on Scientific and Statistical Computing, 1:401-409, 1980.
31. S. Skyum. A simple algorithm for computing the smallest enclosing circle. Information Processing Letters, 37:121-125, 1991.
32. D. L. Souvaine and J. M. Steele. Time- and space- efficient algorithms for least median of squares regression. Journal of the American Statistical Association, 82:794-801, 1987.
33. A. Stein and M. Werman. Robust statistics in shape fitting. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Champaign, Illinois, June 1992, 540-546.
34. C. V. Stewart. MINPRAN: A new robust estimator for computer vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:925-938, 1996.
35. A. J. Stromberg. Computing the exact least median of squares estimate and stability diagnostics in multiple linear regression. SIAM Journal on Scientific Computing, 14:1289-1299, 1993.
36. D. M. Titterington. Optimal design: Some geometrical aspects of D-optimality. Biometrika, 62:313-320, 1975.
37. E. Welzl. Smallest enclosing disks (balls and ellipses). In H. Maurer, ed., LNCS 555 (New Results and New Trends in Computer Science), 359-370. Springer Verlag, 1991.
38. V. J. Yohai. High breakdown-point and high efficiency robust estimates for regression. The Annals of Statistics, 15:642-656, 1987.