International Journal of Computer Vision

, Volume 54, Issue 1–3, pp 105–115 | Cite as

Implicitization of Parametric Curves by Matrix Annihilation

  • Hulya Yalcin
  • Mustafa Unel
  • William Wolovich


Object recognition is a central problem in computer vision. When objects are defined by boundary curves, they can be represented either explicitly or implicitly. Implicit polynomial (IP) equations have long been known to offer certain advantages over more traditional parametric methods. However, the lack of general procedures for obtaining IP models of higher degree has prevented their general use in many practical applications. In most cases today, parametric equations are used to model curves and surfaces. One such parametric representation, elliptic Fourier Descriptors (EFD), has been widely used to represent 2D and 3D curves, as well as 3D surfaces. Although EFDs can represent nearly all curves, it is often convenient to have an implicit algebraic description F(x, y) = 0, for several reasons. Algebraic curves and surfaces have proven very useful in many model-based applications. Various algebraic and geometric invariants obtained from these implicit models have been studied rather extensively, since implicit polynomials are well-suited to computer vision tasks, especially for single computation pose estimation, shape tracking, 3D surface estimation from multiple images and efficient geometric indexing into large pictorial databases. In this paper, we present a new non-symbolic implicitization technique called the matrix annihilation method, for converting parametric Fourier representations to algebraic (implicit polynomial) representations, thereby benefiting from the features of both.

free-form models implicitization Fourier descriptors implicit polynomials 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bajaj, C., Garrity, T., and Warren, J. 1988. On the applications of multi-equational resultants. Technical report CSD-TR-826, Department of Computer Science, Purdue University.Google Scholar
  2. Bloomenthal, J. 1997. Introduction to Implicit Surfaces. Morgan Kaufmann Publishers, Inc.Google Scholar
  3. Buchberger, B. 1985. Groebner bases: An algorithmic method in polynomial ideal theory. In Multidimensional Systems Theory, N.K. Bose (Ed.), D. Reidel Publishing Company, pp. 184-232.Google Scholar
  4. Buchberger, B. 1989. Applications of groebner bases in non-linear computational geometry. In Geometric Reasoning, D. Kapur and J. Mundy (Eds.), MIT Press, pp. 415-447.Google Scholar
  5. Calabi, E., Olver, P.J., Shakiban, C., Tannenbaum, A., and Haker, S. 1998. Differential and numerically invariant signature curves applied to object recognition. IJCV, 26(2):107-135.Google Scholar
  6. Canny, J.F. 1990. Generalized characteristic polynomials. Journal of Symbolic Computation, 9:241-250.Google Scholar
  7. Chionh, E.W. 1990. Base points, resultants, and the implicit representation of rational surfaces. Ph.D. Thesis, Department of Computer Sicence, University of Waterloo, Canada.Google Scholar
  8. Chionh, E.W. and Goldman, R.N. 1992. Using multivariate resultants to find the implicit equation of a rational surface. The Visual Computer, 8(3):171-180.Google Scholar
  9. Dixon, A.L. 1908. The eliminant of three quantics in two independent variables. Proc. London Mathematical Society, Series 2, 7:49-69.Google Scholar
  10. Granlund, G.H. 1972. Fourier preprocessing for hand print character recognition. IEEE Trans. Computers, 21:195-201.Google Scholar
  11. Hobby, J.D. 1991. Numerically stable implicitization of cubic curves. ACM Transactions on Graphics, 10(3).Google Scholar
  12. Hoffmann, C. 1989. Geometric and Solid Modeling: An Introduction. Morgan Kaufmann Publishers Inc.Google Scholar
  13. Hoffmann, C. 1993. Implicit curves and surfaces in CAGD. IEEE Computer Graphics and Applications, 13(1):79-88.Google Scholar
  14. Hong, H. 1995. Implicitization of curves parametrized by generalized trigonometric polynomials. In Proceedings of Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC-11), pp. 285-296.Google Scholar
  15. Huang, Z.H. and Cohen, F.S. 1996. Affine invariant B-spline moments for curve matching. Image Processing, 5(10):1473- 1480.Google Scholar
  16. Keren, D., Cooper, D., and Subrahmonia, J. 1994. Describing complicated objects by implicit polynomials. IEEE Trans. Pattern Analysis and Machine Intelligence, 16:38-53.Google Scholar
  17. Kuhl, F.P. and Giardina, C.R. 1982. Elliptic Fourier features of a closed contour. Computer Graphics and Image Processing, 18:236-258.Google Scholar
  18. Lei, Z., Blane, M.M., and Cooper, D.B. 1996. 3L fitting of higher degree implicit polynomials. In Proceedings of Third IEEE Workshop on Applications of Computer Vision, Florida, pp. 148-153.Google Scholar
  19. Lestrel, P.E. 1997. Fourier Descriptors and Their Applications in Biology. Cambrigde Univ. Press.Google Scholar
  20. Lin, C.S. and Hwang, C.L. 1987. Newforms of shape invariants from elliptic Fourier descriptors. Pattern Recognition, 20(5):535-545.Google Scholar
  21. Ma, S. 1993. De. Conics-based stereo, motion estimation and pose determination. IJCV, 10 (1).Google Scholar
  22. Macaulay, F.S. 1916. The Algebraic Theory of Modular Systems. Cambridge University Press.Google Scholar
  23. Manocha, D. and Canny, J.F. 1992a. The implicit representation of rational parametric surfaces. Journal of Symbolic Computation, 13:485-510.Google Scholar
  24. Manocha, D. and Canny, J.F. 1992b. Algorithms for implicitizing rational parametric surfaces. Journal of Computer-Aided Geometric Design, 9:25-50.Google Scholar
  25. Monga, O. and Benayoun, S. 1995. Using partial derivatives of 3D images to extract typical surface features. Computer Vision and Image Understanding, 61(2):171-189.Google Scholar
  26. Mundy, J.L. and Zisserman, A. (Eds.) 1992. Geometric Invariance in Computer Vision. MIT Press.Google Scholar
  27. Rutter, J.W. 2000. Geometry of Curves Chapman & Hall/CRC.Google Scholar
  28. Salmon, G. 1915. A Treatise on the Analytic Geometry of Three Dimensions. Longmans, Green anc Co., London, 5th ed., p. 264.Google Scholar
  29. Sederberg, T.W. 1983. Implicit and parametric curves and surfaces for computer aided geometric design. Ph.D. Thesis, Dept. Mechanical Engineering, Purdue University.Google Scholar
  30. Sederberg, T.W. and Anderson, D.C. 1984. Implicit representation of parametric curves and surfaces. Comput. Vision & Graph. Image Process., 28(1):72-84.Google Scholar
  31. Sederberg, T. and Chen, F. 1995. Implicitization using moving curves and surfaces. In Proceedings of SIGGRAPH, pp. 301-308.Google Scholar
  32. Sederberg, T.W. and Goldman, R.N. 1986. Algebraic geometry for computer-aided geometric design. IEEE Comput. Graph. Appl., 6(6):52-59.Google Scholar
  33. Solina, F. and Bajcsy, R. 1990. Recovery of parametric models from range images: The case for superquadrics with global deformations. IEEE Trans. on Pattern Anal. and Machine Intell., 12(2):131-147.Google Scholar
  34. Subrahmonia, J., Cooper, D.B., and Keren, D. 1996. Practical reliable bayesian recognition of 2D and 3D objects using implicit polynomials and algebraic invariants. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(5):505-519.Google Scholar
  35. Tasdizen, T., Tarel, J.P., and Cooper, D.B. 2000. Improving the stability of algebraic curves for applications. IEEE Transactions in Image Processing, 9(3):405-416.Google Scholar
  36. Taubin, G. 1991. Estimation of planar curves, surfaces and nonplanar space curves defined by implicit equations, with applications to edge and range image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:1115-1138.Google Scholar
  37. Taubin, G., Cukierman, F., Sullivan, S., Ponce, J., and Kriegman, D.J. 1994. Parameterized families of polynomials for bounded algebraic curve and surface fitting. IEEE Trans. Pattern Analysis and Machine Intelligence, 16(3):287-303.Google Scholar
  38. Unel, M. and Wolovich, W.A. 1998. Pose estimation and object identification using complex algebraic representations. Pattern Analysis and Applications Journal, 1 (3).Google Scholar
  39. Unel, M. and Wolovich, W.A. 1999. A new representation for quartic curves and complete sets of geometric invariants. Int. Jour. of Pattern Recognition and Artificial Intelligence, 13(8).Google Scholar
  40. Unel, M. and Wolovich, W.A. 2000. On the construction of complete sets of geometric invariants for algebraic curves. Advances in Applied Mathematics, 24:65-87.Google Scholar
  41. Unsalan, C. and Ercil, A. 2001. Conversions between parametric and implicit forms using polar/spherical coordinate representations. Computer Vision and Image Understanding, 81:1-25.Google Scholar
  42. Wallace, T.P. and Mitchell, O.R. 1980. Analysis of three-dimensional movement using fourier descriptors. IEEE Trans. Pattern Analysis and Machine Intelligence, 2(6):583-588.Google Scholar
  43. Wolovich, W., Albakri, H., and Yalcin, H. 2002. The precise modeling and measurement of free-form surfaces. Journal of Manufacturing Science and Engineering.Google Scholar
  44. Wolovich, W.A. and Unel, M. 1998. The determination of implicit polynomial canonical curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(10):1080-1090.Google Scholar
  45. Wu, M.F. and Sheu, H.T. 1998. Representation of 3D surfaces by two-variable Fourier descriptors. IEEE Trans. Pattern Analysis and Machine Intelligence, 20(8):583-588.Google Scholar
  46. Zahn, C.T. and Roskies, R.Z. 1972. Fourier descriptors for plane closed curves. IEEE Trans. Computers, 21(3):269-281.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Hulya Yalcin
    • 1
  • Mustafa Unel
    • 2
  • William Wolovich
    • 1
  1. 1.Division of EngineeringBrown UniversityProvidenceUSA
  2. 2.Center for Computational Vision and ControlYale UniversityUSA

Personalised recommendations