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

Alexander M. Powell

dblp:86/5576 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
0000-0001-6911-1890ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 1Theory 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 · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › signal representation › frame theory
frame expansion
0.112006
Sigma-delta (ΣΔ) quantization and finite frames · IEEE Trans. Inf. Theory 2006
Information theory › signal processing › signal representation
frame theory
0.112006
Sigma-delta (ΣΔ) quantization and finite frames · IEEE Trans. Inf. Theory 2006
Coding theory › source coding
quantization
0.112006
Sigma-delta (ΣΔ) quantization and finite frames · IEEE Trans. Inf. Theory 2006
Coding theory › source coding › quantization
sigma-delta quantization
0.112006
Sigma-delta (ΣΔ) quantization and finite frames · IEEE Trans. Inf. Theory 2006

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

mean squared error analysis · 0.1error bounds · 0.1
YearPublicationVenuePosition
2006 Sigma-delta (ΣΔ) quantization and finite frames
abstract
The K-level Sigma-Delta (/spl Sigma//spl Delta/) scheme with step size /spl delta/ is introduced as a technique for quantizing finite frame expansions for /spl Ropf//sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantization of a unit-norm finite frame expansion in /spl Ropf//sup d/ achieves approximation error where N is the frame size, and the frame variation /spl sigma/(F,p) is a quantity which reflects the dependence of the /spl Sigma//spl Delta/ scheme on the frame. Here /spl par//spl middot//spl par/ is the d-dimensional Euclidean 2-norm. Lower bounds and refined upper bounds are derived for certain specific cases. As a direct consequence of these error bounds one is able to bound the mean squared error (MSE) by an order of 1/N/sup 2/. When dealing with sufficiently redundant frame expansions, this represents a significant improvement over classical pulse-code modulation (PCM) quantization, which only has MSE of order 1/N under certain nonrigorous statistical assumptions. /spl Sigma//spl Delta/ also achieves the optimal MSE order for PCM with consistent reconstruction.
John J. Benedetto, Alexander M. Powell, Özgür Yilmaz
IEEE Trans. Inf. Theory2
2004 Sigma-delta quantization and finite frames
abstract
It is shown that sigma-delta (/spl Sigma//spl Delta/) algorithms can be used effectively to quantize finite frame expansions for R/sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantizers outperform the standard PCM schemes.
John J. Benedetto, Özgür Yilmaz, Alexander M. Powell
ICASSP (3)3