By Topic

An efficient image coding implementation using the quadtree algorithm

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)
T. L. Mitchell ; Dept. of Electr. Eng., Agric. & Tech. State Univ., Greensboro, NC, USA ; W. D. Gay

The authors present a novel approach to image processing that uses a straightforward quadtree algorithm. They store in computer memory the regional address and pertinent information attributes. They then can recall and restore the image to its original state. Advantages to using this approach include reduction in memory required to store the entire image and a simplification of the overall image storage processes. Successful implementation of the quadtree algorithm yielded memory storage savings of 67 to 83%. This simple “divide-and-conquer” approach to image coding permits general purpose hardware and a straightforward algorithm to be used for complex tasks that previously required special purpose, high-performance hardware

Published in:

System Theory, 1994., Proceedings of the 26th Southeastern Symposium on

Date of Conference:

20-22 Mar 1994