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.

Library of Congress Subject Headings

Image processing; Data structures (Computer science)

Publication Date

3-18-1991

Document Type

Thesis

Student Type

Graduate

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Not listed

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in December 2013. Physical copy available through RIT's The Wallace Library at: TA1632 .B46 1991

Campus

RIT – Main Campus

Download

Share

COinS