Computationally fast bayesian recognition of complex objects based on mutual algebraic invariants

An effective approach has appeared in the literature for recognizing 2D curve or 3D surface objects of modest complexity based on representing an object by a single implicit polynomial of 3^rd or 4^th degree, computing a vector of Euclidean or affine invariants which are functions of the polynomial coefficients, and doing Bayesian object recognition of the invariants [5], thus producing low computational cost robust recognition. This paper extends the approach, as well as an initial work on mutual invariants recognizers [4], to the recognition of objects too complicated to be represented by a single polynomial(Figure 1). Hence, an object to be recognized is partitioned into patches, each patch is represented by a single implicit polynomial, mutual invariants are computed for pairs of polynomials for pairs of patches, and object recognition is Bayesian recognition of vectors of self and mutual invariants. We will discuss why complete object geometry can be captured by the geometry of pairs of patches, how to design mutual invariants, and how to match patches in the data with those in the database at low computational cost. The approach is low computational cost recognition of partially occluded articulated objects in arbitrary position and in noise by recognizing the self or joint geometry of one or more patches.