Efficient Robust Digital Annulus Fitting with Bounded Error
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(N3 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.
Keywordsfitting annulus approximation halfspace range searching
Unable to display preview. Download preview PDF.
- 1.Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)Google Scholar
- 2.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)Google Scholar
- 7.Andres, E., Jacob, M.-A.: The Discrete Analytical Hyperspheres. IEEE TVCG 3(1), 75–86 (1997)Google Scholar
- 8.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)Google Scholar
- 11.Andres, E., Acharya, R., Sibata, C.: Discrete Analytical Hyperplanes. GMIP 59(5), 302–309 (1997)Google Scholar
- 14.Costa, L.F.D., Cesar, R.M.: Shape analysis and classification: Theory and practice, 1st edition. CRC Press (2000)Google Scholar