We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and the conic, is better than using an algebraic error measure. However, most existing methods rely on algebraic error measures. This is usually motivated by the fact that point-to-conic distances are difficult to compute and the belief that non-linear optimization of conics is computationally very expensive. In this paper, we describe a parameterization for the conic fitting problem that allows to circumvent the difficulty of computing point-to-conic distances, and we show how to perform the non-linear optimization process efficiently.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Conic Fitting Using the Geometric Distance


    Contributors:

    Conference:

    Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007


    Published in:

    Computer Vision – ACCV 2007 ; Chapter : 77 ; 784-795


    Publication date :

    2007-01-01


    Size :

    12 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Direct type-specific conic fitting and eigenvalue bias correction

    Harker, M. / O'Leary, P. / Zsombor-Murray, P. | British Library Online Contents | 2008


    Recovering the Geometry of Single Axis Motions by Conic Fitting

    Jiang, G. / Tsui, H. / Quan, L. et al. | British Library Conference Proceedings | 2001


    Recovering the geometry of single axis motions by conic fitting

    Guang Jiang, / Hung-tat Tsui, / Long Quan, et al. | IEEE | 2001



    Patched Conic Trajectory Code

    Park, Brooke Anderson / Wright, Henry | NTRS | 2012