Identifying Fixations in Gaze Data via Inner Density and Optimization

Published Online:https://doi.org/10.1287/ijoc.2018.0859

References

  • Andersson R, Larsson L, Holmqvist K, Stridh M, Nyström M (2017) One algorithm to rule them all? An evaluation and discussion of ten eye movement event-detection algorithms. Behav. Res. Methods 49(2):616–637.CrossrefGoogle Scholar
  • Bertsimas D, King A (2015) OR Forum: An algorithmic approach to linear regression. Oper. Res. 64(1):2–16.LinkGoogle Scholar
  • Bingham E (2010) Finding segmentations of sequences. Inductive Databases and Constraint-Based Data Mining (Springer, New York), 177–197.CrossrefGoogle Scholar
  • Blascheck T, Kurzhals K, Raschke M, Burch M, Weiskopf D, Ertl T (2014) State-of-the-art of visualization for eye tracking data. Borgo R, Maciejewski R, Viola I, eds. Eurographics Conf. Visualization (Eurographics Association, Swansea, UK).Google Scholar
  • Blignaut P (2009) Fixation identification: The optimum threshold for a dispersion algorithm. Attention, Percept. Psychophysics 71(4):881–895.CrossrefGoogle Scholar
  • Bradley PS, Mangasarian OL, Street WN (1997) Clustering via concave minimization. Mozer MC, Jordan MI, Petsche T, eds. Advances in Neural Information Processing Systems, vol. 9 (MIT Press, Denver), 368–374.Google Scholar
  • Charikar M, Chekuri C, Feder T, Motwani R (2004) Incremental clustering and dynamic information retrieval. SIAM J. Comput. 33(6):1417–1440.CrossrefGoogle Scholar
  • Chen CC, Koh KM (1992) Principles and Techniques in Combinatorics (World Scientific, Singapore).CrossrefGoogle Scholar
  • Cockerham GC, Weichel ED, Orcutt JC, Rizzo JF, Bower KS (2009) Eye and visual function in traumatic brain injury. J. Rehabilitation Res. Development 46(6):811–818.CrossrefGoogle Scholar
  • Djamasbi S (2014) Eye tracking and web experience. AIS Trans. Human-Comput. Interaction 6(2):37–54.CrossrefGoogle Scholar
  • Djamasbi S, Siegel M, Tullis T (2010) Generation Y, web design, and eye tracking. Internat. J. Human Comput. Stud. 66(5):307–323.CrossrefGoogle Scholar
  • Engelke U, Liu H, Wang J, Le Callet P, Heynderickx I, Zepernick HJ, Maeder A (2013) Comparative study of fixation density maps. IEEE Trans. Image Processing 22(3):1121–1133.CrossrefGoogle Scholar
  • Estivill-Castro V (2002) Why so many clustering algorithms: A position paper. ACM SIGKDD Explorations Newsletter 4(1):65–75.CrossrefGoogle Scholar
  • Goldberg JH, Kotval XP (1999) Computer interface evaluation using eye movements: Methods and constructs. Internat. J. Indust. Ergonomics 24(6):631–645.CrossrefGoogle Scholar
  • Goldberg JH, Stimson MJ, Lewenstein M, Scott N, Wichansky AM (2002) Eye tracking in web search tasks: Design implications. Proc. 2002 Sympos. Eye Tracking Res. Appl. (ACM, New York), 51–58.CrossrefGoogle Scholar
  • Gurobi Optimization I (2016) Gurobi Optimizer 6.5.0 Reference Manual (Gurobi Optimization, LLC, Beaverton, OR).Google Scholar
  • Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1):130–136.CrossrefGoogle Scholar
  • Holmqvist K, Nyström M, Andersson R, Dewhurst R, Jarodzka H, Van de Weijer J (2011) Eye Tracking: A Comprehensive Guide to Methods and Measures (Oxford University Press, Oxford, UK).Google Scholar
  • Komogortsev OV, Gobert DV, Jayarathna S, Koh DH, Gowda SM (2010) Standardization of automated analyses of oculomotor fixation and saccadic behaviors. IEEE Trans. Biomedical Engrg. 57(11):2635–2645.CrossrefGoogle Scholar
  • Li B, Wang Q, Barney E, Hart L, Wall C, Chawarska K, de Urabain IS, Smith TJ, Shic F (2016) Modified DBSCAN algorithm on oculomotor fixation identification. Proc. 9th Biennial ACM Sympos. Eye Tracking Res. Appl. (ACM, New York), 337–338.CrossrefGoogle Scholar
  • MathWorks I (2016) MATLAB version 9.0.0.341360 (R2016a) (Mathworks, Inc., Natick, MA).Google Scholar
  • Nyström M, Holmqvist K (2010) An adaptive algorithm for fixation, saccade, and glissade detection in eyetracking data. Behav. Res. Methods 42(1):188–204.CrossrefGoogle Scholar
  • Olsen A (2012) The Tobii I-VT Fixation Filter (Tobii Technology AB, Stockholm).Google Scholar
  • Over EA, Hooge IT, Erkelens CJ (2006) A quantitative measure for the uniformity of fixation density: The Voronoi method. Behav. Res. Methods 38(2):251–261.CrossrefGoogle Scholar
  • Poole A, Ball LJ (2005) Eye tracking in human-computer interaction and usability research: Current status and future. Ghaoui C, ed. Encyclopedia of Human Computer Interaction (Idea Group Reference, Hershey, PA), 211–219.Google Scholar
  • Radvay X, Duhoux S, Koenig-Supiot F, Vital-Durand F (2007) Balance training and visual rehabilitation of age-related macular degeneration patients. J. Vestibular Res. 17(4):183–193.CrossrefGoogle Scholar
  • Rao M (1971) Cluster analysis and mathematical programming. J. Amer. Statist. Assoc. 66(335):622–626.CrossrefGoogle Scholar
  • Sabatos-DeVito M, Schipul SE, Bulluck JC, Belger A, Baranek GT (2016) Eye tracking reveals impaired attentional disengagement associated with sensory response patterns in children with autism. J. Autism Developmental Disorders 46(4):1319–1333.CrossrefGoogle Scholar
  • Sağlam B, Salman FS, Sayın S, Türkay M (2006) A mixed-integer programming approach to the clustering problem with an application in customer segmentation. Eur. J. Oper. Res. 173(3):866–879.CrossrefGoogle Scholar
  • Salojärvi J, Puolamäki K, Simola J, Kovanen L, Kojo I, Kaski S (2005) Inferring relevance from eye movements: Feature extraction. Proc. Workshop NIPS 2005, Whistler, BC, Canada, 45–67.Google Scholar
  • Salvucci DD, Goldberg JH (2000) Identifying fixations and saccades in eye-tracking protocols. Proc. 2000 Sympos. Eye Tracking Res. Appl. (ACM, Palm Beach Gardens, FL), 71–78.CrossrefGoogle Scholar
  • Selim SZ, Ismail MA (1984) K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Analysis Machine Intelligence 6(1):81–87.CrossrefGoogle Scholar
  • Seref O, Fan YJ, Chaovalitwongse WA (2013) Mathematical programming formulations and algorithms for discretek-median clustering of time-series data. INFORMS J. Comput. 26(1):160–172.LinkGoogle Scholar
  • Shah P, Goyal M, Hu D (2016) Role of expiration dates in grocery shopping behavior: An eye tracking perspective. Proc. 22nd Americas Conf. Information Systems (Association for Information Systems, San Diego), 1–5.Google Scholar
  • Shojaeizadeh M, Djamasbi S, Trapp AC (2016) Density of gaze points within a fixation and information processing behavior. Proc. 2016 Human-Comput. Interaction Internat. Conf. (Springer, Toronto), 1–8.CrossrefGoogle Scholar
  • Smeets JB, Hooge IT (2003) Nature of variability in saccades. J. Neurophysiology 90(1):12–20.CrossrefGoogle Scholar
  • Terzi E (2006) Problems and algorithms for sequence segmentations. PhD thesis, University of Helsinki, Finland.Google Scholar
  • Terzi E, Tsaparas P (2006) Efficient algorithms for sequence segmentation. Proc. 2006 SIAM Internat. Conf. Data Mining (SIAM, Philadelphia), 316–327.CrossrefGoogle Scholar
  • Thorup E, Nyström P, Gredebäck G, Bölte S, Falck-Ytter T (2016) Altered gaze following during live interaction in infants at risk for autism: An eye tracking study. Molecular Autism 7(12):1–10.Google Scholar
  • Tobii (2018) Tobii technology. Accessed August 2, 2018, http://www.tobii.com.Google Scholar
  • Trapp A, Prokopyev OA, Busygin S (2010) Finding checkerboard patterns via fractional 0–1 programming. J. Combinatorial Optim. 20(1):1–26.CrossrefGoogle Scholar
  • Trapp AC, Prokopyev OA (2010) Solving the order-preserving submatrix problem via integer programming. INFORMS J. Comput. 22(3):387–400.LinkGoogle Scholar
  • Wedel M, Pieters R (2008) A review of eye-tracking research in marketing. Rev. Marketing Res. 4:123–147.CrossrefGoogle Scholar
  • Wu T (1997) A note on a global approach for general 0–1 fractional programming. Eur. J. Oper. Res. 101(1):220–223.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.