By Topic

Projection pursuit image compression with variable block size segmentation

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

3 Author(s)
S. R. Safavian ; Cellular Inst., LCC Inc., Arlington, VA, USA ; H. R. Rabiee ; M. Fardanesh

A novel multiresolution algorithm for lossy gray-scale image compression is presented. High-quality low bit rate image compression is achieved first by segmenting an image into regions of different sizes based on perceptual variation in each region and then constructing a distinct code for each block by using the theory of projection pursuit (PP). Projection pursuit allows one to adaptively construct a better approximation for each block by optimally selecting basis functions. The process is stopped when the desired peak signal-to-noise ratio (PSNR) or bit rate (b/pixel) is achieved. At rates below 0.5 b/pixel, our algorithm shows superior performance, both in terms of PSNR and subjective image quality, over the Joint Photographers Expert Group (JPEG) algorithm, and comparable performance to the embedded zerotree wavelet (EZW) algorithm.

Published in:

IEEE Signal Processing Letters  (Volume:4 ,  Issue: 5 )