By Topic

A new quadtree decomposition reconstruction method

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
$31 $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)
Knipe, J. ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; Xiaobo Li

Many lossy compression algorithms have been proposed that perform well for low bit rates, but are computationally intense. On the other hand, there are many simple algorithms that perform poorly at high compression ratios. An algorithm that incorporates both computational simplicity and acceptable performance at low bit rates would have many potential applications. In wireless communications, for example, where computing power and transmission speed are important factors, the time required to compress and send image data would need to be reduced significantly. A low bit rate compression algorithm that is conceptually simple as well as computationally efficient is presented in this paper. Theoretically, it can be shown to be computationally superior to JPEG in the compression phase, and comparable in the decompression phase. In practice, the quality of the results, as measured by the PSNR, is found to be better than JPEG results at bit rates lower than about 0.2-0.3 bpp depending on the input image

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:2 )

Date of Conference:

25-29 Aug 1996