Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bradley J. Betts

dblp:01/4525 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2006
0000-0002-1618-8285ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization
entropy-constrained quantization
0.012003
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? · IEEE Trans. Inf. Theory 2003
Coding theory › source coding
quantization
0.012003
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? · IEEE Trans. Inf. Theory 2003
Coding theory › source coding › rate-distortion theory
rate-distortion function
0.012003
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? · IEEE Trans. Inf. Theory 2003
Coding theory › source coding
rate-distortion theory
0.012003
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? · IEEE Trans. Inf. Theory 2003

Methods — techniques the papers use, named apart from their topics

lagrangian formulation · 0.0
YearPublicationVenuePosition
2006 Small-vocabulary speech recognition using surface electromyography
abstract
We present results of electromyographic (EMG) speech recognition on a small vocabulary of 15 English words. EMG speech recognition holds promise for mitigating the effects of high acoustic noise on speech intelligibility in communication systems, including those used by first responders (a focus of this work). We collected 150 examples per word of single-channel EMG data from a male subject, speaking normally while wearing a firefighter’s self-contained breathing apparatus. The signal processing consisted of an activity detector, a feature extractor, and a neural network classifier. Testing produced an overall average correct classification rate on the 15 words of 74% with a 95% confidence interval of (71%, 77%). Once trained, the subject used a classifier as part of a real-time system to communicate to a cellular phone and to control a robotic device. These tasks were performed under an ambient noise level of approximately 95 decibels. We also describe ongoing work on phoneme-level EMG speech recognition.
Bradley J. Betts, Kim Binsted, Charles Jorgensen
Interact. Comput.1
2003 Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
abstract
An entropy-constrained quantizer Q is optimal if it minimizes the expected distortion D(Q) subject to a constraint on the output entropy H(Q). We use the Lagrangian formulation to show the existence and study the structure of optimal entropy-constrained quantizers that achieve a point on the lower convex hull of the operational distortion-rate function D/sub h/(R) = inf/sub Q/{D(Q) : H(Q) /spl les/ R}. In general, an optimal entropy-constrained quantizer may have a countably infinite number of codewords. Our main results show that if the tail of the source distribution is sufficiently light (resp., heavy) with respect to the distortion measure, the Lagrangian-optimal entropy-constrained quantizer has a finite (resp., infinite) number of codewords. In particular, for the squared error distortion measure, if the tail of the source distribution is lighter than the tail of a Gaussian distribution, then the Lagrangian-optimal quantizer has only a finite number of codewords, while if the tail is heavier than that of the Gaussian, the Lagrangian-optimal quantizer has an infinite number of codewords.
András György 0001, Tamás Linder, Philip A. Chou, Bradley J. Betts
IEEE Trans. Inf. Theory4