Further Improving Geometric Fitting

Authors:
Kenichi Kanatani
Affiliations:
Okayama University
Venue:
3DIM '05 Proceedings of the Fifth International Conference on 3-D Digital Imaging and Modeling
Year:
2005

Citing 0
Cited 5

When are Simple LS Estimators Enough? An Empirical Study of LS, TLS, and GTLS

International Journal of Computer Vision
On the Convergence of Fitting Algorithms in Computer Vision

Journal of Mathematical Imaging and Vision
Statistical Optimization for Geometric Fitting: Theoretical Accuracy Bound and High Order Error Analysis

International Journal of Computer Vision
Ellipse fitting with hyperaccuracy

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Generalized, basis-independent kinematic surface fitting

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in the limit of small noise rather than in the limit of a large number of data as recommended in the statistical literature. Taking the KCR lower bound as an optimality requirement and focusing on the linearized constraint case, we compare the accuracy of Kanataniýs renormalization with maximum likelihood (ML) approaches including the FNS of Chojnacki et al. and the HEIV of Leedan and Meer. Our analysis reveals the existence of a method superior to all these.