IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
We present in this communication a new clustering algorithm dedicated to the determination of the character allographs. The "problem of the allographs" specific of the dynamic handwriting in omni-scriptor context renders the implementation of "classical" clustering algorithms particularly delicate because it introduces the notion of heterogeneous classes characterized by strongly variable example densities. We propose here an hybrid clustering algorithm that combines a prototype placement stage and an adaptation stage. The first realizes an under-optimal determination of kernels in the different clusters composing the classes. It is followed by a kernel adaptation stage driving to an optimization of their position. The process drastically reduces the number of references to examine during a k-nn classification while preserving to the classifier a high level of performances. The experience has been driven on an extensive alphabet compromising 80 classes (upper- and lower-case letters, digits and mathematical symbols). Recognition rate, evaluated on near 35000 examples from the UNIPEN database show the sturdiness of the modelization.