TY - JOUR
T1 - Speed-accuracy tradeoff
T2 - A formal information-theoretic transmission scheme (FITTS)
AU - Gori, Julien
AU - Rioul, Olivier
AU - Guiard, Yves
N1 - Publisher Copyright:
© 2018 Association for Computing Machinery.
PY - 2018/9/1
Y1 - 2018/9/1
N2 - The rationale for Fitts' law is that pointing tasks have the information-theoretic analogy of sending a signal over a noisy channel, thereby matching Shannon's capacity formula. Yet, the currently received analysis is incomplete and unsatisfactory: There is no explicit communication model for pointing; there is a confusion between central concepts of capacity (a mathematical limit), throughput (an average performance measure), and bandwidth (a physical quantity); and there is also a confusion between source and channel coding so that Shannon's Theorem 17 can be misinterpreted. We develop an information-theoretic model for pointing tasks where the index of difficulty (ID) is the expression of both a source entropy and a zero-error channel capacity. Then, we extend the model to include misses at rate ε and prove that ID should be adjusted to (1 − ε)ID. Finally, we reflect on Shannon's channel coding theorem and argue that only minimum movement times, not performance averages, should be considered.
AB - The rationale for Fitts' law is that pointing tasks have the information-theoretic analogy of sending a signal over a noisy channel, thereby matching Shannon's capacity formula. Yet, the currently received analysis is incomplete and unsatisfactory: There is no explicit communication model for pointing; there is a confusion between central concepts of capacity (a mathematical limit), throughput (an average performance measure), and bandwidth (a physical quantity); and there is also a confusion between source and channel coding so that Shannon's Theorem 17 can be misinterpreted. We develop an information-theoretic model for pointing tasks where the index of difficulty (ID) is the expression of both a source entropy and a zero-error channel capacity. Then, we extend the model to include misses at rate ε and prove that ID should be adjusted to (1 − ε)ID. Finally, we reflect on Shannon's channel coding theorem and argue that only minimum movement times, not performance averages, should be considered.
KW - Channel capacity
KW - Fitts' law
KW - Speed-accuracy tradeoff
U2 - 10.1145/3231595
DO - 10.1145/3231595
M3 - Article
AN - SCOPUS:85054284280
SN - 1073-0516
VL - 25
JO - ACM Transactions on Computer-Human Interaction
JF - ACM Transactions on Computer-Human Interaction
IS - 5
M1 - 27
ER -