EFFICIENT COMPUTATION OF ALGEBRAIC INVARIANTS FROM HIGHER-DEGREE IMPLICIT POLYNOMIALS USING TENSOR-BASED REPRESENTATION

Citation
S. Kaveti et al., EFFICIENT COMPUTATION OF ALGEBRAIC INVARIANTS FROM HIGHER-DEGREE IMPLICIT POLYNOMIALS USING TENSOR-BASED REPRESENTATION, The International journal of robotics research, 17(10), 1998, pp. 1105-1125
Citations number
28
Categorie Soggetti
Robotics & Automatic Control","Robotics & Automatic Control
ISSN journal
02783649
Volume
17
Issue
10
Year of publication
1998
Pages
1105 - 1125
Database
ISI
SICI code
0278-3649(1998)17:10<1105:ECOAIF>2.0.ZU;2-1
Abstract
Higher-degree implicit polynomials and moments provide useful global d escriptors for complex curves and surfaces. In this paper a tensor-bas ed approach for obtaining Euclidean and affine invariants from coeffic ients of higher-degree implicit polynomials has been proposed. The alg orithm is an extension of the matrix-based approach by Taubin, but unl ike the previous works, it is not based on partial derivative forms or symbolic computation. Owing to the close relationship between algebra ic invariants and moment invariants, the approach is equally applicabl e to moment invariants.