
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
G. Taubin, F. Cukierman, S. Sullivan, J. Ponce, D.J. Kriegman, "Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 3, pp. 287303, March, 1994.  
BibTex  x  
@article{ 10.1109/34.276128, author = {G. Taubin and F. Cukierman and S. Sullivan and J. Ponce and D.J. Kriegman}, title = {Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {3}, issn = {01628828}, year = {1994}, pages = {287303}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.276128}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting IS  3 SN  01628828 SP287 EP303 EPD  287303 A1  G. Taubin, A1  F. Cukierman, A1  S. Sullivan, A1  J. Ponce, A1  D.J. Kriegman, PY  1994 KW  computer vision; matrix algebra; polynomials; surface fitting; curve fitting; polynomials; bounded algebraic curve fitting; surface fitting; geometric models; shape descriptors; modelbased computer vision tasks; data sets; bounded zero sets VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Interest in algebraic curves and surfaces of high degree as geometric models or shape descriptors for different modelbased 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.
[1] A. Albano, "Representation of digitized contours in terms of conic arcs and strightline segments,"Comput. Graphics and Image Processing, vol. 3, pp. 2333, 1974.
[2] E. Artin, "Uber die zerlegung definiter functionen in quadrate,"Hamb. Abh., vol. 5, pp. 100115, 1927.
[3] R. Bajcsy and F. Solina, "Threedimensional object representation revisited," inProc. 1st Int. Conf. Computer Vision, London, June 1987, pp. 231240.
[4] R. H. Biggerstaff, "Three variations in dental arch form estimated by a quadratic equation,"J. Dental Research, vol. 51, p. 1509, 1972.
[5] T. O. Binford, "Visual perception by computer," inProc. IEEE Conf. Systems and Control, 1971.
[6] J. Bochnak, M. Coste, and M.F. Roy.Géométrie algébrique réelle, vol. 12 ofErgebnisse der Mathematik und ihrer Grenzgebiete. Berlin: Springer, 1987.
[7] R. M. Bolle and D. B. Cooper, "Bayesian recognition of local 3D shape by approximating image intensity functions with quadric polynomials,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI6, no. 4, July 1984.
[8] R. M. Bolle and D.B. Cooper, "On optimally combining pieces of information, with application to estimating 3D complexobject position from range data,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, pp. 619638, Sept. 1986.
[9] F. L. Bookstein, "Fitting conic sections to scattered data,"Comput. Vision, Graphics, Image Processing, vol. 9, pp. 5671, 1979.
[10] R. W. Brockett, "Lie algebras and lie groups in control theory," inGeometrical Methods in System Theory, D. Q. Mayne and R. W. Brockett, Eds. Dordrecht, The Netherlands: Reidel, 1973, pp. 4382.
[11] R. A. Brooks, "Symbolic reasoning among 3D models and 2D images,"Artificial Intell., vol. 17, pp. 285348, 1981.
[12] B. CernuschiFrias, "Orientation and location parameter estimation of quadric surfaces in 3D from a sequence of images," Ph.D. dissertation, Brown Univ., Providence, RI, May 1984.
[13] D. S. Chen, "A datadriven intermediate level feature extraction algorithm,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 7, July 1989.
[14] D. B. Cooper and N. Yalabik, "On the computational cost of approximating and recognizing noiseperturbed straight lines and quadratic arcs in the plane,"IEEE Trans. Comput., vol. C25, no. 10, pp. 10201032, Oct. 1976.
[15] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[16] R.T. Farouki, "TrimmedSurface Algorithms for the Evaluation and Interrogation of Solid Boundary Representations,"IBM J. of Research and Development, Vol. 31, 1987, pp. 314333.
[17] O. D. Faugeras, M. Hebert, and E. Pauchon, "Segmentation of range data into planar and quadric patches," inProc. IEEE Conf. Computer Vision and Pattern Recognition, 1983.
[18] D. A. Forsyth, J. L. Mundy, A. Zisserman, and C. M. Brown, "Projectively invariant representations using implicit algebraic curves," inProc. European Conf. Computer Vision, June 1990.
[19] G. Golub and C. F. Van Loan,Matrix Computations. Baltimore: John Hopkins University Press, 1983.
[20] A. D. Gross and T. E. Boult, "Error of fit measures for recovering parametric solids," inProc. 2nd Int. Conf. Comput. vision, Dec. 1988, pp. 690694.
[21] E. L. Hall, J. B. K. Tio, C. A. McPherson, and F. A. Sadjadi, "Measuring curved surfaces for robot vision,"IEEE Comput., pp. 4254, Dec. 1982.
[22] S. Helgason,Groups and Geometric Analysis. New York: Academic, 1984.
[23] D. Hilbert, "Uber die darstellung definiter formen als summe von formenquadraten,"Math. Ann., vol. 32, pp. 342350, 1988.
[24] D. Keren, D. Cooper, and J. Subrahmonia, "Describing complicated objects by implicit polynomials,"IEEE Trans. Pattern Anal. Machine Intell., vol. 16, no. 1, pp. 3853, Jan. 1994.
[25] D. J. Kriegman and J. Ponce, "On recognizing and positioning curved 3D objects from image contours,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 12, pp. 11271137, 1990.
[26] K. A. Paton, "Conic sections in chromosome analysis,"Pattern Recogn., vol. 2, p. 39, 1970.
[27] J. Ponce, A. Hoogs, and D. J. Kriegman, "On using CAD models to compute the pose of curved 3D objects,"CVGIP: Image Understanding, vol. 55, no. 2, pp. 184197, Mar. 1992.
[28] V. Pratt, "Direct least squares fitting of algebraic surfaces,Comput. Graphics, vol. 21, no. 4, pp. 145152, July 1987.
[29] M. Rioux and L. Cournoyer, "The NRCC threedimensional image data files," National ResearchCouncil of Canada, CNRC 29077, June 1988.
[30] L. G. Roberts, "Machine perception of threedimensional solids," inOptical and ElectraOptical Information Processing, J. T. Tippettet al., Ebs. Cambridge, MA: MIT Press, 1965, pp. 159197.
[31] R. M. Robinson, "Some definite polynomials which are not sums of squares of real polynomials," pp. 264282, Acad. Sci. USSR, 1973.
[32] P. D. Sampson, "Fitting conic sections to very scattered data: an iterative refinment of the bookstein algorithm,"Comput. Vision, Graphics, Image Processing, vol. 18, pp. 97108, 1982.
[33] T. W. Sederberg, D. C. Anderson, and R. N. Goldman, "Implicit representation of parametric curves and surfaces,"Comput. Vision, Graphics, Image Processing, vol. 28, pp. 7284, 1984.
[34] F. Solina, "Shape recovery and segmentation with deformable part models," Ph.D. dissertation, Univ. Pennsylvania, 1987.
[35] F. Solina and R. Bajcsy, "Recovery of parametric models from range images: The case for superquadrics with global deformations,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 2, pp. 131147, Feb. 1990.
[36] S. Sullivan, L. Sanford, and J. Ponce, "On using geometric distance fits to estimate 3D object shape, pose, and deformation from range, CT, and video images," inProc. IEEE Conf. Computer Vision and Pattern Recognition, New York, June 1993, pp. 110116.
[37] G. Taubin, "Nonplanar curve and surface estimation in 3space," inProc. IEEE Conf. Robotics Automation, May 1988.
[38] G. Taubin, "Recognition and positioning of rigid objects using algebraic and moment invariants," Ph.D. dissertation, Brown Univ., Providence, RI, 1990.
[39] G. Taubin, "Estimation of planar curves, surfaces and nonplanar space curves defined by implicit equations, with applications to edge and range image segmentation,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 11, pp. 11151138, Nov. 1991.
[40] G. Taubin, "An accurate algorithm for rasterizing algebraic curves," inProc. 2nd ACM/IEEE Symp. Solid Modeling and Applications. Montreal, May 1993, pp. 221230.
[41] G. Taubin, "An improved algorithm for algebraic curve and surface fitting," inProc. 4th Int. Conf. Computer Vision, Berlin, May 1993, pp. 658665.
[42] G. Taubin, "Distance Approximations for Rasterizing Implicit Curves,"ACM Trans. Graphics, Vol. 13, No. 1, Jan. 1994 (to appear).
[43] G. Taubin, "Rasterizing algebraic curves and surfaces," to appear inIEEE Comput. Graphics Applications, vol. 14, no. 2, Mar. 1994.
[44] G. Taubin, "2D and 3D object recognition and positioning with algebraic invariants and covariants," inSymbolic and Numerical Computation for Artificial Intelligence. London: Academic, 1992, pp. 147181.
[45] R. Walker,Algebraic Curves. Princeton, NJ: Princeton University Press, 1950.