Abstract
A digital annulus is defined as a set of grid points lying between two circles sharing an identical center and separated by a given width. This paper deals with the problem of fitting a digital annulus to a given set of points in a 2D bounded grid. More precisely, we tackle the problem of finding a digital annulus that contains the largest number of inliers. As the current best algorithm for exact optimal fitting has a computational complexity in O(N 3 logN) where N is the number of grid points, we present an approximation method featuring linear time complexity and bounded error in annulus width, by extending the approximation method previously proposed for digital hyperplane fitting. Experiments show some results and runtime in practice.
This work has been partly supported by the French Agence Nationale de la Recherche (ANR-2010-BLAN-0205 03) and a French-Japanese joint research project called the Sakura program (No. 27608XJ).
Chapter PDF
Similar content being viewed by others
References
Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical recipes: the art of scientific computing, 3rd edn. Cambridge University Press (2007)
Rousseeuw, P.J.: Least median of squares regression. Journal of the American Statistical Association 79(388), 871–880 (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(6), 381–395 (1981)
Zrour, R., Kenmochi, Y., Talbot, H., Buzer, L., Hamam, Y., Shimizu, I., Sugimoto, A.: Optimal consensus set for digital line and plane fitting. International Journal of Imaging Systems and Technology 21, 45–47 (2011)
Aiger, D., Kenmochi, Y., Talbot, H., Buzer, L.: Efficient Robust Digital Hyperplane Fitting with Bounded Error. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 223–234. Springer, Heidelberg (2011)
Andres, E., Jacob, M.-A.: The Discrete Analytical Hyperspheres. IEEE TVCG 3(1), 75–86 (1997)
Largeteau-Skapin, G., Zrour, R., Andres, E.: O(n 3 logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 241–252. Springer, Heidelberg (2013)
da Fonseca, G.D., Mount, D.M.: Approximate range searching: The absolute model. Comput. Geom. 43, 434–444 (2010)
O’Rourke, J., Kosaraju, S.R., Megiddo, N.: Computing circular separability. Discrete and Computational Geometry 1(1), 105–113 (1986)
Andres, E., Acharya, R., Sibata, C.: Discrete Analytical Hyperplanes. GMIP 59(5), 302–309 (1997)
Provot, L., Gérard, Y.: Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 284–295. Springer, Heidelberg (2011)
Fiorio, C., Toutant, J.-L.: Arithmetic Discrete Hyperspheres and Separatingness. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 425–436. Springer, Heidelberg (2006)
Costa, L.F.D., Cesar, R.M.: Shape analysis and classification: Theory and practice, 1st edition. CRC Press (2000)
Ding, D., Ping, X., Hu, M., Wang, D.: Range image segmentation based on randomized Hough transform. Pattern Recognition Letters 26(13), 2033–2041 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Phan, M.S., Kenmochi, Y., Sugimoto, A., Talbot, H., Andres, E., Zrour, R. (2013). Efficient Robust Digital Annulus Fitting with Bounded Error. In: Gonzalez-Diaz, R., Jimenez, MJ., Medrano, B. (eds) Discrete Geometry for Computer Imagery. DGCI 2013. Lecture Notes in Computer Science, vol 7749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37067-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-37067-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37066-3
Online ISBN: 978-3-642-37067-0
eBook Packages: Computer ScienceComputer Science (R0)