Share Email Print
cover

Proceedings Paper

Pattern recognition by template polynomials
Author(s): Prabir Bhattacharya; Kai Qian
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A polynomial approach to the representation of binary and gray images for machine vision is introduced. Most of the standard image processing can be done by the template polynomial operations. However, we also develop some operators which rely on the intrinsic properties of polynomials and can be done at a considerable advantage using the polynomial representation of images. In particular, we develop an algorithm in parallel processing by template decomposition which uses the separability property of the template polynomial. There has been considerable interest in the past to develop a convenient algebraic environment to process digitized images. In this approach, each black-and-white picture is represented by a polynomial in the two variables X and Y with coefficients from the set {0,1}. Also, each gray digital picture is represented by a polynomial in two variables with coefficients from the set {0,1, ...,2n — 1} where the picture has 2n gray levels. The polynomials representing binary and gray pictures are referred to as picture polynomials. First we introduce algebraic operators to perform certain basic operations, like edge detection. Then, we apply the template polynomial approach to develop a method for decomposing the template which reduces the time complexity significantly for a large sized template in parallel processing.

Paper Details

Date Published: 1 January 1990
PDF: 9 pages
Proc. SPIE 1293, Applications of Artificial Intelligence VIII, (1 January 1990); doi: 10.1117/12.21103
Show Author Affiliations
Prabir Bhattacharya, Univ. of Nebraska/Lincoln (United States)
Kai Qian, Univ. of Nebraska/Lincoln (United States)


Published in SPIE Proceedings Vol. 1293:
Applications of Artificial Intelligence VIII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top