Skip to main content
Conference ProceedingsOPEN ACCESS

O(n 3logn) time complexity for the optimal consensus set computation for 4-connected digital circles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7749 LNCS 241-252
DOI: 10.1007/978-3-642-37067-0_21
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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(n 3 log 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). © 2013 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Largeteau-Skapin, G., Zrour, R., & Andres, E. (2013). O(n 3logn) time complexity for the optimal consensus set computation for 4-connected digital circles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7749 LNCS, pp. 241–252). Springer Verlag. https://doi.org/10.1007/978-3-642-37067-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free