On the building of binary spelling interfaces for augmentive communication

IEEE Transactions on Biomedical Engineering

Volumn 52, Issue 2, 2005, Pages 300-305

  Tregoubov, Mikhail ^a,d,e   Birbaumer, Niels ^{b,c,f,g,h,i,j,k,l}  

^a ACCENTURE   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c UNIVERSITY OF TRENTO   (Italy)

^d UNIVERSITY OF WISCONSIN MADISON   (United States)

^e LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^f UNIVERSITY OF VIENNA   (Austria)

^g PENNSYLVANIA STATE UNIVERSITY   (United States)

^h UNIVERSITY OF PADOVA   (Italy)

ⁱ Europ Assoc of Behavioral Theraphy   (Germany)

^j AMERICAN PSYCHOLOGICAL ASSOCIATION   (United States)

^k Amer Assoc of Appl Psychophysiol   (United States)

^l German Acad of Sci and Literature   (Germany)

more..

Author keywords

Binary spelling interface; Brain computer interface

Indexed keywords

BINARY TREE; BRAIN-COMPUTER-INTERFACES; NEUROMUSCULAR HANDICAP; SPELLING INTERFACES (SI);

BRAIN; INTERFACES (COMPUTER); NEUROLOGY; PROBABILITY; RELIABILITY; TREES (MATHEMATICS);

HUMAN COMPUTER INTERACTION;

ALGORITHM; ARTICLE; BRAIN COMPUTER INTERFACE; COMMUNICATION AID; DEVICE; RELIABILITY; WRITING;

ALGORITHMS; COMMUNICATION AIDS FOR DISABLED; HUMANS; INFORMATION STORAGE AND RETRIEVAL; NATURAL LANGUAGE PROCESSING; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED; USER-COMPUTER INTERFACE; VOCABULARY, CONTROLLED; WORD PROCESSING;

EID: 13244251003     PISSN: 00189294     EISSN: None     Source Type: Journal    
DOI: 10.1109/TBME.2004.836505     Document Type: Article

References (14)

1. D. Beukelman and P. Mirenda, Augmentative and Alternative Communication: Management of Severe Communication Disorders in Children and Adults. Baltimore, MD: Paul H. Brooks Publishing, 1992.
2. J. Perelmouter and N. Birbaumer, "A binary spelling interface with random errors," IEEE Trans. Rehabil. Eng., vol. 8, no. 2, pp. 227-232, Jun. 2000.
3. A. Kübler, B. Kotchoubey, J. Kaiser, J. R. Wolpaw, and N. Birbaumer, "Brain-computer communication: unlock the locked-in," Psychological Bull., vol. 127, pp. 358-375, 2001.
4. J. R. Wolpaw, N. Birbaumer, W. J. Heetderks, D. J. McFarland, P. H. Peckham, G. Schalk, E. Donchin, L. A. Quatrano, C. J. Robinson, and T. M. Vaughan, "Brain-computer interface technology: a review of the first international meeting," IEEE Trans. Rehabil. Eng., vol. 8, no. 2, pp. 164-173, Jun. 2000.
5. A. Kübler, B. Kotchoubey, T. Hinterberger, N. Ghanayim, J. Perelmouter, M. Schauer, C. Fritsch, E. Taub, and N. Birbaumer, "The thought translation device: a neurophysiological approach to communication in total motor paralysis," Exp. Brain Res., vol. 124, pp. 223-232, 1999.
6. J. Perelmouter, B. Kotchoubey, A. Kübler, E. Taub, and N. Birbaumer, "A language support program for thought translation devices," Automedica, vol. 18, pp. 67-84, 1999.
7. N. Birbaumer, N. Ghanayim, T. Hinterberger, I. Iversen, B. Kotchoubey, A. Kübler, J. Perelmouter, E. Taub, and H. Flor, "A spelling device for the paralyzed," Nature, vol:. 398, pp. 297-298, Mar. 1999.
8. D.A. Huffman, "A method for the construction of minimum redundancy codes," in Proc. IRE, vol. 40, 1952, pp. 1098-1101.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambrige, MA: The MIT Press, 1997, ch. 17, pp. 337-343.
10. I. Munro, "On Random Walks in Binary Trees," Univ. Waterloo, Waterloo, ON, Canada, Research Report CS-76-33, 1976.
11. D. Rotem, "Stack sortable permutations," Discrete Math., vol. 33, pp. 185-196, 1981.
12. D. E. Knuth, The Art of Computer Programming. Reading, MA: Addison-Wesley, 1968, vol. 1, Fundamental Algorithm.
13. E. Mäkinen, "A survey on binary tree codings," Comput. J., vol. 34, no. 5, pp. 438-443, 1991.
14. J. Pallo and R. Racca, "A note on generating binary trees in A-order and B-order," Int. J. Comput. Math., vol. 18, pp. 27-39, 1985.