### Abstract

Pattern recognition is considered as a mapping from the set of all inputs to the numbers 0 to 1. The inputs are treated as vectors. A topological group algebra over the vector space is described. The input is treated as a variable in a polynomial of that group algebra. A correspondence between inputs and numbers is established. This correspondence is used to prove that the polynomials in the algebra can represent a solution to any pattern recognition problem. When the coefficients of the polynomial are suitably chosen vectors, the natural topology of the input vector space is preserved. The importance of this approach as a basis for a completely general efficient parallel process, and practically realizable pattern recognizing machine is presented. The concept may be realized by a modular parallel process type of machinery.

Original language | English (US) |
---|---|

Pages (from-to) | 528-530 |

Number of pages | 3 |

Journal | IEEE Transactions on Computers |

Volume | C-23 |

Issue number | 5 |

State | Published - May 1974 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*IEEE Transactions on Computers*,

*C-23*(5), 528-530.

**PATTERN RECOGNITION BY CONVOLUTION POLYNOMIAL.** / Remler, Michael P.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. C-23, no. 5, pp. 528-530.

}

TY - JOUR

T1 - PATTERN RECOGNITION BY CONVOLUTION POLYNOMIAL.

AU - Remler, Michael P.

PY - 1974/5

Y1 - 1974/5

N2 - Pattern recognition is considered as a mapping from the set of all inputs to the numbers 0 to 1. The inputs are treated as vectors. A topological group algebra over the vector space is described. The input is treated as a variable in a polynomial of that group algebra. A correspondence between inputs and numbers is established. This correspondence is used to prove that the polynomials in the algebra can represent a solution to any pattern recognition problem. When the coefficients of the polynomial are suitably chosen vectors, the natural topology of the input vector space is preserved. The importance of this approach as a basis for a completely general efficient parallel process, and practically realizable pattern recognizing machine is presented. The concept may be realized by a modular parallel process type of machinery.

AB - Pattern recognition is considered as a mapping from the set of all inputs to the numbers 0 to 1. The inputs are treated as vectors. A topological group algebra over the vector space is described. The input is treated as a variable in a polynomial of that group algebra. A correspondence between inputs and numbers is established. This correspondence is used to prove that the polynomials in the algebra can represent a solution to any pattern recognition problem. When the coefficients of the polynomial are suitably chosen vectors, the natural topology of the input vector space is preserved. The importance of this approach as a basis for a completely general efficient parallel process, and practically realizable pattern recognizing machine is presented. The concept may be realized by a modular parallel process type of machinery.

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

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

M3 - Article

AN - SCOPUS:0016060724

VL - C-23

SP - 528

EP - 530

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 5

ER -