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)
Department, Program, or Center
Computer Science (GCCIS)
Benjamin, Jim Isaac, "Quadtree algorithms for image processing" (1991). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus