The doctoral dissertations of the former Helsinki University of Technology (TKK) and Aalto University Schools of Technology (CHEM, ELEC, ENG, SCI) published in electronic format are available in the electronic publications archive of Aalto University - Aaltodoc.
|
|
|
Subspace Classifiers in Recognition of Handwritten Digits
Jorma Laaksonen
Dissertation for the degree of Doctor of Technology to be presented with due permission for public examination and criticism in Auditorium F1 of Helsinki University of Technology on the 7th of May 1997, at 12 o'clock noon.
Dissertation in PDF format (ISBN 951-22-5479-4) [1993 KB]
Dissertation is also available in print (ISBN 952-5148-20-3)
Abstract
This thesis consists of two parts. The first part reviews the general structure of a pattern recognition system and, in particular, various statistical and neural classification algorithms. The presentation then focuses on subspace classification methods that form a family of semiparametric methods. Several improvements on the traditional subspace classification rule are presented. Most importantly, two new classification techniques, here named the Local Subspace Classifier (LSC) and the Convex Local Subspace Classifier (LSC+), are introduced. These new methods connect the subspace principle to the family of nonparametric prototype-based classifiers and, thus, seek to combine the benefits of both approaches.
The second part addresses the recognition of handwritten digits, which is the case study of this thesis. Special attention is given to feature extraction methods in optical character recognition systems. As a novel contribution, a new method, here named the error-corrective feature extraction, is presented. The prototype recognition system developed for the experiments is described and various options in the implementation are discussed.
For the background of the experiments, thirteen well-known statistical and neural classification algorithms were tested. The results obtained with two traditional subspace methods and ten novel techniques presented in this thesis are compared with them. The results show that the Convex Local Subspace Classifier performs better than any other classification algorithm in the comparison.
The conclusions of this thesis state that the suggested enhancements make the subspace methods very useful for tasks like the recognition of handwritten digits. This result is expected to be applicable in other similar cases of recognizing two-dimensional isolated visual objects.
Keywords: pattern recognition, adaptive systems, neural networks, statistical classification, subspace methods, prototype-based classification, feature extraction, optical character recognition, handwritten digits, classifier comparison, benchmarking study
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
© 2001 Helsinki University of Technology
Last update 2011-05-26