2016
DOI: 10.1007/s11042-015-3153-9
|View full text |Cite
|
Sign up to set email alerts
|

Person identification through entropy oriented mean shift clustering of human gaze patterns

Abstract: The paper describes a system aimed at improving the human machine interaction that is able to identify users according how she looks at the monitor. The proposed system does not need invasive measurements that could limit the naturalness of her actions. The approach, here described, detects the gaze movements on the monitor and clusters the sequences of user gaze fixation points on the screen characterizing the user according the particular patterns her gaze follows. The recognition of the user is performed th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 20 publications
(34 reference statements)
0
17
0
Order By: Relevance
“…In identification scenarios, the more users the system has, the more realistic and more difficult the problem is, and thus, the performance of the system heavily depends on the sample size, the classification models, the device capabilities, and the required resources. Several surveyed works (52) focus on identification (e.g., [13,21,26,30,55,65,114,115,132,139,163]) while relatively less (21) focus on verification (e.g., [4,22,56,61,149,173]), which requires significantly less processing effort.…”
Section: Context Of Use and Design Perspectives Identification Vs Vermentioning
confidence: 99%
See 1 more Smart Citation
“…In identification scenarios, the more users the system has, the more realistic and more difficult the problem is, and thus, the performance of the system heavily depends on the sample size, the classification models, the device capabilities, and the required resources. Several surveyed works (52) focus on identification (e.g., [13,21,26,30,55,65,114,115,132,139,163]) while relatively less (21) focus on verification (e.g., [4,22,56,61,149,173]), which requires significantly less processing effort.…”
Section: Context Of Use and Design Perspectives Identification Vs Vermentioning
confidence: 99%
“…In contrast, when users authenticate through continuous stimuli, they may not be aware that they are being authenticated, as the stimuli are embedded to everyday tasks, such as reading emails and web browsing [38,163,172]. While continuous visual stimuli are of major importance for HCI as they enable unobtrusive authentication, they typically present lower accuracy and it is under-researched field, in comparison to controlled visual stimuli.…”
Section: Continuous Vs Controlled Visual Stimulimentioning
confidence: 99%
“…Comaniciu et al [17] proposed a kernel-based object tracking method, where object region tracking is denoted using a spatially weighted intensity histogram, and its similarity rate is computed using Bhattacharyya distance following an iterative mean-shift technique. Many applications [18][19][20][21] later proposed various mean-shift algorithm variants. Even though the mean-shift object tracking technique is well-performed over sequences with comparatively slight object displacement, its performance cannot be guaranteed in the case where objects suffers full or partial occlusions.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed algorithm of weighted resampling prevents this problem. First, the top sample is selected and set to S top t with N top weights from set S t , as shown in Equations (20) to (21). The parameter top represents the top rate and for our experiment it is set to 0.…”
Section: (C)mentioning
confidence: 99%
“…The pixel points which fulfill ( , ) + ( , ) > 0 are regarded as centers of clusters. We compared 3 different kinds of clustering algorithms: mean shift clustering [Vella, Infantino and Scardino (2017)], k-means clustering and AP clustering. The results of the three clustering algorithms are presented in Fig.…”
Section: =1mentioning
confidence: 99%