Paper
21 April 1995 Finite-state residual vector quantization
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206759
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
Abstract
This paper presents a new FSVQ scheme called Finite-State Residual Vector Quantization (FSRVQ) in which each state uses a Residual Vector Quantizer (RVQ) to encode the input vector. Furthermore, a novel tree- structured competitive neural network is proposed to jointly design the next-state and the state-RVQ codebooks for the proposed FSRVQ. Joint optimization of the next-state function and the state-RVQ codebooks eliminates a large number of redundant states in the conventional FSVQ design; consequently, the memory requirements are substantially reduced in the proposed FSRVQ scheme. The proposed FSRVQ can be designed for high bit rates due to its very low memory requirements and low search complexity of the state-RVQs. Simulation results show that the proposed FSRVQ scheme outperforms the conventional FSVQ schemes both in terms of memory requirements and perceptual quality of the reconstructed image. The proposed FSRVQ scheme also outperforms JPEG (current standard for still image compression) at low bit rates.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Syed A. Rizvi, Lin-Cheng Wang, and Nasser M. Nasrabadi "Finite-state residual vector quantization", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206759
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Neural networks

Neurons

Quantization

Computer programming

Image compression

Image quality

Matrices

Back to Top