Quadtree algorithms for image processing

Show full item record

Title: Quadtree algorithms for image processing
Author: Benjamin, Jim Isaac
Abstract: The issue of constructing a computer-searchable image encoding algorithm for complex images and the effect of this encoded image on algorithms for image processing are considered. A regular decomposition of image (picture) area into successively smaller bounded homogeneous quadrants is defined. This hierarchical search is logarithmic, and the resulting picture representation is shown to enable rapid access of the image data to facilitate geometric image processing applications (i.e. scaling, rotation), and efficient storage. The approach is known as quadtree (Q-Tree) encoding. The applications in this thesis are primarily to grayscale pixel images as opposed to simple binary images.
Record URI: http://hdl.handle.net/1850/11078
Date: 1991-03-18

Files in this item

Files Size Format View
JBenjaminThesis04-18-1991.pdf 86.97Mb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse