IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v31y2019i3p459-476.html
   My bibliography  Save this article

Identifying Fixations in Gaze Data via Inner Density and Optimization

Author

Listed:
  • Andrew C. Trapp

    (Robert A. Foisie Business School, Worcester Polytechnic Institute, Worcester, Massachusetts 01609; Data Science Program, Worcester Polytechnic Institute, Worcester, Massachusetts 01609)

  • Wen Liu

    (Data Science Program, Worcester Polytechnic Institute, Worcester, Massachusetts 01609;)

  • Soussan Djamasbi

    (Robert A. Foisie Business School, Worcester Polytechnic Institute, Worcester, Massachusetts 01609;)

Abstract

Eye tracking is an increasingly common technology with a variety of practical uses. Eye-tracking data, or gaze data, can be categorized into two main events: fixations represent focused eye movement, indicative of awareness and attention, whereas saccades are higher-velocity movements that occur between fixation events. Common methods to identify fixations in gaze data can lack sensitivity to peripheral points and may misrepresent positional and durational properties of fixations. To address these shortcomings, we introduce the notion of inner density for fixation identification, which concerns both the duration of the fixation and the proximity of its constituent gaze points. Moreover, we demonstrate how to identify fixations in a sequence of gaze data by optimizing for inner density. After decomposing the clustering of a temporal gaze data sequence into successive regions (chunks), we use nonlinear and linear 0–1 optimization formulations to identify the densest fixations within a given data chunk. Our approach is parametrized by a unique constant that adjusts the degree of desired density, allowing decision makers to have fine-tuned control over density during the process. Computational experiments on real data sets demonstrate the efficiency of our approach and its effectiveness in identifying fixations with greater density than existing methods, thereby enabling the refinement of key gaze metrics such as fixation duration and fixation center.

Suggested Citation

  • Andrew C. Trapp & Wen Liu & Soussan Djamasbi, 2019. "Identifying Fixations in Gaze Data via Inner Density and Optimization," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 459-476, July.
  • Handle: RePEc:inm:orijoc:v:31:y:2019:i:3:p:459-476
    DOI: 10.1287/ijoc.2018.0859
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2018.0859
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2018.0859?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Wu, Tai-Hsi, 1997. "A note on a global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 220-223, August.
    2. Saglam, Burcu & Salman, F. Sibel & Sayin, Serpil & Turkay, Metin, 2006. "A mixed-integer programming approach to the clustering problem with an application in customer segmentation," European Journal of Operational Research, Elsevier, vol. 173(3), pages 866-879, September.
    3. Andrew C. Trapp & Oleg A. Prokopyev, 2010. "Solving the Order-Preserving Submatrix Problem via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 387-400, August.
    4. Andrew Trapp & Oleg A. Prokopyev & Stanislav Busygin, 2010. "Finding checkerboard patterns via fractional 0–1 programming," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 1-26, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Wen & Trapp, Andrew C. & Djamasbi, Soussan, 2021. "Outlier-Aware, density-Based gaze fixation identification," Omega, Elsevier, vol. 102(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
    2. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    3. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    4. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    5. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
    6. Chang, Ching-Ter, 2001. "On the polynomial mixed 0-1 fractional programming problems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 224-227, May.
    7. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    8. Calvino, José J. & López-Haro, Miguel & Muñoz-Ocaña, Juan M. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "Segmentation of scanning-transmission electron microscopy images using the ordered median problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 671-687.
    9. Shuyu Zhou & Yeming (Yale) Gong & René de Koster, 2016. "Designing self-storage warehouses with customer choice," International Journal of Production Research, Taylor & Francis Journals, vol. 54(10), pages 3080-3104, May.
    10. Samyukta Sethuraman & Sergiy Butenko, 2015. "The maximum ratio clique problem," Computational Management Science, Springer, vol. 12(1), pages 197-218, January.
    11. Andrew Trapp & Oleg A. Prokopyev & Stanislav Busygin, 2010. "Finding checkerboard patterns via fractional 0–1 programming," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 1-26, July.
    12. Wu, Tai-Hsi & Lin, Jen-Nan, 2003. "Solving the competitive discretionary service facility location problem," European Journal of Operational Research, Elsevier, vol. 144(2), pages 366-378, January.
    13. Harun Pirim & Burak Eksioglu & Fred W. Glover, 2018. "A Novel Mixed Integer Linear Programming Model for Clustering Relational Networks," Journal of Optimization Theory and Applications, Springer, vol. 176(2), pages 492-508, February.
    14. Meisel, Stephan & Mattfeld, Dirk, 2010. "Synergies of Operations Research and Data Mining," European Journal of Operational Research, Elsevier, vol. 206(1), pages 1-10, October.
    15. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
    16. Falah Alhameli & Ali Ahmadian & Ali Elkamel, 2021. "Multiscale Decision-Making for Enterprise-Wide Operations Incorporating Clustering of High-Dimensional Attributes and Big Data Analytics: Applications to Energy Hub," Energies, MDPI, vol. 14(20), pages 1-17, October.
    17. K F Lam, 2010. "In the determination of weight sets to compute cross-efficiency ratios in DEA," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 134-143, January.
    18. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
    19. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    20. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:31:y:2019:i:3:p:459-476. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.