Visual routines are associated with specific graph interpretations

نویسندگان

  • Audrey L Michal
  • Steven L Franconeri
چکیده

We argue that people compare values in graphs with a visual routine - attending to data values in an ordered pattern over time. Do these visual routines exist to manage capacity limitations in how many values can be encoded at once, or do they actually affect the relations that are extracted? We measured eye movements while people judged configurations of a two-bar graph based on size only ("[short tall] or [tall short]?") and contrast only ("[light dark] or [dark light]?"). Participants exhibited visual routines in which they systematically attended to a specific feature (or "anchor point") in the graph; in the size task, most participants inspected the taller bar first, and in the contrast task, most participants attended to the darker bar first. Participants then judged configurations that varied in both size and contrast (e.g., [short-light tall-dark]); however, only one dimension was task-relevant (varied between subjects). During this orthogonal task, participants overwhelmingly relied on the same anchor point used in the single-dimension version, but only for the task-relevant dimension (e.g., taller bar for the size-relevant task). These results suggest that visual routines are associated with specific graph interpretations. Responses were also faster when task-relevant and task-irrelevant anchor points appeared on the same object (congruent) than on different objects (incongruent). This interference from the task-irrelevant dimension suggests that top-down control may be necessary to extract relevant relations from graphs. The effect of visual routines on graph comprehension has implications for both science, technology, engineering, and mathematics pedagogy and graph design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

روال‌های رایج روزمره در خانواده‌های کودکان دارای اتیسم: مرور نظام‌مند

Objective Routines are a set of daily and regular activities that play an important role in the development of the child and the family. These activities include building the structure for daily life, developing social skills, academic skills, speech skills, facilitating family relationships, and creating a sense of belonging among family members. This study examines the routines of families of...

متن کامل

Consistent Modeling of Functional Dependencies along with World Knowledge

In this paper we propose a method for vision systems to consistently represent functional dependencies between different visual routines along with relational shortand long-term knowledge about the world. Here the visual routines are bound to visual properties of objects stored in the memory of the system. Furthermore, the functional dependencies between the visual routines are seen as a graph ...

متن کامل

Graph-based Visual Saliency Model using Background Color

Visual saliency is a cognitive psychology concept that makes some stimuli of a scene stand out relative to their neighbors and attract our attention. Computing visual saliency is a topic of recent interest. Here, we propose a graph-based method for saliency detection, which contains three stages: pre-processing, initial saliency detection and final saliency detection. The initial saliency map i...

متن کامل

Evolving Visual Routines

Traditional machine vision assumes that the vision system recovers a complete, labeled description of the world [Marr, 1982]. Recently, several researchers have criticized this model and proposed an alternative model which considers visual perception as a distributed collection of task-specific, context-driven visual routines [Aloimonos, 1993, Ullman, 1984]. Some of these researchers have argue...

متن کامل

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2017