The convergence performance of typical numerical schemes for geometric fitting for computer vision applications is compared. First, the problem and the associated KCR lower bound are stated. Then, three well known fitting algorithms are described: FNS, HEIV, and renormalization.
To these, we add a special variant of Gauss-Newton iterations. For initialization of iterations, random choice, least squares, and Taubin’s method are tested. Numerical simulations and real image experiments and conducted for fundamental matrix computation and ellipse
fitting, which reveals different characteristics of each method.