\(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles (Q4924475)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: O(n ^3 n) time complexity for the optimal consensus set computation for 4-connected digital circles |
scientific article; zbMATH DE number 6169463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles |
scientific article; zbMATH DE number 6169463 |
Statements
O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles (English)
0 references
31 May 2013
0 references
shape fitting
0 references
consensus set
0 references
inliers
0 references
outliers
0 references
digital circle
0 references
4-connected digital circle
0 references
0-flake digital circle
0 references
0.7884239554405212
0 references
0.7719253897666931
0 references
0.7574610114097595
0 references
0.7272859811782837
0 references
0.690953254699707
0 references
