Fast algorithm for optimal bit allocation

Woo Yong Lee; Jong Beom Ra

doi:10.1117/12.263227

10 January 1997 Fast algorithm for optimal bit allocation

Woo Yong Lee, Jong Beom Ra

Proceedings Volume 3024, Visual Communications and Image Processing '97; (1997) https://doi.org/10.1117/12.263227
Event: Electronic Imaging '97, 1997, San Jose, CA, United States

Abstract

To improve the quality of the reconstructed image for a given bit rate constraint, the assigned bits must be distributed efficiently using a set of admissible quantizers so that source distortion can be minimized. The optimal bit allocation scheme for source coding is based on Shannon's rate-distortion theory, which deals with minimization of source distortion subject to a channel rate constraint. To allocate a given quota of bits to an arbitrary set of different quantizers, several fast algorithms have been suggested for optimal bit allocation. However, these methods are still not practical due to large computational burden. This paper proposes a new fast algorithm which needs less computing time than existing fast algorithms.

Citation Download Citation

Woo Yong Lee and Jong Beom Ra "Fast algorithm for optimal bit allocation", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); https://doi.org/10.1117/12.263227

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

Includes PDF, HTML & Video, when available