Skip to main content

Efficient Pattern Recalling Using a Non Iterative Hopfield Associative Memory

  • Conference paper
  • 897 Accesses

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

Abstract

Actually associative memories have demonstrated to be useful in pattern processing field. Hopfield model is an autoassociative memory that has problems in the recalling phase; one of them is the time of convergence or non convergence in certain cases with patterns bad recovered. In this paper, a new algorithm for the Hopfield associative memory eliminates iteration processes reducing time computing and uncertainty on pattern recalling. This algorithm is implemented using a corrective vector which is computed using the Hopfield memory. The corrective vector adjusts misclassifications in output recalled patterns. Results show a good performance of the proposed algorithm, providing an alternative tool for the pattern recognition field.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Acevedo, M.: Memorias asociativas bidireccionales alfa – beta. Ph.D. Thesis, Centre of Computer Research, Instituto Politécnico National. México (2006)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Abu, M., Jacques, J.: Information capacity of the Hopfield model. IEEE Transactions on Information Theory IT-31(4), 461–464 (1985)

    Article  MATH  Google Scholar 

  4. Catalán, E., Yáñez, C.: Non iterative Hopfield model. In: Proceedings of the Electronics, Robotics and Automotive Mechanics Conference, CERMA 2006 (2006)

    Google Scholar 

  5. Román, G., López, I., Yáñez, M.: A new classifier based on Associative Memories. In: Proc. 15th International Conference on Computing CIC 2006, pp. 55–59. IEEE Computer Society, Los Alamitos (2006)

    Chapter  Google Scholar 

  6. Palm, G., Schwenker, F., Sommer, F.T., Strey, A.: Neural associative memories. In: Krikelis, A., Weems, C.C. (eds.) Associative Processing and Processors, pp. 307–326. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

  7. Yañez, C.: Memorias Asociativas basadas en relaciones de orden y operadores binarios. Ph.D. Thesis. Center of Computer Research, Instituto Politécnico National. México (2002)

    Google Scholar 

  8. Anderson, J., Bower, G.: Memoria Asociativa, México, Limusa (1977)

    Google Scholar 

  9. Flores, R., Yañez, C.: Memorias asociativas alfa beta basadas en código Johnson Möbius modificado. Ms.C. Thesis. Center of Computer Research, Instituto Politécnico National. México (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carbajal Hernández, J.J., Sánchez Fernández, L.P. (2011). Efficient Pattern Recalling Using a Non Iterative Hopfield Associative Memory. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25330-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25329-4

  • Online ISBN: 978-3-642-25330-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics