O(n^3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles
Résumé
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).
Origine | Fichiers produits par l'(les) auteur(s) |
---|