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

Authors:
Gaelle Largeteau-Skapin;Rita Zrour;Eric Andres
Affiliations:
Laboratoire XLIM-SIC UMR CNRS 7252, Université de Poitiers, Futuroscope Chasseneuil Cedex, France;Laboratoire XLIM-SIC UMR CNRS 7252, Université de Poitiers, Futuroscope Chasseneuil Cedex, France;Laboratoire XLIM-SIC UMR CNRS 7252, Université de Poitiers, Futuroscope Chasseneuil Cedex, France
Venue:
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Year:
2013

Citing 11
Cited 1

On enclosing k points by a circle

Information Processing Letters
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
The Discrete Analytical Hyperspheres

IEEE Transactions on Visualization and Computer Graphics
Shape Fitting with Outliers

SIAM Journal on Computing
Optimal outlier removal in high-dimensional spaces

Journal of Computer and System Sciences - STOC 2001
On three constrained versions of the digital circular arc recognition problem

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Efficient robust digital hyperplane fitting with bounded error

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Analytical description of digital circles

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Optimal consensus set for annulus fitting

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
Efficient robust digital annulus fitting with bounded error

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

Efficient robust digital annulus fitting with bounded error

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for fitting 4-connected digital circles to a given set of points in 2D images in the presence of noise by maximizing the number of inliers, namely the optimal consensus set, while fixing the thickness. Our approach has a O(n3log n) time complexity and O(n) space complexity, n being the number of points, which is lower than previous known methods while still guaranteeing optimal solution(s).