O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles
From MaRDI portal
Publication:4924475
DOI10.1007/978-3-642-37067-0_21zbMath1382.68303MaRDI QIDQ4924475
Gaëlle Largeteau-Skapin, Eric Andres, Rita Zrour
Publication date: 31 May 2013
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37067-0_21
outliers; digital circle; inliers; shape fitting; consensus set; 0-flake digital circle; 4-connected digital circle
68W40: Analysis of algorithms
68U10: Computing methodologies for image processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)