Quadtree algorithms for image processing

Show simple item record

dc.contributor.author Benjamin, Jim Isaac
dc.date.accessioned 2010-01-14T20:47:32Z
dc.date.available 2010-01-14T20:47:32Z
dc.date.issued 1991-03-18
dc.identifier.uri http://hdl.handle.net/1850/11078
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. en_US
dc.language.iso en_US en_US
dc.subject Image processing en_US
dc.subject Data structures en_US
dc.subject.lcc TA1632 .B46 1991
dc.subject.lcsh Image processing en_US
dc.subject.lcsh Data structures (Computer science) en_US
dc.title Quadtree algorithms for image processing en_US
dc.type Thesis en_US

Files in this item

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

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse