The Community for Technology Leaders
Green Image
<p>Interest in algebraic curves and surfaces of high degree as geometric models or shape descriptors for different model-based computer vision tasks has increased in recent years, and although their properties make them a natural choice for object recognition and positioning applications, algebraic curve and surface fitting algorithms often suffer from instability problems. One of the main reasons for these problems is that, while the data sets are always bounded, the resulting algebraic curves or surfaces are, in most cases, unbounded. In this paper, the authors propose to constrain the polynomials to a family with bounded zero sets, and use only members of this family in the fitting process. For every even number d the authors introduce a new parameterized family of polynomials of degree d whose level sets are always bounded, in particular, its zero sets. This family has the same number of degrees of freedom as a general polynomial of the same degree. Three methods for fitting members of this polynomial family to measured data points are introduced. Experimental results of fitting curves to sets of points in R/sup 2/ and surfaces to sets of points in R/sup 3/ are presented.</p>
computer vision; matrix algebra; polynomials; surface fitting; curve fitting; polynomials; bounded algebraic curve fitting; surface fitting; geometric models; shape descriptors; model-based computer vision tasks; data sets; bounded zero sets

F. Cukierman, S. Sullivan, G. Taubin, J. Ponce and D. Kriegman, "Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 287-303, 1994.
109 ms
(Ver 3.3 (11022016))