Reducing Satisfaction of Search Errors in Visual Search
نویسندگان
چکیده
منابع مشابه
Understanding Search and Errors in Comparative Visual Search: Insights from Eye-Gaze Studies
We demonstrate that the search for a target during a comparative visual search task of two side-by-side images is undertaken in two stages. First a regular scan path search phase for a likely target is made, followed by a confirmation phase of several fixations on the target in each side-by-side image. The horizontal saccades occurring during the confirmation phase and fixations between left an...
متن کاملVisual Semantics for Reducing False Positives in Video Search
This research explores the interaction of textual and visual information in video indexing and searching. Much of the recent work has focused on machine learning techniques that learn from both text and image/video features, e.g. the text surrounding a photograph on a web page. This is useful in similarity search (i.e. searching by example), but has drawbacks when more semantic search is desire...
متن کاملAn individual differences approach to multiple-target visual search errors: How search errors relate to different characteristics of attention.
A persistent problem in visual search is that searchers are more likely to miss a target if they have already found another in the same display. This phenomenon, the Subsequent Search Miss (SSM) effect, has remained despite being a known issue for decades. Increasingly, evidence supports a resource depletion account of SSM errors-a previously detected target consumes attentional resources leavi...
متن کاملIn Search of the Best Constraint Satisfaction Search 3
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instances with given characteristics, we show how the relative performance of various search methods varies with the number of variables, the tightness of the constraints, and the sparseness of the constraint graph. A version...
متن کاملIn Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instances with given characteristics, we show how the relative performance of various search methods varies with the number of variables, the tightness of the constraints, and the sparseness of the constraint graph. A version...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/10.7.1301