Describing complicated objects by implicit polynomials
Keren, D.
Cooper, D.
Subrahmonia, J.
Lab. for Eng. Man/Machine Syst., Brown Univ., Providence, RI;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jan 1994
Volume: 16,
Issue: 1
On page(s): 38-53
ISSN: 0162-8828
References Cited: 24
CODEN: ITPIDJ
INSPEC Accession Number: 4645052
Digital Object Identifier: 10.1109/34.273718
Current Version Published: 2002-08-06
Abstract
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
