TY - GEN

T1 - Bayesian methods for the use of implicit polynomials and algebraic invariants in practical computer vision

AU - Subrahmonia, Jayashree

AU - Keren, Daniel

AU - Cooper, David B.

PY - 1993

Y1 - 1993

N2 - Implicit higher degree polynomials in x, y, z (or in x, y for curves in images) have considerable global and semiglobal representation power for objects in 3D space. (Spheres, cylinders, cones and planes are special cases of such polynomials restricted to second degree). Hence, they have great potential for object recognition and position estimation and for object geometric-property measurement. In this paper we deal with four problems pertinent to using these polynomials in real world robust systems: (1) Characterization and fitting algorithms for the subset of these algebraic curves and surfaces that is bounded and exists largely in the vicinity of the data; (2) The aposteriori distribution for the possible polynomial coefficients given a data set. This measures the extent to which a data set constrains the coefficients of the best fitting polynomial; (3) Geometric Invariants for determining whether one implicit polynomial curve or surface is a rotation and translation of another, or whether one implicit polynomial curve is an affine transformation of another; (4) A Mahalanobis distance for comparing the coefficients or the invariants of two polynomials to determine whether the curves or surfaces that they represent are close over a specified region. In addition to handling objects with easily detectable features such as vertices, high curvature points, and straight lines, the polynomials and tools discussed in this paper are ideally suited to smooth curves and smooth curved surfaces which do no have detectable features.

AB - Implicit higher degree polynomials in x, y, z (or in x, y for curves in images) have considerable global and semiglobal representation power for objects in 3D space. (Spheres, cylinders, cones and planes are special cases of such polynomials restricted to second degree). Hence, they have great potential for object recognition and position estimation and for object geometric-property measurement. In this paper we deal with four problems pertinent to using these polynomials in real world robust systems: (1) Characterization and fitting algorithms for the subset of these algebraic curves and surfaces that is bounded and exists largely in the vicinity of the data; (2) The aposteriori distribution for the possible polynomial coefficients given a data set. This measures the extent to which a data set constrains the coefficients of the best fitting polynomial; (3) Geometric Invariants for determining whether one implicit polynomial curve or surface is a rotation and translation of another, or whether one implicit polynomial curve is an affine transformation of another; (4) A Mahalanobis distance for comparing the coefficients or the invariants of two polynomials to determine whether the curves or surfaces that they represent are close over a specified region. In addition to handling objects with easily detectable features such as vertices, high curvature points, and straight lines, the polynomials and tools discussed in this paper are ideally suited to smooth curves and smooth curved surfaces which do no have detectable features.

UR - http://www.scopus.com/inward/record.url?scp=0027256911&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027256911

SN - 0819410314

T3 - Proceedings of SPIE - The International Society for Optical Engineering

SP - 104

EP - 117

BT - Proceedings of SPIE - The International Society for Optical Engineering

PB - Publ by Int Soc for Optical Engineering

T2 - Curves and Surfaces in Computer Vision and Graphics III

Y2 - 16 November 1992 through 18 November 1992

ER -