Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses

Computational Geometry: Theory and Applications

Volumn 19, Issue 1, 2001, Pages 1-33

  Mount, David M ^a   Netanyahu, Nathan S ^a,b  

^a UNIVERSITY OF MARYLAND   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Aligned ellipse fitting; Arrangements; Circular arc fitting; Computational geometry; Randomized algorithms; Range searching; RM estimator; Robust estimation; Theil Sen estimator

Indexed keywords

EID: 0035368709     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00009-8     Document Type: Article

References (53)

1. Agarwal P.K., Matoušek J. On range searching with semialgebraic sets. Discrete Comput. Geom. 11:1994;393-418.
2. Amir I. Algorithms for finding the center of circular fiducials. Comput. Vision Graphics Image Process. 49:1990;398-406.
3. Bookstein F.L. Fitting conic sections to scattered data. Comput. Graphics Image Process. 9:1979;56-71.
4. Brönnimann, Chazelle B. Optimal slope selection via cuttings. Proceedings of the Sixth Canadian Conference on Computational Geometry Saskatton, Saskatchewan, Canada. 2-6 August 1994;99-103.
5. Cabrera J., Meer P. Unbiased estimation of ellipses by bootstrapping. IEEE Trans. Pattern Anal. Machine Intell. 18:1996;752-756.
6. Chaudhuri B.B. Optimal circular fit to objects in two and three dimensions. Pattern Recogn. Lett. 11:1990;571-574.
7. Chaudhuri B.B., Kundu P. Optimum circular fit to weighted data in multi-dimensional space. Pattern Recogn. Lett. 14:1993;1-6.
8. Chazelle B., Welzl E. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4:1989;467-490.
9. Chernoff H. A measure of asymptotic efficiency for test of a hypothesis based on the sum of observations. Ann. Math. Statist. 23:1952;493-507.
10. Cole R., Salowe J.S., Steiger W.L., Szemerédi E. An optimal-time algorithm for slope selection. SIAM J. Comput. 18:1989;792-810.
11. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
12. Dillencourt M.B., Mount D.M., Netanyahu N.S. A randomized algorithm for slope selection. Internat. J. Comput. Geom. Appl. 2:1992;1-27.
13. Donoho D.L., Huber P.J. The notion of breakdown point. Bickel P.J., Doksun K., Hodges J.L. A Festschrift for Erich L. Lehman. 1983;157-184.
14. Duda R.O., Hart P.E. Use of the Hough transformation to detect lines and curves in pictures. Comm. of the ACM. 15:1972;11-15.
15. Edelsbrunner H., Souvaine D.L. Computing median-of-squares regression lines and guided topological sweep. J. Amer. Statist. Assoc. 85:1990;115-119.
16. 0.695) query time. Inform. Process. Lett. 23:1986;289-293.
17. Erdös P., Spencer J. Probabilistic Methods in Combinatorics. 1974;Academic Press, New York.
18. Feller W. An Introduction to Probability Theory and its Applications. 1:1950;Wiley, New York.
19. Floyd R., Rivest R. Expected time bounds for selection. Comm. of the ACM. 8:1975;165-172.
20. Hoare C.A.R. Proof of a program: FIND. Comm. of the ACM. 13:1970;39-45.
21. Guibas L.J., Sedgewick R. A dichromatic framework for balanced trees. Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science. 1978;1-8 IEEE Computer Society.
22. Hampel F.R., Ronchetti E.M., Rousseeuw P.J., Stahel W.A. Robust Statistics: The Approach Based on Influence Functions. 1986;Wiley, New York.
23. Haussler D., Welzl E. ε -nets and simplex range queries. Discrete Comput. Geom. 2:1987;127-151.
24. P.V.C. Hough (1962) Method and means for recognizing complex patterns, U.S. Patent 3,069,654.
25. Huber P.J. Robust Statistics. 1981;Wiley, New York.
26. Joseph S.H. Unbiased least squares fitting of circular arcs. Comput. Vision Graphics Image Process. 56:1994;424-432.
27. Katz M., Sharir M. Optimal slope selection via expanders. Inform. Process. Lett. 47:1993;115-122.
28. Landau U.M. Estimation of a circular arc center and its radius. Comput. Vision Graphics Image Process. 38:1987;317-326.
29. Matoušek J. Randomized optimal algorithm for slope selection. Inform. Process. Lett. 39:1991;183-187.
30. Matoušek J. Efficient partition trees. Discrete Comput. Geom. 8:1992;315-334.
31. Matoušek J., Mount D.M., Netanyahu N.S. Efficient randomized algorithms for the repeated median line estimator. Algorithmica. 20:1998;136-150.
32. Mount D.M., Netanyahu N.S. Efficient algorithms for robust circular arc estimators. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada. August 1993;79-84.
33. Mount D.M., Netanyahu N.S. Computationally efficient algorithms for high-dimensional robust estimators. CVGIP: Graphical Models and Image Processing. 56:1994;289-303.
34. Mount D.M., Netanyahu N.S., Romanik K., Silverman R., Wu A. A practical approximation algorithm for the LMS line estimator. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LO. January 1997;473-482.
35. Netanyahu N.S., Philomin V., Rosenfeld A., Stromberg A.J. Robust detection of road segments in noisy aerial images. Pattern Recogn. 30:1997;1673-1686.
36. Rosin P.L. Ellipse fitting by accumulating five-point fits. Pattern Recogn. Lett. 14:1993;661-669.
37. Rousseeuw P.J. Least median-of-squares regression. J. Amer. Statist. Assoc. 79:1984;871-880.
38. Rousseeuw P.J., Leroy A.M. Robust Regression and Outlier Detection. 1987;Wiley, New York.
39. Semple J.G., Roth L. Introduction to Algebraic Geometry, Oxford University Press, Oxford. 1949.
40. Sen P.K. Estimates of the regression coefficients based on Kendall's Tau. J. Amer. Statist. Assoc. 63:1968;1379-1389.
41. Shafer L., Steiger W.L. Randomizing optimal geometric algorithms. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada. August 1993;133-138.
42. Siegel A.F. Robust regression using repeated medians. Biometrika. 69:1982;242-244.
43. Smith C. An Elementary Treatise on Conic Sections by the Method of Co-ordinate Geometry. 1956;Macmillan, London.
44. Souvaine D.L., Steele J.M. Efficient time and space algorithms for least median of squares regression. J. Amer. Statist. Assoc. 82:1987;794-801.
45. Stein A., Werman M. Robust statistics in shape fitting. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Champaign, IL. June 1992;540-546.
46. Takiyama R., Ono N. A least square error estimation of the center and radii of concentric arcs. Pattern Recogn. Lett. 10:1989;237-242.
47. Theil H. A rank-invariant method of linear and polynomial regression analysis (Parts 1-3). Nederlandse Akad. Wetenchappen Ser. A. 53:1950;386-392. 521-525, 1397-1412.
48. Thomas S.M., Chan Y.T. A simple approach for the estimation of circular arc center and its radius. Comput. Vision Graphics Image Process. 45:1989;362-370.
49. Willard D.E. Polygon retrieval. SIAM J. Comput. 11:1982;149-165.
50. Wolfram S. Mathematica, A System for Doing Mathematics by Computer. 2nd Edition :1991;Addison-Wesley, Redwood City, CA.
51. Wu Z., Wu L., Wu A. The robust algorithms for finding the center of an arc. Comput. Vision Image Understanding. 62:1995;269-278.
52. Yuen P.C., Feng G.C. A novel method for parameter estimation of [a] digital arc. Pattern Recogn. Lett. 17:1996;929-938.
53. Yi S., Haralick R.M., Shapiro L.G. Error propagation in machine vision. Machine Vision Appl. 7:1994;93-114.