Algebraic Curves That Work Better

by T. Tasdizen, J.P. Tarel and David B. Cooper
IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)
June 1999  Fort Collins, Colorado

Abstract

Algebraic curves are practical for modeling shapes much more complicated than conics or superquadrics. The main drawback in representing shapes by algebraic curves has been the lack of repeatability in fitting algebraic curves to data. Usually, arguments against using algebraic curves involve references  to mathematicians Wilkinson and/or Runge. The first goal of this article is to understand the stability issue of algebraic curve fitting. Then a fitting method  based on ridge regression and restricting the representation to well behaved subsets of polynomials is proposed, and its properties are investigated. The fitting algorithm is of sufficient stability for very fast position-invariant shape recognition, position estimation, and shape tracking, based on new invariants and representations. Among appropriate applications are in shape-based indexing into image databases, and  MPEG 7.

Click here to download a compressed (gzip) postscript version of this paper (~300 Kb)

Click here to download a compressed (zip) pdf version of this paper (~350 Kb)