Skip to main content
SpringerLink
Log in

The Hypercube Separation algorithm: A fast and efficient algorithm for on-line handwritten character recognition

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

This paper introduces a new neural network training algorithm, Hypercube Separation (HCS) algorithm which is very fast and guaranteed to learn. HCS is a simple algorithm suitable for hardware implementation which classifies different input patterns presented to it through the formation of multiple hyperplanes. The performance of the HCS algorithm is compared to that of the Binary Synaptic Weights (BSW) algorithm and to the Backpropagation (BP) algorithm in solving the two spiral problem, which is an almost pathological problem for pattern separation. The HCS algorithm was able to successfully separate the input patterns, requiring three orders of magnitude less training time than the BP algorithm and one order of magnitude less hidden layer nodes than the BSW algorithm. We also present the application of HCS to on-line handwritten character recognition with good results, especially when the simple nature of the algorithm is taken into consideration.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H.M.A. Andree et al., “A comparison study of binary feedforward neural networks and digital circuits,” Neural Networks, vol. 6, pp. 785–790, 1993.

    Google Scholar 

  2. J. Dayhoff, “Neural network architectures: An introduction,” Van Nostrand Reinhold, New York, 1990.

    Google Scholar 

  3. J. Guo et al., “Recognition of handwritten characters using pattern transformation method with cosine function,” Trans. of the IEICE, vol. J76-D-II, no. 4, pp. 835–842, 1993 (in Japanese).

    Google Scholar 

  4. D. Hammerstrom, “Working with neural networks,” IEEE Spectrum, vol. 30, no. 7, pp. 46–53, 1993.

    Google Scholar 

  5. K. Imai, K. Gouhara, and Y. Uchikawa, “Handwritten letter recognition for noisy images using the three-layered BP-models,” Trans. of the IEICE, vol. J75-D-II, no. 2, pp. 314–323, 1992 (in Japanese).

    Google Scholar 

  6. T. Kawatani and N. Miyamoto, “shape quantification of handprinted numerals using recognition results and its application,” Trans. of the IEICE, vol. J74-D-II, no. 3, pp. 357–365, 1991 (in Japanese).

    Google Scholar 

  7. S. Kurakake and K. Ishi, “Evaluation of handprinted character recognition systems using distorted characters,” Trans. of the IEICE, vol. J74-D-II, no. 9, pp. 1208–1216, 1991 (in Japanese).

    Google Scholar 

  8. Y. Maeda, H. Yamashita, and Y. Kanata, “Learning rules for multilayer neural networks using a difference approximation,” Proceedings of the IJCNN'91, Singapore, 1991, pp. 628–633.

  9. J. L. McClelland, D.E. Rumelhart et al., Parallel Distributed Processing, The MIT Press: Cambridge, Massachusetts, 1986.

    Google Scholar 

  10. M. Mezard and J.P. Nadal, “Learning in feedforward layered neworks: The Tiling Algorithm,” J. Phys., A: Math. Gen., vol. 22, pp. 2191–2203, 1989.

    Google Scholar 

  11. S. Mori et al., “Research on machine recognition of handprinted characters,” IEEE Trans. on Pat. An. and Machine Int., vol. PAMI-6, no. 4, pp. 386–405, 1984.

    Google Scholar 

  12. T. Ohtomo, T. Hara, and K. Hara, “Two-stage recognition method of handwritten chinese characters using an integrated neural network model,” Trans. of the IEICE, vol. J74-D-II, no. 2, pp. 158–165, 1991 (in Japanese).

    Google Scholar 

  13. T.J. Sejnowski and C.R. Rosenberg, “NETtalk: A parallel network that learns to read aloud,” John Hopkins University, Tech. Rep. JHU/EECS-86-01,1986.

  14. W. Suewatanakul and D.M. Himmelblau, “Comparison of artificial neural networks and traditional classifiers via the two-spiral problem,” in Proc. of SIMTEC'92, 1992, pp. 431–438.

  15. F. Ulgen and N. Akamatsu, “A fast algorithm with a guarantee to learn: Binary synaptic weights algorithm on neural networks,” in Proc. of SIMTEC'92, 1992, pp. 469–474.

  16. K. Yamada, J. Tsukumo, and T. Temma, “Character recognition by neural networks with standstill evading learning algorithm,” Trans. of the IEICE, vol. J75-D-II, no. 11, pp. 1798–1808, 1992 (in Japanese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Justsystem Corporation, 3-46 Okihamahigashi, 770, Tokushima-shi, Japan

    Figen Ulgen

  2. University of Tokushima, 2-1 Minami Josanjima-cho, 770, Tokushima-shi, Japan

    Norio Akamatsu & Takenori Iwasa

Authors
  1. Figen Ulgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norio Akamatsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takenori Iwasa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ulgen, F., Akamatsu, N. & Iwasa, T. The Hypercube Separation algorithm: A fast and efficient algorithm for on-line handwritten character recognition. Appl Intell 6, 101–116 (1996). https://doi.org/10.1007/BF00117811

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00117811

Keywords

Search

Navigation