Fast approximations to discrete optimal quantization (Q1117894)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximations to discrete optimal quantization |
scientific article; zbMATH DE number 4093357
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximations to discrete optimal quantization |
scientific article; zbMATH DE number 4093357 |
Statements
Fast approximations to discrete optimal quantization (English)
0 references
1989
0 references
An O(N log K) and an \(O(N+K \log (N/K))\) algorithm are proposed to approximate the optimal K-level quantizer for a discrete density of N points. The low time complexities are achieved by approximating an optimal K-level quantizer by K-1 optimal bilevel quantizers recursively. For well-behaved discrete densities, the algorithms perform satisfactorily in terms of optimality.
0 references
algorithm design and analysis
0 references
discrete optimal quantization
0 references
signal processing
0 references
