On the equalization of keystroke timing histograms

The effect of parametric equalization of time interval histograms (key down–down intervals) on the performance of keystroke-based user verification algorithms is analyzed. Three algorithms are used throughout this analysis: a classic one for static (structured) texts, a second one, also proposed in literature, for both static and arbitrary (free) text, and a new one for arbitrary text based verification. Their performances are reported before and after time interval histogram equalization, and the results corroborate with the hypothesis that the nonlinear memoryless time interval transform proposed here, despite its simplicity, can be a useful and almost costless building block in keystroke-based biometric systems.