Visual recognition memory for binary pictures: another look

Recognition memory for matrices of 0s and 1s was examined as a function of the number of elements (complexity) and density of those elements within the matrix. It was found that with greater density and lesser complexity, recognition performance improved. This result contradicts an earlier finding of Green and Purohit, who concluded that the more complicated matrices led to better performance. The present study suggests that their conclusion was erroneous and stemmed from failure to control the physical parameters of density and number of elements in the matrix. Implications for the general problem of recognition memory and eye movements are discussed.