Skip to main content

Transforming Fundamental Set of Patterns to a Canonical Form to Improve Pattern Recall

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3315))

Abstract

Most results (lemmas and theorems) providing conditions under which associative memories are able to perfectly recall patterns of a fundamental set are very restrictive in most practical applications. In this note we describe a simple but effective procedure to transform a fundamental set of patterns (FSP) to a canonical form that fulfils the propositions. This way pattern recall is strongly improved. We provide numerical and real examples to reinforce the proposal.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Steinbuch, K., Lernmatrix, D.: Kybernetik.  1(1), 26–45 (1961)

    Google Scholar 

  2. Wilshaw, D., et al.: Non-holographic associative memory. Nature 222, 960–962 (1969)

    Article  Google Scholar 

  3. Anderson, J.A.: A simple neural network generating an interactive memory. Mathematical Biosciences 14, 197–220 (1972)

    Article  MATH  Google Scholar 

  4. Kohonen, T.: Correlation matrix memories. IEEE Transactions on Computers 21(4), 353–359 (1972)

    Article  MATH  Google Scholar 

  5. Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of the National Academy of Sciences, vol. 79, pp. 2554–2558 (1982)

    Google Scholar 

  6. Ritter, G.X., et al.: Morphological associative memories. IEEE Transactions on Neural Networks 9, 281–293 (1998)

    Article  Google Scholar 

  7. Yáñez, C.: Associative Memories based on Order Relations and Binary Operators (In Spanish), PhD Thesis, Center for Computing Research, February of (2002)

    Google Scholar 

  8. Sossa, H., Barrón, R.: New associative model for pattern recall in the presence of mixed noise. In: IASTED Fifth International Conference on Signal and Image Processing (SIP 2003), Honolulu, Hawaii, USA, August 13-15 (2003)

    Google Scholar 

  9. Otsu, N.: A threshold selection method from gray-level histograms. IEEE Transactions on SMC 9(1), 62–66 (1979)

    MathSciNet  Google Scholar 

  10. Jain, R., et al.: Machine Vision. McGraw-Hill, New York (1995)

    Google Scholar 

  11. Hu, M.K.: Visual pattern recognition by moment invariants. IRE Transactions on Information Theory 8, 179–187 (1962)

    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

Sossa, H., Barrón, R., Vázquez, R.A. (2004). Transforming Fundamental Set of Patterns to a Canonical Form to Improve Pattern Recall. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30498-2_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23806-5

  • Online ISBN: 978-3-540-30498-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics