Locally optimal block quantizer design

An iterative method for optimal resolution-constrained polar quantizer design

This paper addresses the problem of polar quantization optimization. Particularly, the aim of this investigation is to find the method for the optimal resolution-constrained polar quantizer design. The new iterative algorithm for determination of the optimal decision and representation magnitude levels and algorithm for optimization of number of phase cells within each magnitude level, is propo...

Optimal nearly uniform scalar quantizer design for wavelet coding

A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction

Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis motion-compensated prediction are, for example, overlapped block motion compensation (OBMC) and bidirectionally predicted frames (B-frames). This paper presents a generalization of these algorithms in a rate-distortion f...

Bayesian locally-optimal design of knockout tournaments

The elimination or knockout format is one of the most common designs for pairing competitors in tournaments and leagues. In each round of a knockout tournament, the losers are eliminated while the winners advance to the next round. Typically, the goal of such a design is to identify the overall best player. Using a common probability model for expressing relative player strengths, we develop an...

Multiple Description Quantizer Design Using A Channel Optimized Quantizer Approach

This paper extends the channel optimized quantization scheme of Farvardin and Vaishampayan [1] to two parallel channels. The extended multiple-channel optimized quantizer design (MCOQD) framework is applied to discrete memoryless channels with erasures. The resultant MCOQD subsumes the multiple description scalar quantizer (MDSQ) design of Vaishampayan [2]. While MDSQ is suited to only “on-off”...