IEEE Transactions on Information Theory · 2003 · 30 citations · 32 references
ComputingComputer ScienceAlgorithmsComputational GeometryData StructuresData CompressionDigital Signal ProcessingSignal ProcessingComplexityExpansionLookup Table DesignPeriodic StructureQuantizationReconstruction AlgorithmsScalar QuantizationUniform Quantization
We study construction of structured regular quantizers for overcomplete expansions in /spl Ropf//sup N/. Our goal is to design structured quantizers which allow simple reconstruction algorithms with low complexity and which have good performance in terms of accuracy. Most related work to date in quantized redundant expansions has assumed that the same uniform scalar quantizer was used on all the expansion coefficients. Several approaches have been proposed to improve the reconstruction accuracy, with some of these methods having significant complexity. Instead, we consider the joint design of the overcomplete expansion and the scalar quantizers (allowing different step sizes) in such a way as to produce an equivalent vector quantizer (EVQ) with periodic structure. The construction of a periodic quantizer is based on lattices in /spl Ropf//sup N/ and the concept of geometrically scaled- similar sublattices. The periodicity makes it possible to achieve good accuracy using simple reconstruction algorithms (e.g., linear reconstruction or a small lookup table).
32
Sphere Packings, Lattices and Groups.
H. S. M. Coxeter, J. H. Conway, N. J. A. Sloane · American Mathematical Monthly · 1989 · 3.5K citations
Shiftable multiscale transforms
Eero P. Simoncelli, William T. Freeman, Edward H. Adelson et al. · IEEE Transactions on Information Theory · 1992 · 1.3K citations
Integer and combinatorial optimization
Computers & Mathematics with Applications · 1999 · 1.1K citations