2007 IEEE Conference on Computer Vision and Pattern Recognition 2007
DOI: 10.1109/cvpr.2007.383393
|View full text |Cite
|
Sign up to set email alerts
|

Are Digraphs Good for Free-Text Keystroke Dynamics?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
42
2

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(46 citation statements)
references
References 6 publications
2
42
2
Order By: Relevance
“…One of the most popular features used to model keystroke dynamics is digraph latency [10,9,3], which calculates the time difference between pressing the keys of two adjacent letters. It has been shown that the word-specific digraph is much more discriminative than the generic digraph, which is computed without regard to what letters were typed [15]. Considering that the acoustic signal from keystroke does not explicitly carry the information of what letter is typed, we propose a novel approach to employ the digraph feature by constructing a virtual alphabet.…”
Section: Keystroke Sound Biometricmentioning
confidence: 99%
See 1 more Smart Citation
“…One of the most popular features used to model keystroke dynamics is digraph latency [10,9,3], which calculates the time difference between pressing the keys of two adjacent letters. It has been shown that the word-specific digraph is much more discriminative than the generic digraph, which is computed without regard to what letters were typed [15]. Considering that the acoustic signal from keystroke does not explicitly carry the information of what letter is typed, we propose a novel approach to employ the digraph feature by constructing a virtual alphabet.…”
Section: Keystroke Sound Biometricmentioning
confidence: 99%
“…It has also been shown that word-specific digraph, which is computed on the same two keys, is much more discriminative than the generic digraph [15]. In keystroke dynamics, such word information is readily available since key logging records the letter associated with each keystroke.…”
Section: Virtual Alphabet Via Clusteringmentioning
confidence: 99%
“…Trigraphs, which are the time latencies between every three consecutive keys, and similarly, n-graphs, have been investigated as well. In their study on keystroke analysis using free text, Sim and Janakiraman [27] investigated the effectiveness of digraphs and more generally n-graphs for free text keystroke biometrics, and concluded that ngraphs are discriminative only when they are wordspecific. As such, the digraph and n-graph features do depend on the word context they are computed in.…”
Section: Introductionmentioning
confidence: 99%
“…Trigraphs, which are the time latencies between every three consecutive keys, and similarly, ngraphs, have been investigated as well. In their study on keystroke analysis using free text, Sim and Janakiraman [94] investigated the effectiveness of digraphs and more generally n-graphs for free text keystroke biometrics, and concluded that n-graphs are discriminative only when they are word-specific. As such, the digraph and n-graph features do depend on the word context they are computed in.…”
Section: Keystroke Dynamics Featuresmentioning
confidence: 99%