On the building of binary spelling interfaces for augmentive communication

Mikhail Tregoubov, Niels Birbaumer

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

A criterion for design of optimal binary spelling interfaces (SI)-the average expectation of number of writing steps (trials) required to write one letter-is presented and discussed. This criterion is relevant for practical usage of any menu-oriented alternative communication system, mechanical device or brain-computer-interface, when a user (typically, a patient with devastating neuromuscular handicap) can not create an intended single binary response with an absolute reliability. An algorithm for building of a corresponding binary tree is developed and evaluated. This algorithm is efficient, when selection probabilities have essentially different values (the worst case).

Original languageEnglish
Pages (from-to)300-305
Number of pages6
JournalIEEE Transactions on Biomedical Engineering
Volume52
Issue number2
DOIs
Publication statusPublished - Feb 2005

Fingerprint

Brain computer interface
Binary trees
Communication
Communication systems

Keywords

  • Binary spelling interface
  • Brain-computer-interface

ASJC Scopus subject areas

  • Biomedical Engineering

Cite this

On the building of binary spelling interfaces for augmentive communication. / Tregoubov, Mikhail; Birbaumer, Niels.

In: IEEE Transactions on Biomedical Engineering, Vol. 52, No. 2, 02.2005, p. 300-305.

Research output: Contribution to journalArticle

Tregoubov, Mikhail ; Birbaumer, Niels. / On the building of binary spelling interfaces for augmentive communication. In: IEEE Transactions on Biomedical Engineering. 2005 ; Vol. 52, No. 2. pp. 300-305.
@article{8bc0c01936f3423ba80eff339d2e4427,
title = "On the building of binary spelling interfaces for augmentive communication",
abstract = "A criterion for design of optimal binary spelling interfaces (SI)-the average expectation of number of writing steps (trials) required to write one letter-is presented and discussed. This criterion is relevant for practical usage of any menu-oriented alternative communication system, mechanical device or brain-computer-interface, when a user (typically, a patient with devastating neuromuscular handicap) can not create an intended single binary response with an absolute reliability. An algorithm for building of a corresponding binary tree is developed and evaluated. This algorithm is efficient, when selection probabilities have essentially different values (the worst case).",
keywords = "Binary spelling interface, Brain-computer-interface",
author = "Mikhail Tregoubov and Niels Birbaumer",
year = "2005",
month = "2",
doi = "10.1109/TBME.2004.836505",
language = "English",
volume = "52",
pages = "300--305",
journal = "IEEE Transactions on Biomedical Engineering",
issn = "0018-9294",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - On the building of binary spelling interfaces for augmentive communication

AU - Tregoubov, Mikhail

AU - Birbaumer, Niels

PY - 2005/2

Y1 - 2005/2

N2 - A criterion for design of optimal binary spelling interfaces (SI)-the average expectation of number of writing steps (trials) required to write one letter-is presented and discussed. This criterion is relevant for practical usage of any menu-oriented alternative communication system, mechanical device or brain-computer-interface, when a user (typically, a patient with devastating neuromuscular handicap) can not create an intended single binary response with an absolute reliability. An algorithm for building of a corresponding binary tree is developed and evaluated. This algorithm is efficient, when selection probabilities have essentially different values (the worst case).

AB - A criterion for design of optimal binary spelling interfaces (SI)-the average expectation of number of writing steps (trials) required to write one letter-is presented and discussed. This criterion is relevant for practical usage of any menu-oriented alternative communication system, mechanical device or brain-computer-interface, when a user (typically, a patient with devastating neuromuscular handicap) can not create an intended single binary response with an absolute reliability. An algorithm for building of a corresponding binary tree is developed and evaluated. This algorithm is efficient, when selection probabilities have essentially different values (the worst case).

KW - Binary spelling interface

KW - Brain-computer-interface

UR - http://www.scopus.com/inward/record.url?scp=13244251003&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13244251003&partnerID=8YFLogxK

U2 - 10.1109/TBME.2004.836505

DO - 10.1109/TBME.2004.836505

M3 - Article

C2 - 15709667

AN - SCOPUS:13244251003

VL - 52

SP - 300

EP - 305

JO - IEEE Transactions on Biomedical Engineering

JF - IEEE Transactions on Biomedical Engineering

SN - 0018-9294

IS - 2

ER -