[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Stochastic Search Algorithm to Optimize an N-tuple Classifier by Selecting Its Inputs

  • Conference paper
Image Analysis and Recognition (ICIAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3211))

Included in the following conference series:

Abstract

The N-tuple method [4] is a statistical pattern recognition method, which decomposes a given pattern into several sets of n points, termed “N tuples”. The input connection mapping of the N-tuple classifier determines the sampling and defines the locations of the pattern matrix. Realizing the fact that the classification performance of the N-tuple classifier is highly dependant on the actual subset of the input bits probed [3][7], we have introduced an approach based on a Reward and Punishment (RnP) scheme to select input mappings of the classifier. We termed the classes with high error rates as critical classes. Different groups of tuples have been formed for different classes. The strategy was to employ more number of tuples to a critical class-group than an easily distinguishable class. In order to illustrate the capabilities of the RnP based measure the task of recognizing hand-written digits from NIST [10] database has been chosen.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aleksander, I., Stonham, T.J.: Guide to Pattern Recognition using random –access Memories. Computers and Digital Techniques 2, 29–40 (1979)

    Article  Google Scholar 

  2. Aleksander, I., Thomas, W.V., Bowden, P.A.: WISARD: A radical step forward in image recognition. Sensor Review 4(3), 120–124 (1984)

    Article  Google Scholar 

  3. Bishop, J.M., Crowe, A.A., Minchinton, P.R., Mitchell, R.J.: Evolutionary Learning to Optimise Mapping in n-Tuple Networks. IEEE Colloquium on Machine Learning Digest 1990/117 (1990)

    Google Scholar 

  4. Bledsoe, W., Browning, I.: Pattern recognition and reading by machine. In: Proceedings of Eastern Joint Computer Conference, Birmingham, pp. 225–232 (1959)

    Google Scholar 

  5. Jung, D.-M., Krishnamoorthy, M.S., Nagy, G., Shapira, A.: N-Tuple Features for OCR Revisited. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(7), 734–745 (1996)

    Article  Google Scholar 

  6. Hand, D.J.: Recent Advances in Error Rate Estimation. Pattern Recognition Letters 4, 335–346 (1986)

    Article  Google Scholar 

  7. Jorgensen, T.M., Christensen, S.S., Liisberg, C.: Crossvalidation and information measures for RAM based neural networks. In: Bisset, D. (ed.) Proc. of the Weightless Neural Networks Workshop (WNNW 1995), pp. 87–92. University of Kent at Canterbury, UK (1995)

    Google Scholar 

  8. Rohwer, R., Cressy, D.: Phoneme classification by boolean networks. In: Proceedings of the European Conference on Speech Communication and Technology, pp. 557–560 (1989)

    Google Scholar 

  9. Mitchell, R.J., Minchinton, P.R.: Optimising memory usuage in n-tuple networks. Mathematics & Computers in Simulation 40, 549–563 (1996)

    Article  Google Scholar 

  10. Wilkinson, R., Geist, J., Janet, S., Grother, P., Burges, C., Creecy, R., Hammond, B., Hull, J., Larsen, N., Vogl, T., Wilson, C.: The first census optical character recognition systems conference. Technical Report NISTIR 4912, National Institute of Standards and Technology, Gaithersburg, USA (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Azhar, H.B., Dimond, K. (2004). A Stochastic Search Algorithm to Optimize an N-tuple Classifier by Selecting Its Inputs. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30125-7_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23223-0

  • Online ISBN: 978-3-540-30125-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics