Abstract
An annulus is defined as a set of points contained between two circles. This paper presents a method for fitting an annulus to a given set of points in a 2D images in the presence of noise by maximizing the number of inliers, namely the consensus set, while fixing the thickness. We present a deterministic algorithm that searches the optimal solution(s) within a time complexity of O(N 4), N being the number of points.
Chapter PDF
Similar content being viewed by others
References
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. Journal of the ACMĀ 51(4), 606ā635 (2004)
Andres, E., Jacob, M.A.: The discrete analytical hyperspheres. IEEE Transactions on Visualization and Computer GraphicsĀ 3, 75ā86 (1997)
Coeurjolly, D., GĆ©rard, Y., ReveillĆØs, J.P., Tougne, L.: An elementary algorithm for digital arc segmentation. Discrete Applied MathematicsĀ 139(1-3), 31ā50 (2004)
Da Fontoura Da Costa, L., Cesar Jr., R.M.: Shape analysis and classification: Theory and practice, 1st edn. CRC Press, Inc., Boca Raton (2000)
De Berg, M., Bose, P., Bremner, D., Ramaswami, S., Ramaswami, G.: Computing constrained minimum-width annuli of point sets. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.Ā 1272, pp. 392ā401. Springer, Heidelberg (1997)
Ding, D., Ping, X., Hu, M., Wang, D.: Range image segmentation based on randomized hough transform. Pattern Recognition LettersĀ 26(13), 2033ā2041 (2005)
Dunagan, J., Vempala, S.: Optimal outlier removal in high-dimensional spaces. Journal of Computer and System SciencesĀ 68(2), 335ā373 (2004)
Dyer, M.E.: Linear time algorithms for two- and three-variable linear programs. SIAM Journal on ComputingĀ 13(1), 31ā45 (1984)
Fischler, M.A., Bolles, R.C.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACMĀ 24, 381ā395 (1981)
Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM Journal on ComputingĀ 33(2), 269ā285 (2004)
Matousek, J.: On enclosing k points by a circle. Information Processing LettersĀ 53(4), 217ā221 (1995)
Megiddo, N.: Linear-time algorithms for linear programming in r 3 and related problems. SIAM Journal on ComputingĀ 12(4), 759ā776 (1983)
OāRourke, J., Kosaraju, S.R., Megiddo, N.: Computing circular separability. Discrete and Computational GeometryĀ 1, 105ā113 (1986)
Rouche, E., de Comberousse, C., Poincare, H.: TraitƩ de gƩomƩtrie. Edition Jacques Gabay (1900), tomes I et II, 7e Ʃdition, Reprint (1997)
Roussillon, T., Sivignon, S., Tougne, L.: On three constrained versions of the digital circular arc recognition problem. In: Brlek, S., Reutenauer, C., ProvenƧal, X. (eds.) DGCI 2009. LNCS, vol.Ā 5810, pp. 34ā45. Springer, Heidelberg (2009)
Smid, M., Janardan, R.: On the width and roundness of a set of points in the plane. International Journal of Computational GeometryĀ 9(1), 97ā108 (1999)
Zrour, R., Kenmochi, K., Talbot, H., Buzer, L., Hamam, Y., Shimizu, I., Sugimoto, A.: Optimal consensus set for digital plane fitting. In: Proceedings of 3DIM 2009 ICCV Satellite Workshop, pp. 1817ā1824 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zrour, R., Largeteau-Skapin, G., Andres, E. (2011). Optimal Consensus Set for Annulus Fitting. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19867-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-19867-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19866-3
Online ISBN: 978-3-642-19867-0
eBook Packages: Computer ScienceComputer Science (R0)