Advertisement

Easily computable invariants for hypersurface recognition

  • R. A. Gershgorin
  • L. I. Rubanov
  • A. V. Seliverstov
Theory and Methods of Information Processing

Abstract

A method is proposed for the short description of an algebraic hypersurface with the help of descriptors that depend on a small number of coefficients of the corresponding polynomial form and are invariant with respect to the orthogonal transformations of the enveloping space. These invariants, which can easily be computed even for high dimensionalities, allow to compare quickly the shapes of hypersurfaces in the general position and can be used as features in applied problems of object description and recognition as well as for the solution of combinatorial problems. The transformation of real multilinear cubic forms is specially considered.

Keywords

High Dimensionality Orthogonal Transformation Permutation Matrice Steiner System Algebraic Hypersurface 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. A. Chochia, “Transition from 2Dto 3D-images: Modification of two-scale image model and image processing algorithms”, J. Commun. Technol. Electron. 60, 678–687 (2015).CrossRefGoogle Scholar
  2. 2.
    F. N. Grigoriev, Yu. V. Gulyaev, S. N. Dvornikova, O. A. Kozdoba, N. A. Kuznetsov, “Problem of pattern recognition in the diagnostics of cardiovascular diseases using the ECG data”, J. Commun. Technol. Electron. 60, 673–677 (2015).CrossRefGoogle Scholar
  3. 3.
    G. K. Golubev and V. G. Potapov, “On statistical problems in geolocation”, Probl. Inf. Transm. (Engl. Transl.) 49, 249–275 (2013).CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    F. I. Ivanov and V. V. Zyablov, “Low-density paritycheck codes based on Steiner systems and permutation matrices”, Probl. Inf. Transm. (Engl. Transl.) 49, 333–347 (2013).CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    V. V. Prasolov and Yu. P. Solovyev, Elliptic Functions and Elliptic Integrals (Amer. Math. Soc., Providence, 1997).zbMATHGoogle Scholar
  6. 6.
    A. Emch, “On a new normal form of the general cubic surface,” Am. J. Math. 53, 902–910 (1931).CrossRefMathSciNetGoogle Scholar
  7. 7.
    A. Emch, “Properties of the cubic surface derived from a new normal form,” Am. J. Math. 61, 115–122 (1939).CrossRefMathSciNetGoogle Scholar
  8. 8.
    A. Iliev and L. Manivel, “On cubic hypersurfaces of dimensions 7 and 8,” Proc. London Math. Soc. 108, 517–540 (2014).CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    L. Qi, “Eigenvalues of a real supersymmetric tensor,” J. Symbolic Comput. 40, 1302–1324 (2005).CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    D. Cartwright and B. Sturmfels, “The number of eigenvalues of a tensor,” Linear Algebra Appl. 438, 942–952 (2013).CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Sh. Hu, Zh.-H. Huang, Ch. Ling, and L. Qi, “On determinants and eigenvalue theory of tensors,” J. Symbolic Comput. 50, 508–531 (2013).CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    J. T. Schwartz, “Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 1980, Vol. 27, pp. 701–717.CrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2015

Authors and Affiliations

  • R. A. Gershgorin
    • 1
  • L. I. Rubanov
    • 1
  • A. V. Seliverstov
    • 1
  1. 1.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations