<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>ViSTA: Visualisation of Scanpath Trend Analysis (STA)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sukru Eraslan</string-name>
          <email>seraslan@metu.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serkan Karabulut</string-name>
          <email>karabulut.serkan@metu.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mehmet Can Atalay</string-name>
          <email>atalay.can@metu.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yeliz Yesilada</string-name>
          <email>yyeliz@metu.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Middle East Technical University Northern Cyprus Campus</institution>
          ,
          <addr-line>99738 Kalkanl , Guzelyurt, Mersin 10</addr-line>
          <country country="TR">Turkey</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Eye tracking plays a key role in understanding user behaviours and usability studies. We have previously proposed an algorithm called STA (Scanpath Trend Analysis) that analyses multiple individual scanpaths on a web page to discover their trending path in terms of the areas of interest (AOIs) of the page. It provides a good understanding of how users interact with web pages in general. Our extensive previous work shows that this algorithm provides the most representative path of multiple users as its result is more similar to individual scanpaths in comparison with the results of other algorithms. However, its current implementation has no graphical user interface and provides a sequence of characters that represent AOIs. Some platform and modules should also be installed in advance to run it. To address these limitations, this paper presents a web-based visualisation tool for the STA algorithm called ViSTA. This tool allows researchers and practitioners to visualise individual scanpaths on a particular web page with gaze plots, visually draw AOIs, apply the STA algorithm, and visualise the result of the algorithm with an AOI graph. Our user evaluation shows that the workload is lower with the ViSTA tool compared to the current implementation of the STA algorithm.</p>
      </abstract>
      <kwd-group>
        <kwd>Eye Tracking</kwd>
        <kwd>Areas of Interest</kwd>
        <kwd>Web Pages</kwd>
        <kwd>Trending Path</kwd>
        <kwd>Web-based</kwd>
        <kwd>User Interface</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>O zet. Goz izleme teknolojisi insan davran slar n anlama ve kullan labilirlik
cal smalar nda etkin bir rol oynamaktad r. Yapt g m z onceki cal smalarda
STA (Scanpath Trend Analysis) algoritmas n onerdik. Bu algoritma
bir sayfa uzerindeki bircok kisiye ait tarama guzergah n analiz ederek,
sayfa uzerindeki ilgi alanlar cinsinden populer olan tarama guzergah n
c kar yor. Bu guzergah kullan c lar n ilgili web sayfas ile genel olarak
nas l etkilesim kurdugunu anlamay sagl yor. Onceki cal smalar m z
gosteriyor ki literaturdeki benzer algoritmalar ile kars last r ld g zaman, STA
algoritmas n n sonucu bireysel tarama guzergahlar na daha cok
bezerlik gosteriyor. Fakat, STA algoritmas n n gorsel bir ara yuzu yoktur ve
sonucu ise her karakteri sayfa uzerindeki belirli bir alan ifade eden
alfanumerik bir karakter dizisi seklindedir. Bu uygulaman n cal st r labilmesi
icin ise baz platform ve modullerin onceden yuklenmesi gerekmektedir.
Bu bildiri, STA algoritmas n n var olan uygulamas n n s n rlamalar n
ortadan kald ran web tabanl gorsel bir uygulama sunmaktad r. Bu gorsel
uygulama ile arast rmac lar ve pratisyenler bireysel tarama guzergahlar n
bak s gra gi isimli teknik ile gorsellestirebilecek, gorsel olarak sayfa
uzerindeki ilgi alanlar n belirleyebilecek, STA algoritmas n uygulayabilecek,
ve bu algoritman n sonucunu da yine ilgi alanlar haritas isimli teknik ile
gorsellestirilebilecektir. Yapt g m z kullan c degerlendirmeleri bu gorsel
uygulaman n STA algoritmas n n uygulanmas icin gerekli is yogunlugunu
azaltt g n gostermektedir.</p>
    </sec>
    <sec id="sec-2">
      <title>Anahtar Kelimeler: Goz I_zleme, I_lgi Alanlar , Web Sayfalar , Populer</title>
      <p>Guzergah, Web Tabanl , Kullan c Ara Yuzu
1</p>
      <sec id="sec-2-1">
        <title>Introduction</title>
        <p>
          Eye tracking has been commonly used for better understanding of how users
interact with web pages, especially which areas are frequently used and which
paths are usually followed in terms of these areas to complete certain tasks.
Based on the analysis of eye tracking data, web pages can be further processed
to support users in constrained environments for completing their tasks. In
particular, web pages can be re-engineered for these users to allow them to directly
access the most frequently used areas without being distracted by other
inappropriate areas. This is especially useful for visually disabled users who access
the web with their screen readers and have to listen clutter [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>
          While users are interacting with web pages, their eyes make quick movements
called saccades. Their eyes also make xations on certain points. The series of
saccades and xations show their scanpaths on these pages. There are di erent
techniques to visualise individual scanpaths [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] (Section 2). The most popular
technique for scanpath visualisation is a gaze plot that represents saccades and
xations with straight lines and circles respectively. The radius of a circle is
directly proportional to the duration of a xation and each circle is numbered
to show the sequence. Figure 1 shows an example of a gaze plot on the home
page of the Babylon website.
        </p>
        <p>
          To conduct scanpath analysis on the web, web pages are typically divided
into their areas that can interest or attract users (AOIs) and then xations
are represented with their corresponding AOIs. For example, Figure 1 shows
how the home page of the Babylon website is automatically divided into its
AOIs with the extended Vision-based Page Segmentation (VIPS) algorithm [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
If a user looks at the AOIs M, H and H respectively, then his/her path will
be represented as MHH. After representing scanpaths in terms of AOIs, they
are further analysed for di erent purposes, especially calculating a similarity
score between two scanpaths, computing transition probabilities between AOIs,
detecting patterns in scanpaths, or discovering a single representative scanpath
of multiple users [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>
          Even though there are di erent algorithms which aim to detect patterns in
multiple scanpaths or discover a representative scanpath for a group of
scanpaths, their results typically have low similarities to individual scanpaths [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
Compared to these algorithms, Scanpath Trend Analysis (STA) discovers the
most representative path of multiple users on a web page as its result is the
most similar to individual scanpaths [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] (Section 2). However, the current
implementation of the STA algorithm1 has no visual user interface and its output is
only a sequence of alphanumeric characters that represent AOIs (e.g., ABACD).
This algorithm is novel in this eld and is being increasingly used. To
understand and interpret the output, researchers and practitioners should remember
which alphanumeric character corresponds to which AOI. If a visual user
interface is developed for the STA algorithm and its output is also visualised on a
corresponding page, then we eliminate the burden of remembering and
understanding the sequence of letters. Furthermore, some platform and modules are
also needed to be installed in advance to run the current implementation.
        </p>
        <p>
          To address the limitations of the current implementation of the STA
algorithm and make it more usable and functional, this paper presents the rst
web-based visualisation tool for this algorithm called Visualisation of Scanpath
Trend Anlaysis or shortly ViSTA (Section 3). This tool does not need any speci c
platform and modules installed. It allows users to upload an eye tracking dataset
and select one of the web pages included in the dataset for further analysis. Since
gaze plots are commonly used to visualise scanpaths, this tool visualises the
in1 STA's current implementation: https://github.com/SukruEraslan/sta
dividual scanpaths on the selected page by using gaze plots [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. It then allows
users to visually draw AOIs on the page and apply the STA algorithm for
discovering the trending path based on the drawn AOIs. The trending path is then
visualised by using an AOI graph. Since an AOI graph shows both AOIs and
transitions between these AOIs, it would be easier to recognise which AOIs are
trending among users and in which order these AOIs are visited.
        </p>
        <p>The ViSTA tool can be used by eye tracking researchers, usability
evaluators, data scientists and psychologists. Our user evaluation shows that the STA
algorithm can be used with less workload with this tool (Section 4). Although
it is mainly designed for visualising the STA algorithm, other such algorithms
can also be integrated into this tool. Similarly, other visualisation techniques
can also be integrated so that the outputs of the algorithms can be visualised in
di erent ways (Sections 5 and 6).
2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Related Work</title>
        <p>
          A large number of techniques have been proposed in the literature to visualise
eye tracking data on 2D and 3D visual stimuli in context or not in context [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
Heat maps and gaze plots have been commonly used in eye tracking research for
visualisation. Heat maps use spatial information of eye tracking data, speci cally
x, y and possibly z coordinates of xations. These maps use di erent colours to
di erentiate which areas are commonly used and which areas are rarely used by
users. For example, Tobii Studio Software [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] generates heat maps which show
the commonly used areas with the red colour and the rarely used areas with the
green colour. These maps can be generated based on di erent features, such as
xation counts or xation durations. Although the most commonly used areas
can easily be recognised with heat maps, these maps do not take sequential
information into consideration. Speci cally, heat maps do not allow to determine in
which order these areas are used. Even though gaze plots use both spatial and
sequential information as illustrated in Figure 1, they will overlap each other when
there are many scanpaths. Therefore, the visualisation of many scanpaths with
gaze plots at the same time would be a problem because it would be di cult to
analyse them. There are also some visualisation techniques which are designed
to visualise eye tracking data based on given AOIs [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. In particular, each AOI
can be used as a node (represented with circles) in a graph and directed edges
(represented with lines) between these nodes are used to illustrate transitions
between AOIs [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The sizes of nodes can be determined based on di erent
features, such as xation count or dwell time [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The thickness of edges can also
be determined based on di erent features, such as the number of transitions [
          <xref ref-type="bibr" rid="ref2 ref8">8,
2</xref>
          ]. This visualisation technique is called an AOI graph [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ].
        </p>
        <p>
          Even though some of these visualisation techniques have a web-based
interface (such as, [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]), most of them do not have a web-based interface which would
allow researchers and practitioners to directly access and use them in their
studies without installing extra platform and modules on their computers. There
are also di erent algorithms available to process and analyse eye tracking data,
especially scanpaths [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. However, the results of these algorithms are typically
not visualised with any visualisation technique on the web platform, with some
exceptions [
          <xref ref-type="bibr" rid="ref12 ref3">12, 3</xref>
          ]. For example, the ScanGraph tool2 nds similarities between
individual scanpaths based on one of three methods (Levenshtein,
NeedlemanWunsch and Damerau-Levenshtein) and produces a graph where similar
scanpaths are connected to each other [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>
          To the best of our knowledge, none of the algorithms which discover a
representative scanpath for multiple scanpaths has a tool to visualise their outputs
on the web platform. This paper presents a web-based visualisation tool for the
STA algorithm which is able to identify the most representative path for multiple
users [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The STA algorithm is a multi-pass algorithm with three main stages
which are responsible for preparing individual scanpaths, identifying trending
AOIs and constructing the trending path with the trending AOIs respectively
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The rst stage represents each xation with its corresponding AOI and each
individual scanpath is represented a series of AOIs. The second stage identi es
trending AOIs to be used for the construction of the trending path. If a
particular AOI gets at least the same attention as the fully shared AOIs in terms of
the total xation duration and the total number of xations, it is considered as
trending AOI. The last stage constructs the trending scanpath by combining the
trending AOIs based on their overall positions in the individual scanpaths. The
full description of the STA algorithm can be found in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>ViSTA</title>
        <p>The ViSTA tool3 can be used to upload an eye tracking dataset, visualise
individual scanpaths with gaze plots, visually draw AOIs on stimuli, apply the STA
algorithm to discover the trending scanpath and then visualise the trending path
with an AOI graph. As illustrated in Figure 2, the ViSTA tool is comprised of
three main modules explained below which are as follows: (1) Data
Processing, (2) Algorithmic Processing and (3) Visualisation Processing. This tool was
mainly developed by using jQuery which is a JavaScript library. The current
implementation of the STA algorithm was also slightly modi ed by using Flask4
to run it as a server which accepts POST requests from the ViSTA tool.
3.1</p>
        <sec id="sec-2-3-1">
          <title>Data Processing</title>
          <p>The rst module is responsible from taking eye tracking data and converting
this data into an internal storage format for further analysis. There should be a
di erent data le for each participant that contains the details of their xations
(index, timestamp, duration, x and y coordinates and stimuli name). These
data les should include web page links as stimuli name since the ViSTA tool is
currently designed for scanpath analysis on the web. This tool accesses each page
2 ScanGraph: www.eyetracking.upol.cz/scangraph
3 ViSTA: http://iam.ncc.metu.edu.tr/vistatool/demo/index.html
4 Micro web framework for Python: http://flask.pocoo.org/
by using their links to retrieve some information, especially their titles. When the
data les are uploaded and they are converted into an internal storage format,
this module becomes ready to send the data to the next module for further
processing.</p>
          <p>In this tool, two algorithms are
currently available: (i) the gaze plot
algorithm which further processes the
data to visualise individual scanpaths
with gaze plots; and (ii) the STA
algorithm which further processes the
data to identify the trending
scanpath. Since the ViSTA tool rstly
visualises individual scanpaths with
gaze plots, the algorithm parameter
is set to the gaze plot algorithm
internally here so that individual
scanpaths are visualised with gaze plots in
the rst round.</p>
          <p>The Visualisation Processing module takes the results of the algorithms and
visualises them with their visualisation techniques by using vis.js5. In particular,</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5 Dynamic, browser based visualisation library: http://visjs.org/</title>
      <p>3.2</p>
      <sec id="sec-3-1">
        <title>Algorithmic Processing</title>
        <p>When the Algorithmic Processing
module takes the data, it further
processes the data based on the setted
algorithm parameter. If the algorithm
parameter is set to the gaze plot
algorithm, this module further processes
the data to be able to visualise
individual scanpaths with gaze plots.
However, if the algorithm parameter
is set to the STA algorithm, this
module further process the data to
discover the trending path. Therefore,
the algorithm processing modules
either prepares the data to be visualised
with gaze plots or applies the STA
algorithm and prepares the result to be
visualised with an AOI graph based
on the algorithm parameter.
3.3</p>
      </sec>
      <sec id="sec-3-2">
        <title>Visualisation Processing</title>
        <p>when the results of the gaze plot algorithm are received, researchers and
practitioners should rstly select which participants' scanpaths on which web pages
will be visualised with gaze plots. By default, all the participants are selected.
When the participants and the web page are selected, this tool takes a screen
shot of the page with html2canvas6 by using its link and the individual
scanpaths are visualised on the page with gaze plots. Figure 3 shows how the ViSTA
tool visualises individual scanpaths on the home page of the Babylon website
with gaze plots. Researchers and practitioners can then visually draw AOIs to
be used with the STA algorithm. If no AOI is drawn, the STA algorithm can
not be selected for further processing the data because this algorithm discovers
the trending scanpath in terms of the AOIs. As an example, Figure 3 also shows
three AOIs identi ed by a user on the home page of the Babylon website.</p>
        <p>
          When the STA algorithm is selected after the visualisation of individual
scanpaths with gaze plots and the result of the STA algorithm is received, this
module rstly pre-processes the result for visualisation, and then visualises it by
using an AOI graph. An example of this visualisation is shown in Figure 4. Since
the AOI that includes the link to download the free version of Babylon is the
most frequent AOI in the trending path, its node is larger than other two AOIs'
nodes.
6 Screenshots with JavaScript: https://html2canvas.hertzen.com/
In order to assess the e ectiveness of the VISTA tool, a user study was
conducted with NASA Task Load Index (TLX)7. This metric is widely used to
perform workload assessments for di erent user interfaces and is composed of six
attributes: Mental Demand, Physical Demand, Temporal Demand, Performance,
E ort and Frustration. Each attribute is assessed by the participants by giving
a value between 1 and 20. Higher values represent negative scores. In this study,
our research question was \Does the VISTA tool have better TLX attributes in
comparison with the current implementation of the STA algorithm?"
A detailed description of the dataset used in the user study can be found in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
In this user study, we used a subset of that dataset. First of all, we randomly
divided the dataset into two halves called dataset A and dataset B. We then
asked our participants to apply the current implementation of the STA algorithm
with one half of the dataset and the VISTA tool with the other half to identify
their trending paths on a particular web page. A half of the participants used
the current implementation of the algorithm and then the VISTA tool whereas
another half used the VISTA tool and then the current implementation of the
algorithm. Besides this, a half of the participants applied the VISTA tool with the
7 NASA TLX: https://humansystems.arc.nasa.gov/groups/tlx/
dataset A and the current implementation of the algorithm with the dataset B
whereas another half applied the VISTA tool with the dataset B and the current
implementation of the algorithm with the dataset A. Therefore, we ensured that
all the cases were counterbalanced to deal with any possible familiarity and order
e ects. When the participants identi ed the trending scanpath for a particular
dataset, they were given a printed copy of the page to draw the trending path
on the page and then they were asked to ll in the NASA TLX Form8.
Participants: The study was conducted at Middle East Technical University
Northern Cyprus Campus with four female and eight male students. The
participants were between the age of 18-24, apart from one of them who was between
the age of 25-34. All of the participants were daily web users. They were also
asked to assess their computer skills by using a 5-point Likert scale. The mean
value was 3.42 with the standard deviation 1.00.
        </p>
        <p>Procedure: The participants rstly read the information sheet to understand
the main objectives of the study and their rights and then they signed a consent
form. After that, they were asked to complete a short questionnaire to collect
their basic demographic information (gender, age groups, web usage, general
computer skills, and departments). A training session was then given to them
to illustrate how they can use the current implementation of the STA algorithm
and the VISTA tool. This training session mainly used a sample dataset (not
the one used in the evaluation). After the training session, they started their
evaluation session.</p>
        <p>Materials: The original eye tracking dataset includes six web pages with
varying level of visual complexities. We used the home page of the Babylon website
for the training sessions, and the home page of the Apple website for the
evaluation sessions.
4.2</p>
      </sec>
      <sec id="sec-3-3">
        <title>Results</title>
        <p>Figure 5 shows the comparison of the current implementation of the STA
algorithm and the VISTA tool based on the mean values of the NASA TLX
attributes where the error bars illustrate the standard deviation. Besides this,
Table 1 shows a detailed descriptive analysis of the NASA TLX attributes for
the current implementation of the STA algorithm and the ViSTA tool.</p>
        <p>The evaluation shows that the ViSTA tool needs less mental demand,
physical demand and temporal demand in comparison with the current
implementation of the STA algorithm. The participants also stated that they needed less
e ort to complete the given task with the ViSTA tool. Moreover, they were
less frustrated when they used the ViSTA tool. However, they stated that they
performed slightly better (better satis ed with their performance in achieving
the task) with the current implementation of the STA algorithm. Based on the
evaluation, we can suggest that the VISTA tool has a lower workload in terms
of mental demand, physical demand, temporal demand, e ort and frustration
level compared to the current implementation of the STA algorithm.
8 https://humansystems.arc.nasa.gov/groups/TLX/downloads/TLXScale.pdf
Tablo 1. Mean, median, standard deviation, maximum and minimum values of the
NASA TLX attributes for the current implementation of the STA algorithm and the
ViSTA tool
The ViSTA tool provides a web-based interface for the STA algorithm. It allows
researchers and practitioners to directly access and use the STA algorithm for
their studies without installing extra platform and modules on their computers.
Similar to other algorithms, the STA algorithm can also be used by di erent
researchers in di erent elds. Therefore, it should not be expected that all of
these researchers easily manage to download and run their implementations on
their computers. With the ViSTA tool, researchers and practitioners can
easily upload their eye tracking datasets and visually draw their AOIs to apply
the STA algorithm. When the trending path is generated with the algorithm,
it is visualised with an AOI graph so that researchers can easily interpret the
trending path without the need for remembering which alphanumeric
character represents which AOI as they will see the trending AOIs and the order in
which the AOIs are used. Our evaluation shows that the VISTA tool decreases
the workload of using the STA algorithm. Speci cally, the tool scores better in
TLX attributes in terms of mental demand, physical demand, temporal demand,
e ort and frustration level compared to the current implementation of the STA
algorithm. We evaluated the ViSTA tool with 12 people who were mostly not
experienced in eye tracking research and studies. In the future, we can conduct
further studies with more, and more experienced users for detailed feedback.</p>
        <p>
          The current version of the VISTA does not include automatic AOI detection
based on xation clusters or the source code of web pages. The tool allows
researchers to visually draw their own AOIs on the y. They may detect AOIs
by using di erent techniques and then they can draw the AOIs in the VISTA
tool. As the tool has an open architecture, it can be easily extended in the
future to support automatic AOI detection. For example, the VIPS algorithm
has been extended and implemented as a web service [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], so we can use this web
service to automatically segment web pages into their areas based on their source
code and visual representation. Appropriate clustering algorithms can also be
implemented as part of this tool to allow the identi cation of AOIs by clustering
xations [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Another visualisation level can also be added to the ViSTA tool
for AOIs which will be shared by other components of the tool.
        </p>
        <p>
          The ViSTA tool currently has only the STA algorithm, apart from the generic
algorithm to pre-process the data for visualising individual scanpaths with gaze
plots. However, it has an open architecture which means that other algorithms
can easily be integrated. For example, the SPAM algorithm has been used to
identify sequential patterns in eye tracking data [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. It can also be integrated
into this tool and its output can also be visualised with an AOI graph. However,
some studies need to be conducted.
        </p>
        <p>
          We are still improving this tool by exploring appropriate algorithms and
visualisation techniques to make this tool more functional and usable. In the future,
we are planning to add di erent visualisation techniques to the Visualisation
Module (see Figure 2), such as a time plot [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. As a consequence, when a
particular algorithm provides an output, a list of appropriate visualisation techniques
can be listed to be selected for visualising the output. The current version of the
ViSTA tool takes a screen shot of a web page by using its link for visualisation.
However, we are planning to allow researchers and practitioners to directly
upload their visual stimuli so that they can use this tool for other visual stimuli
which are not on the web. The visualisation of the outputs of the algorithms can
also be animated to make them more informative. For example, when the output
of the STA algorithm is visualised with an AOI graph, its nodes and edges can
be shown one at a time based on the time sequence which allows researchers
to focus on a particular trending AOI at a time during analysis. The ViSTA
tool can also be improved in a way that a particular algorithm can be applied
to di erent groups of participants (at the moment, the STA algorithm is only
applied to one group) and the results of these groups can be visualised on the
same visual stimulus for a comparison purpose. Additionally, an account system
can be created such that the users of the tool can have their workbenches. This
would allow them to store their datasets and revisit their workbenches.
        </p>
        <sec id="sec-3-3-1">
          <title>Conclusion</title>
          <p>The main aim of this paper is to introduce the rst web-based interface of the
STA algorithm. The STA algorithm is novel in this eld and it is being
increasingly used in di erent studies. Its visualisation, called ViSTA, will allow
researchers and practitioners to easily use the STA algorithm and understand
its output directly without the need of remembering the names of AOIs and
relating the AOIs to the output in their minds. Since there is a limited number
of web-based tools for analysing eye tracking data, our tool also makes an useful
contribution to eye tracking research. This tool is open to be further improved
by integrating other algorithms and visualisation techniques.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Akp nar, M.E.,
          <string-name>
            <surname>Yesilada</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <source>Vision Based Page Segmentation Algorithm: Extended and Perceived Success</source>
          , pp.
          <volume>238</volume>
          {
          <fpage>252</fpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Blascheck</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurzhals</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raschke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burch</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weiskopf</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ertl</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Visualization of eye tracking data: A taxonomy and survey</article-title>
          .
          <source>Computer Graphics Forum</source>
          <volume>36</volume>
          (
          <issue>8</issue>
          ),
          <volume>260</volume>
          {
          <fpage>284</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dolezalova</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popelka</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Scangraph: A novel scanpath comparison method using visualisation of graph cliques</article-title>
          .
          <source>Journal of Eye Movement Research</source>
          <volume>9</volume>
          (
          <issue>4</issue>
          ) (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Eraslan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yesilada</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harper</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Eye tracking scanpath analysis techniques on web pages: A survey, evaluation and comparison</article-title>
          .
          <source>Journal of Eye Movement Research</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ) (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Eraslan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yesilada</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harper</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Scanpath trend analysis on web pages: Clustering eye tracking scanpaths</article-title>
          .
          <source>ACM Trans. Web</source>
          <volume>10</volume>
          (
          <issue>4</issue>
          ),
          <volume>20</volume>
          :1{
          <fpage>20</fpage>
          :35 (Nov
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hejmady</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narayanan</surname>
            ,
            <given-names>N.H.</given-names>
          </string-name>
          :
          <article-title>Visual attention patterns during program debugging with an ide</article-title>
          .
          <source>In: Proceedings of the 2012 Symposium on ETRA</source>
          . pp.
          <volume>197</volume>
          {
          <fpage>200</fpage>
          . ETRA '12,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Herman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popelka</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hejlova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Eye-tracking analysis of interactive 3d geovisualization</article-title>
          .
          <source>Journal of Eye Movement Research</source>
          <volume>10</volume>
          (
          <issue>3</issue>
          ) (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Holmqvist</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holsanova</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barthelson</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lundqvist</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Reading or scanning? A study of newspaper and net paper reading</article-title>
          ., pp.
          <volume>657</volume>
          {
          <fpage>670</fpage>
          .
          <article-title>The mind's eye: cognitive and applied aspects of eye movement research</article-title>
          , Elsevier (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. Raiha,
          <string-name>
            <given-names>K.J.</given-names>
            ,
            <surname>Aula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Majaranta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Rantala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Koivunen</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>Static Visualization of Temporal Eye-Tracking Data</article-title>
          , pp.
          <volume>946</volume>
          {
          <fpage>949</fpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Santella</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>DeCarlo</surname>
          </string-name>
          , D.:
          <article-title>Robust clustering of eye movement recordings for quanti cation of visual interest</article-title>
          .
          <source>In: Proceedings of the 2004 Symposium on ETRA</source>
          . pp.
          <volume>27</volume>
          {
          <fpage>34</fpage>
          . ETRA '04,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Tobii Technology</surname>
            <given-names>AB</given-names>
          </string-name>
          :
          <article-title>Tobii StudioT M 2</article-title>
          .
          <string-name>
            <given-names>X</given-names>
            <surname>User</surname>
          </string-name>
          <article-title>Manual (Sep</article-title>
          .
          <year>2010</year>
          ).
          <article-title>Tobii Technology AB (</article-title>
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Topic</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yamaya</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aizawa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mart</surname>
            nez-Gomez,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Fix x: Fixing the xations</article-title>
          .
          <source>In: Proceedings of the Ninth Biennial ACM Symposium on ETRA</source>
          . pp.
          <volume>319</volume>
          {
          <fpage>320</fpage>
          . ETRA '16,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Yesilada</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harper</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eraslan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Experiential transcoding: An eyetracking approach</article-title>
          .
          <source>In: Proceedings of the 10th International Cross-Disciplinary Conference on Web Accessibility</source>
          . pp.
          <volume>30</volume>
          :
          <issue>1</issue>
          {
          <issue>30</issue>
          :
          <fpage>4</fpage>
          . W4A '
          <fpage>13</fpage>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>