This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using Symbolic Computation to Find Algebraic Invariants
November 1994 (vol. 16 no. 11)
pp. 1143-1149

Implicit polynomials have proved themselves as having excellent representation power for complicated objects, and there is growing use of them in computer vision, graphics, and CAD. A must for every system that tries to recognize objects based on their representation by implicit polynomials are invariants, which are quantities assigned to polynomials that do not change under coordinate transformations. In the recognition system developed at the Laboratory for Engineering Man-Machine Studies in Brown University (LEMS), it became necessary to use invariants which are explicit and simple functions of the polynomial coefficients. A method to find such invariants is described and the new invariants presented. This work addresses only the problem of finding the invariants; their stability is studied in another paper.

[1] J. Mundy and A. Zisserman, Eds.,Conf. on Applications of Invariants in Computer Vision II, Esprit, ARPA/NSF, Ponta Delgada, Azores, October 1993.
[2] D. Forsyth, J. L. Mundy, A. Zisserman, C. Coelho, A. Heller, and C. Rothwell, "Invariant descriptors for 3d object recognition and pose,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 10, pp. 971-992, 1991.
[3] J.H. Grace and A. Young,The Algebra of Invariants. Cambridge, UK: Cambridge University Press, 1903.
[4] C. Jerian and R. Jain, "Polynomial methods for structure from motion,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 12, pp. 1150-1167, 1990.
[5] D. Keren, D. B. Cooper, and J. Subrahmonia "Describing complicated objects by implicit polynomials," Tech. Rep. LEMS-93, Brown University, 1991;IEEE Trans. Pattern Anal. Machine Intell., in press.
[6] D. J. Kriegman and J. Ponce, "On recognizing and positioning curved 3d objects from image contours,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 12, pp. 1127-1138, 1990.
[7] J. Mundy and A. Zisserman,Geometric Invariance in Machine Vision. Cambridge, MA: MIT Press, 1992.
[8] J. Subrahmonia, D. B. Cooper, and D. Keren, "Reliable object recognition using high dimensional implicit polynomials for 2d curves and 3d surfaces," Tech. Rep. LEMS-107, Brown University, 1992;IEEE Trans. Pattern Anal. Machine Intell., submitted.
[9] G. Taubin, "Estimation of planar curves, surfaces and nonplanar space curves defined by implicit equations, with applications to edge and range image segmentation,"IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 11, pp. 1115-1138, 1991.
[10] I. Weiss, "Geometric invariants and object recognition,"Int. J. Comput. Vision, vol. 10, no. 3, pp. 201-231, 1993.
[11] K. B. Gallagher and J. R. Lyle, "A program decomposition scheme with applications to software modification and testing," inProc. 22nd Int. Conf. System Sciences(Hawaii), Jan. 1989, vol. II, pp. 479-485.

Index Terms:
symbol manipulation; polynomials; object recognition; symbolic computation; algebraic invariants; implicit polynomials; complicated objects; computer vision; graphics; CAD; Brown University; polynomial coefficients
Citation:
D. Keren, "Using Symbolic Computation to Find Algebraic Invariants," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 11, pp. 1143-1149, Nov. 1994, doi:10.1109/34.334397
Usage of this product signifies your acceptance of the Terms of Use.