Jump to ContentJump to Main Navigation
Computational Neuroscience of Vision$
Users without a subscription are not able to see the full content.

Edmund Rolls and Gustavo Deco

Print publication date: 2001

Print ISBN-13: 9780198524885

Published to Oxford Scholarship Online: March 2012

DOI: 10.1093/acprof:oso/9780198524885.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. 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 www.oxfordscholarship.com/page/privacy-policy).date: 12 November 2018

Visual attentional mechanisms

Visual attentional mechanisms

(p.126) 6 Visual attentional mechanisms
Computational Neuroscience of Vision

Edmund T. Rolls

Oxford University Press

This chapter examines the classical psychophysical view of selective visual attention, and the physiological findings that suggest an alternative neurodynamical view based on the biased competition hypothesis. It discusses the computational models of visual attention, the biased competition hypothesis in single-cell studies, and the neuropsychology of attention. The chapter concludes that human neuroimaging experiments have extended the validity of the biased competition hypothesis from the neuronal level to the intermediate level of cortical areas, and suggests candidate areas from where the biasing signal may originate.

Keywords:   visual attention, biased competition, computational models, neuropsychology, neuroimaging experiments

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 .