Image processing by template polynomials

Summary form only given. A polynomial approach to the representation of binary gray images for machine vision is described. First, the authors develop an algebraic system and show that most of the standard image processing can be done by the template polynomial operations. They also develop some operators which rely on the intrinsic properties of polynomials and perform considerable advantage when the polynomial representation is used. In particular, the authors develop a parallel algorithm by template decomposition which uses the separability property of the template polynomial to reduce the time complexity. The authors also develop a method for decomposing the template which reduces the time complexity significantly for a large-sized template. A necessary and sufficient condition for the decomposability of a template which is easy to apply is obtained. Finally, a parallel algorithm for processing an image by decomposing a template into local templates is developed