Abstract
In this paper, a dynamic addressing scheme (DAVQ) is introduced for image vector quantization. It is a variable rate coding scheme that exploits the interblock correlation to minimize the bit-rate for a given fidelity. Each pattern matching of the DAVQ is through a two-stage searching. It first searches the previously used codewords according to a predefined 2-D spatial scanning path and then continues the search in the remaining of the codebook. At each instant of encoding, it may be envisaged that a virtual 2-D codebook of ever adapting array of codewords is naturally evolved with respect to each individual input block. Simulation results demonstrate that a general saving of around 40% in bit-rate is acquired.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Image Processing |
| Publisher | IEEE |
| Pages | 435-438 |
| Number of pages | 4 |
| Publication status | Published - 1 Dec 1996 |
| Event | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) - Lausanne, Switzerland Duration: 16 Sept 1996 → 19 Sept 1996 |
Conference
| Conference | Proceedings of the 1996 IEEE International Conference on Image Processing, ICIP'96. Part 2 (of 3) |
|---|---|
| Country/Territory | Switzerland |
| City | Lausanne |
| Period | 16/09/96 → 19/09/96 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering