Describing Complicated Objects by Implicit Polynomials

Daniel Keren, David Kooper

Research output: Contribution to journalArticlepeer-review


This paper introduces and focuses on two problems. First is the representation power of closed implicit polynomials of modest degree for curves in 2-D images and surfaces in 3-D range data. Super quadrics are a small subset of object boundaries that are well fitted by these polynomials. The second problem is the stable computationally efficient fitting of noisy data by closed implicit polynomial curves and surfaces. The attractive features of these polynomials for Vision is discussed.

Original languageEnglish
Pages (from-to)38-53
Number of pages16
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number1
StatePublished - Jan 1994
Externally publishedYes

Bibliographical note

Funding Information:
Manuscript received February 3, 1992; revised October 20, 1992. This work was supported by NSF Grant IRI-8715774 and NSF-DARPA Grant IRI-8905436. Recommended for acceptance by Associate Editor R. Nevatia.

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Describing Complicated Objects by Implicit Polynomials'. Together they form a unique fingerprint.

Cite this