Exploiting p-Fold Symmetries for Faster Polynomial Equation Solving

Erik Ask, Yubin Kuang, Karl Åström

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

Numerous geometric problems in computer vision in-
volve the solution of systems of polynomial equations.
This is true for problems with minimal information, but
also for finding stationary points for overdetermined
problems. The state-of-the-art is based on the use of
numerical linear algebra on the large but sparse co-
efficient matrix that represents the expanded original
equation set. In this paper we present two simplifica-
tions that can be used (i) if the zero vector is one of
the solutions or (ii) if the equations display certain p-
fold symmetries. We evaluate the simplifications on a
few example problems and demonstrate that significant
speed increases are possible without loosing accuracy.
Originalspråkengelska
Titel på värdpublikation21st International Conference on Pattern Recognition (ICPR 2012), Proceedings of
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor3232-3235
Antal sidor4
ISBN (tryckt)978-4-9906441-1-6
StatusPublished - 2012
Evenemang21st International Conference on Pattern Recognition (ICPR 2012) - Tsukuba, Japan
Varaktighet: 2012 nov. 112012 nov. 15

Konferens

Konferens21st International Conference on Pattern Recognition (ICPR 2012)
Land/TerritoriumJapan
OrtTsukuba
Period2012/11/112012/11/15

Bibliografisk information

The proceedings of ICPR 2012 will in the future be available at IEEE Xplore. The page reference given above refer to the proceedings published on USB by IEEE, and distributed to the participants during the conference.

Ämnesklassifikation (UKÄ)

  • Matematik

Fingeravtryck

Utforska forskningsämnen för ”Exploiting p-Fold Symmetries for Faster Polynomial Equation Solving”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här