Projectively invariant representations using implicit algebraic curves

Abstract We demonstrate that it is possible to compute polynomial representations of image curves which are unaffected by the projective frame in which the representation is computed. This means that: ‘The curve chosen to represent a projected set of points is the projection of the curve chosen to represent the original set.’ We achieve this by using algebraic invariants of the polynomial in the fitting process. We demonstrate that the procedure works for plane conic curves. For higher order plane curves, or for aggregates of plane conies, algebraic invariants can yield powerful representations of shape that are unaffected by projection, and hence make good cues for model-based vision. Tests on synthetic and real data have yielded excellent results.

[1]  Gerald J. Agin Fitting Ellipses and General Second-Order Curves. , 1981 .

[2]  David A. Forsyth,et al.  Invariance-a new framework for vision , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[3]  Isaac Weiss,et al.  Projective invariants of shapes , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  F. Bookstein Fitting conic sections to scattered data , 1979 .

[5]  G. Rota,et al.  The invariant theory of binary forms , 1984 .

[6]  Vaughan R. Pratt,et al.  Direct least-squares fitting of algebraic surfaces , 1987, SIGGRAPH.

[7]  PAUL D. SAMPSON,et al.  Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm , 1982, Comput. Graph. Image Process..

[8]  W. Eric L. Grimson,et al.  Localizing Overlapping Parts by Searching the Interpretation Tree , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  John Porrill,et al.  Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter , 1990, Image Vis. Comput..

[10]  J. Canny Finding Edges and Lines in Images , 1983 .