Jump to ContentJump to Main Navigation
Visual Memory$
Users without a subscription are not able to see the full content.

Steven J. Luck and Andrew Hollingworth

Print publication date: 2008

Print ISBN-13: 9780195305487

Published to Oxford Scholarship Online: September 2008

DOI: 10.1093/acprof:oso/9780195305487.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy).date: 24 October 2017

Associative Learning Mechanisms in Vision

Associative Learning Mechanisms in Vision

Chapter:
(p.209) Chapter 7 Associative Learning Mechanisms in Vision
Source:
Visual Memory
Author(s):

Marvin M. Chun

Nicholas B. Turk-Browne

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780195305487.003.0007

This chapter begins with a review of behavioral evidence of associative learning in vision. It considers which types of associations can be learned, and then explores the properties and constraints of the mechanisms involved in such learning. It also discusses how visual processing can be facilitated by knowledge of associative relationships between objects. The second part of the chapter analyzes the neural mechanisms that support visual associative learning.

Keywords:   associative memory, visual associative learning, visual processing, neural mechanisms

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .