Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-14T18:15:15.862Z Has data issue: false hasContentIssue false
  • English
  • Français

Characterizing chunks in visual short-term memory: Not more than one feature per dimension?

Published online by Cambridge University Press:  30 October 2001

Werner X. Schneider ,
Heiner Deubel  and
Maria-Barbara Wesenick
Werner X. Schneider
Affiliation:
Institute of Psychology, Ludwig-Maximilians-University Munich, D-80802 Munich, Germanywxs@psy.uni-muenchen.dedeubel@psy.uni-muenchen.dewesenick@psy.uni-muenchen.de www.paed.uni-muenchen.de/mip/psych/deubel/wwwdocs/index.htm
Heiner Deubel
Affiliation:
Institute of Psychology, Ludwig-Maximilians-University Munich, D-80802 Munich, Germanywxs@psy.uni-muenchen.dedeubel@psy.uni-muenchen.dewesenick@psy.uni-muenchen.de www.paed.uni-muenchen.de/mip/psych/deubel/wwwdocs/index.htm
Maria-Barbara Wesenick
Affiliation:
Institute of Psychology, Ludwig-Maximilians-University Munich, D-80802 Munich, Germanywxs@psy.uni-muenchen.dedeubel@psy.uni-muenchen.dewesenick@psy.uni-muenchen.de www.paed.uni-muenchen.de/mip/psych/deubel/wwwdocs/index.htm
Get access Rights & Permissions [Opens in a new window]

Abstract

Cowan defines a chunk as “a collection of concepts that have strong associations to one another and much weaker associations to other chunks currently in use.” This definition does not impose any constraints on the nature and number of elements that can be bound into a chunk. We present an experiment to demonstrate that such limitations exist for visual short-term memory, and that their analysis may lead to important insights into properties of visual memory.

Type
Brief Report
Information
Behavioral and Brain Sciences , Volume 24 , Issue 1 , February 2001 , pp. 144 - 145
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)