By Topic

A high-speed pyramid image coding algorithm for a VLSI implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Sahinoglou ; Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA ; S. D. Cabrera

A nonseparable pyramid method based on a wavelet expansion is developed for image coding. It achieves high compression rates and at the same time allows a very efficient algorithmic implementation. In particular it uses only two additions and a shift (division by 2) for each image pixel during coding or decoding. Because the operations needed are mostly independent of each other and have a high degree of regularity, it is also possible to design very-large-scale integration (VLSI) hardware to perform this operation using an array of simple basic cells. For a typical 513×513 image one can achieve a peak signal-to-noise ratio of 30 dB with an entropy of 0.133 b/pixel. Transmitted coefficient values can be encoded with pulse code modulation to allow for simpler hardware while still requiring only 0.385 b/pixel, giving a very simple overall coding system

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:1 ,  Issue: 4 )