Key points are not available for this paper at this time.
In this paper we evaluate several methods of tting data to conic sec-tions. Conic tting is a commonly required task in machine vision, but many algorithms perform badly on incomplete or noisy data. We evalu-ate several algorithms under various noise and degeneracy conditions, identify the key parameters which aect sensitivity, and present the results of comparative experiments which emphasize the algorithms behaviours under common examples of degenerate data. In addition, complexity analyses in terms of counts are provided in order to further inform the choice of algorithm for a specic application. 1
Fitzgibbon et al. (Sun,) studied this question.