Representation of multi-resolution symbolic and binary pictures using 2D H-strings

Author

Chang, S.K. ; Li, Y.

Author_Institution

Dept. of Comput. Sci., Pittsburgh Univ., PA, USA

fYear

1988

fDate

29-31 Aug 1988

Firstpage

190

Lastpage

195

Abstract

A type of quadtree data structure, called a 2D H-string, is proposed for representing symbolic and binary pictures. The approach has an embedding property that allows for spatial-relational operators to be easily inserted into the structure. Algorithms are presented for traversing 2D H-strings to carry out the processing needed and for intersecting two pictures directly on their 2D H-string representations. The space complexity of 2D H-strings is analyzed and compared with other quadtree data structures. It is shown to be efficient in terms of space complexity and effective in terms of cooperativeness with other spatial-relational operators

Keywords

computer graphics; computerised picture processing; data structures; 2D H-strings; binary pictures; cooperativeness; embedding property; multiresolution picture representation; quadtree data structure; space complexity; spatial-relational operators; string traversal algorithms; symbolic pictures; Computer science; Data structures; Image databases; Image retrieval; Indexes; Information retrieval;

fLanguage

English

Publisher

ieee

Conference_Titel

Languages for Automation: Symbiotic and Intelligent Robots, 1988., IEEE Workshop on

Conference_Location

College Park, MD

Print_ISBN

0-8186-0890-0

Type

conf

DOI

10.1109/LFA.1988.24972

Filename

24972