Skip to Main content Skip to Navigation
Conference papers

Efficiently computing optimal consensus of digital line fitting

Abstract : Given a set of discrete points in a 2D digital image containing noise, we formulate our problem as robust digital line fitting. More precisely, we seek the maximum subset whose points are included in a digital line, called the optimal consensus. The paper presents an efficient method for exactly computing the optimal consensus by using the topological sweep, which provides us with the quadratic time complexity and the linear space complexity with respect to the number of input points.
Document type :
Conference papers
Complete list of metadata
Contributor : Yukiko Kenmochi Connect in order to contact the contributor
Submitted on : Thursday, February 21, 2013 - 11:36:20 AM
Last modification on : Wednesday, April 13, 2022 - 5:54:02 PM



Yukiko Kenmochi, Lilian Buzer, Hugues Talbot. Efficiently computing optimal consensus of digital line fitting. 20th International Conference on Pattern Recognition (ICPR), 2010, Aug 2010, Istanbul, Turkey. pp.1064-1067, ⟨10.1109/ICPR.2010.266⟩. ⟨hal-00790826⟩



Record views