We present an application of Radial Basis Function Networks to handwritten digits recognition. Inspired from regularization theory and Parzen windows non parametric estimator. Radial Basis Function networks are tested for a classification task. Reduction of the number of hidden nodes which is an important and necessary step to obtain a computationally tractable network is made using an original technique. A comparison is made with the k- nearest neighbor and Parzen windows methods. Results appear better for the network at a much lower computational cost.
"Radial Basis Function network for handwritten digit recognition", Proc. SPIE 1965, Applications of Artificial Neural Networks IV, (2 September 1993); doi: 10.1117/12.152566; https://doi.org/10.1117/12.152566