Abstract
Two problems pertinent to using implicit higher degree polynomials in real-world robust systems are dealt with: (1) characterization and fitting algorithms for the subset of these algebraic curves and surfaces that is bounded and exists largely in the vicinity of the data; (2) a Mahalanobis distance for comparing the coefficients of two polynomials, to determine whether the curves or surfaces that they represent are close over a specified region. These tools make practical use of geometric invariants for determining whether one implicit polynomial curve or surface is a rotation, translation, or an affine transformation of another. The approach is ideally suited to smooth curves and smooth curved surfaces that do not have detectable features.
Original language | English |
---|---|
Title of host publication | Proceedings CVPR 1992 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
Publisher | IEEE Computer Society |
Pages | 791-794 |
Number of pages | 4 |
ISBN (Electronic) | 0818628553 |
DOIs | |
State | Published - 1992 |
Externally published | Yes |
Event | 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992 - Champaign, United States Duration: 15 Jun 1992 → 18 Jun 1992 |
Publication series
Name | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
---|---|
Volume | 1992-June |
ISSN (Print) | 1063-6919 |
Conference
Conference | 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 1992 |
---|---|
Country/Territory | United States |
City | Champaign |
Period | 15/06/92 → 18/06/92 |
Bibliographical note
Publisher Copyright:© 1992 IEEE.
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition