A linear mapping technique for optimizing binary templates in noise-free pattern matching

https://doi.org/10.1016/0031-3203(83)90052-3Get rights and content

Abstract

Dimensionality reduction of noise-free binary patterns is achieved here by linear mapping from higher dimensional vector space to a lower one. A systematic methodology is thus obtained for finding better templates for a collection of noise free patterns, a priori knowledge of the probability distribution of which is not required. Here the memory requirement of the classifier is reduced and the template matching made faster under certain conditions.

References (12)

There are more references available in the full text version of this article.

Cited by (1)

View full text