Rapid parallel allocation of attention to multiple objects
نویسندگان
چکیده
منابع مشابه
Rapid top-down control over template-guided attention shifts to multiple objects
Previous research has shown that when observers search for targets defined by a particular colour, attention can be directed rapidly and independently to two target objects that appear in close temporal proximity. We investigated how such rapid attention shifts are modulated by task instructions to selectively attend versus ignore one of these objects. Two search displays that both contained a ...
متن کاملParallel fuzzy segmentation of multiple objects
The usefulness of fuzzy segmentation algorithms based on fuzzy connectedness principles has been established in numerous publications. New technologies are capable of producing larger-and-larger datasets and this causes the sequential implementations of fuzzy segmentation algorithms to be time-consuming. We have adapted a sequential fuzzy segmentation algorithm to multi-processor machines. We d...
متن کاملThe Rapid Capture of Attention by Rewarded Objects
When a stimulus is associated with a reward, it becomes prioritized, and the allocation of attention to that stimulus increases. For low-level features, such as color, this reward-based allocation of attention can manifest early in time and as a faster and stronger shift of attention to targets with that color, as reflected by the N2pc (a parieto-occipital electrophysiological component peaking...
متن کاملThe parallel representation of the objects selected by attention.
The allocation of visual attention is known to be influenced by objects (B. Scholl, 2001). This object sensitivity is commonly assumed to derive from a pre-attentive stage of scene segmentation that provides a parallel representation of important structural features that can play a functional role in guiding the allocation of processing resources. In many standard "object-based attention" exper...
متن کاملMultiple-Choice Balanced Allocation in (Almost) Parallel
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches. We study this scenario in an abstract framework of allocating balls into bins. We revisit the allocation algorithm GREEDY[2] due to Azar, Broder, Karlin, and Upfal (SIAM J. Comput. 1999), in which, for sequentially arriving balls, each ball chooses two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2015
ISSN: 1534-7362
DOI: 10.1167/15.12.1058