1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Saccade Landing Point Prediction Based on Fine-Grained Learning Method

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The landing point of a saccade defines the new fixation region, the new region of interest. We asked whether it was possible to predict the saccade landing point early in this very fast eye movement. This work proposes a new algorithm based on LSTM networks and a fine-grained loss function for saccade landing point prediction in real-world scenarios. Predicting the landing point is a critical milestone toward reducing the problems caused by display-update latency in gaze-contingent systems that make real-time changes in the display based on eye tracking. Saccadic eye movements are some of the fastest human neuro-motor activities with angular velocities of up to 1,000°/s. We present a comprehensive analysis of the performance of our method using a database with almost 220,000 saccades from 75 participants captured during natural viewing of videos. We include a comparison with state-of-the-art saccade landing point prediction algorithms. The results obtained using our proposed method outperformed existing approaches with improvements of up to 50% error reduction. Finally, we analyzed some factors that affected prediction errors including duration, length, age, and user intrinsic characteristics.

          Related collections

          Most cited references43

          • Record: found
          • Abstract: found
          • Article: not found

          Long Short-Term Memory

          Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow. We briefly review Hochreiter's (1991) analysis of this problem, then address it by introducing a novel, efficient, gradient-based method called long short-term memory (LSTM). Truncating the gradient where this does not do harm, LSTM can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units. Multiplicative gate units learn to open and close access to the constant error flow. LSTM is local in space and time; its computational complexity per time step and weight is O(1). Our experiments with artificial data involve local, distributed, real-valued, and noisy pattern representations. In comparisons with real-time recurrent learning, back propagation through time, recurrent cascade correlation, Elman nets, and neural sequence chunking, LSTM leads to many more successful runs, and learns much faster. LSTM also solves complex, artificial long-time-lag tasks that have never been solved by previous recurrent network algorithms.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Multilayer feedforward networks are universal approximators

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Deep learning in neural networks: An overview

              In recent years, deep artificial neural networks (including recurrent ones) have won numerous contests in pattern recognition and machine learning. This historical survey compactly summarizes relevant work, much of it from the previous millennium. Shallow and Deep Learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects. I review deep supervised learning (also recapitulating the history of backpropagation), unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.
                Bookmark

                Author and article information

                Journal
                101639462
                43012
                IEEE Access
                IEEE Access
                IEEE access : practical innovations, open solutions
                2169-3536
                19 April 2021
                1 April 2021
                2021
                11 May 2021
                : 9
                : 52474-52484
                Affiliations
                [1 ]BiDA-Lab, Department of Electrical Engineering, Universidad Autonoma de Madrid, 28049 Madrid, Spain
                [2 ]Schepens Eye Research Institute, Massachusetts Eye and Ear, Boston, MA 02114, USA
                [3 ]Department of Ophthalmology, Harvard Medical School, Boston, MA 02115, USA
                Author notes
                Corresponding authors: Aythami Morales ( aythami.morales@ 123456uam.es ), Francisco M. Costela ( francisco_costela@ 123456meei.harvard.edu ), and Russell L. Woods ( russell_woods@ 123456meei.harvard.edu ).
                Author information
                http://orcid.org/0000-0002-7268-4785
                http://orcid.org/0000-0002-7193-1211
                Article
                NIHMS1692924
                10.1109/access.2021.3070511
                8112574
                33981520
                3bdc6c85-27bf-4183-9ff6-147799fa200e

                This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/

                History
                Categories
                Article

                saccade,eye movement,gaze-contingent,recurrent neural networks,lstm,fine-grained learning

                Comments

                Comment on this article