Back to search

Rochester Institute of Technology

Quadtree algorithms for image processing

Abstract

dc:description.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.

Degree

thesis:*
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science (GCCIS)

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Benjamin, Jim, Isaac
Contributors dc:contributor
  • Not listed

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/4526

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Benjamin, Jim, Isaac. Quadtree algorithms for image processing. Thesis thesis, https://repository.rit.edu/theses/4526