Efficient robust digital annulus fitting with bounded error

Authors:
Minh Son Phan;Yukiko Kenmochi;Akihiro Sugimoto;Hugues Talbot;Eric Andres;Rita Zrour
Affiliations:
LIGM, UPEMLV-ESIEE-CNRS, Université Paris-Est, France,LSIIT, Université de Strasbourg, France;LIGM, UPEMLV-ESIEE-CNRS, Université Paris-Est, France;National Institute of Informatics, Japan;LIGM, UPEMLV-ESIEE-CNRS, Université Paris-Est, France;Laboratory XLIM, SIC Department, University of Poitiers, France;Laboratory XLIM, SIC Department, University of Poitiers, France
Venue:
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Year:
2013

Citing 12
Cited 1

Discrete analytical hyperplanes

Graphical Models and Image Processing
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
Shape Analysis and Classification: Theory and Practice

Shape Analysis and Classification: Theory and Practice
The Discrete Analytical Hyperspheres

IEEE Transactions on Visualization and Computer Graphics
Convex Optimization

Convex Optimization
Range image segmentation based on randomized Hough transform

Pattern Recognition Letters
Numerical Recipes 3rd Edition: The Art of Scientific Computing

Numerical Recipes 3rd Edition: The Art of Scientific Computing
Approximate range searching: The absolute model

Computational Geometry: Theory and Applications
Efficient robust digital hyperplane fitting with bounded error

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Estimation of the derivatives of a digital function with a convergent bounded error

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Arithmetic discrete hyperspheres and separatingness

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
O(n 3logn) time complexity for the optimal consensus set computation for 4-Connected Digital Circles

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

O(n 3logn) time complexity for the optimal consensus set computation for 4-Connected Digital Circles

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

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(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.