Subregion search algorithm for efficient VQ encoding of images

Man-Yee Lee Anson; Jian Feng

doi:10.1117/12.386682

30 May 2000 Subregion search algorithm for efficient VQ encoding of images

Man-Yee Lee Anson, Jian Feng

Author Affiliations +

Proceedings Volume 4067, Visual Communications and Image Processing 2000; (2000) https://doi.org/10.1117/12.386682
Event: Visual Communications and Image Processing 2000, 2000, Perth, Australia

Abstract

In this paper, we new sub-region search algorithm is proposed for fast encoding of image vector quantization. In the proposed scheme, we will only search a portion of the codebook to locate the best match vector of each input vector according to the state of its neighboring blocks. A block transition criterion is developed for selecting the subset of codebook for searching. Simulation results show that the encoding time required by the proposed algorithm is just about 10 - 20% of that required by the full search with almost the same output image quality.

Citation Download Citation

Man-Yee Lee Anson and Jian Feng "Subregion search algorithm for efficient VQ encoding of images", Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); https://doi.org/10.1117/12.386682

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE