Compact template polynomials methodology in pattern recognition and parallel processing

A polynomial approach is presented to the representation of binary, gray images for machine vision. It is shown that most of the standard image processing can be done by the template polynomial operations. Some operators which rely on the intrinsic properties of polynomials and can be done at a considerable advantage using the polynomial representation of images are developed. In particular, a parallel algorithm is developed by template decomposition; it uses the separability property of the template polynomial to reduce the time complexity.<>