A TRANSFORMATION WITH INVARIANCE UNDER CYCLIC PERMUTATION FOR APPLICATIONS IN PATTERN RECOGNITION

被引:51
作者
REITBOECK, H
BRODY, TP
机构
[1] Westinghouse Electric Corp., Research and Development Center, Pittsburgh, PA 15235, Churchill Boro
来源
INFORMATION AND CONTROL | 1969年 / 15卷 / 02期
关键词
D O I
10.1016/S0019-9958(69)90387-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The paper describes a transformation that can be used to characterize patterns independent of their position. Examples of the application of the transform for the machine recognition of letters are discussed. The program succeeded in a recognition rate of 80-100% for letters having different position, distortions, inclination, rotation up to 15° and size variation up to 1:3 relative to a reference set of 10 letters. Results with a program for the autonomous learning of new varieties of a pattern (using a learning matrix as an adaptive classifier) are given. When executed on a digital computer, this transform is 10-100 times faster than the fast Fourier transform (depending on the number of sampling points). © 1969 Academic Press, Inc.
引用
收藏
页码:130 / +
页数:1
相关论文
共 2 条
[1]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[2]  
Hadamard J., 1893, B SCI MATH, V17, P240