A method is described for segmenting edge data into a combination of straight lines and elliptic arcs. The two-stage process first segments the data into straight line segments. Ellipses are then fitted to the line data. This is much faster than curve fitting directly to pixel data since the lines provide a great reduction in data. Segmentation is performed in the paradigm suggested by D.G. Lowe (1987). A measure of significance is defined that produces a scale-invariant description and allows the replacement of sequences of line segments by ellipses without requiring any thresholds. A method for fitting ellipses to arbitrary curves, essential for this algorithm, has been developed, based on an iterative Kalman filter. This is guaranteed to produce an elliptical fit even though the best conic fit may be a hyperbola or parabola.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Segmenting curves into elliptic arcs and straight lines


    Contributors:
    Rosin, P.L. (author) / West, G.A.W. (author)


    Publication date :

    1990-01-01


    Size :

    372689 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Segmentation of Planar Curves into Straight-Line Segments and Elliptical Arcs

    Wan, W. / Ventura, J. A. | British Library Online Contents | 1997


    Segmentation of planar curves into circular arcs and line segment

    Chen, J.-M. / Ventura, J. A. / Wu, C.-H. | British Library Online Contents | 1996



    Identifying Salient Circular Arcs on Curves

    Saund, E. | British Library Online Contents | 1993


    Vertical arcs design using polynomial transition curves

    Kobryń, Andrzej | Springer Verlag | 2016