Advertisement

Recognition of Computationally Constructed Loci

  • Peter Lebmeir
  • Jürgen Richter-Gebert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4869)

Abstract

We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means determining a single implicit polynomial equation and geometric invariants, characterizing an algebraic curve which is given by a discrete set of sample points. Starting with these discrete samples, arising for example from a geometric ruler and compass construction, an eigenvalue analysis of a matrix derived from the data leads to proposed curve parameters. Utilizing the construction itself, with its free and dependent geometric elements, further specifications of the type of constructed curves under genericity assumptions are made. This is done by a second eigenvalue analysis of parameters of several generically generated curves.

Keywords

Sample Point Minimal Degree Algebraic Curve Algebraic Curf Minimal Eigenvalue 
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.
    Kortenkamp, U., Richter-Gebert, J.: Grundlagen dynamischer Geometrie, Zeichnung - Figur - Zugfigur, 123-144 (2001)Google Scholar
  2. 2.
    Kortenkamp, U., Richter-Gebert, J.: Complexity issues in dynamic geometry. In: Rojas, M., Cucker, F. (eds.) Festschrift in the honor of Stephen Smale’s 70th birthday, pp. 355–404. World Scientific, Singapore (2002)Google Scholar
  3. 3.
    Laborde, J.-M., Bellemain, F.: Cabri-Geometry II. In: Texas Instruments, pp. 1993–1998.Google Scholar
  4. 4.
    Richter-Gebert, J., Kortenkamp, U.: Cinderella - The interactive geometry software, Springer, see (1999), also http://www.cinderella.de
  5. 5.
    Taubin, G.: An improved algorithm for algebraic curve and surface fitting. In: Proc. ICCV 1993, Berlin, Germany, pp. 658–665 (May 1993)Google Scholar
  6. 6.
    Taubin, G.: Estimation of Planar Curves, Surfaces and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 13, 1115–1138 (1991)CrossRefGoogle Scholar
  7. 7.
    Tarel, J.-P., Cooper, D.B.: The Complex Representation of Algebraic Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 663–674 (2000)CrossRefGoogle Scholar
  8. 8.
    Ferguson, H.R.P., Bailey, D.H., Arno, S.: Analysis of PSLQ, An Integer Relation Finding Algorithm. Mathematics of Computation 68(225), 351–369 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Lei, Z., Tasdizen, T., Cooper, D.B.: PIMs and Invariant Parts for Shape Recognition. In: ICCV 1998. Proceedings of Sixth International Conference on Computer Vision, pp. 827–832 (January 1998)Google Scholar
  10. 10.
    Tasdizen, T., Tarel, J.-P., Cooper, D.B.: Algebraic Curves That Work Better. In: CVPR 1999. IEEE Conference on Computer Vision and Pattern Recognition, pp. 35–41 (June 1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Peter Lebmeir
    • 1
  • Jürgen Richter-Gebert
    • 1
  1. 1.Technical University of Munich, Department of Mathematics, Boltzmannstr. 3, 85748 GarchingGermany

Personalised recommendations