Linear quadtree coding scheme with hierarchical structure and rotational operator

Henry Ker-Chang Chang; Kro-Chien Chou; Chen-Cheung Hsieh

doi:10.1117/12.228228

8 December 1995 Linear quadtree coding scheme with hierarchical structure and rotational operator

Henry Ker-Chang Chang, Kro-Chien Chou, Chen-Cheung Hsieh

Proceedings Volume 2605, Coding and Signal Processing for Information Storage; (1995) https://doi.org/10.1117/12.228228
Event: Photonics East '95, 1995, Philadelphia, PA, United States

Abstract

A new coding scheme for linear quadtree and a basic geometric operation are proposed in this paper. There are two objectives in this paper. The first objective is to find a coding scheme with which the requirement of large storage for storing raster data can be improved from the past research. The second objective is to verify the feasibility of the proposed coding scheme for spatial data operations. The proposed linear quadtree coding scheme is developed on the basis of the hierarchical structure of the quadtree. Techniques of breadth-first search, Morton sequence with two data structures of branch list and data list are used to derive the proposed coding scheme. The branch list maintains the outputs of the quadtree decomposition, and uses only one bit to record each node; all terminal nodes, representing different spatial data, in the quadtree are recorded in the data list. The application of the data list has an advantage that the number of bits required to represent various objects are extendible, so that the requirement of the construction of new quadtrees is no longer necessary. The feasibility of the proposed linear quadtree coding scheme is verified by two raster images of spatial data. Results of experimental tests reveal that the proposed scheme has the least storage requirement among various coding schemes. A basic operation, rotation, is also implemented to demonstrate the applicability of the proposed coding scheme for geometric operations. Due to the characteristic of the proposed coding scheme, the problem of multicolor quadtrees is also solvable by the method proposed in this paper.

Citation Download Citation

Henry Ker-Chang Chang, Kro-Chien Chou, and Chen-Cheung Hsieh "Linear quadtree coding scheme with hierarchical structure and rotational operator", Proc. SPIE 2605, Coding and Signal Processing for Information Storage, (8 December 1995); https://doi.org/10.1117/12.228228

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Image processing

Image resolution

Raster graphics

Data storage

Binary data

Data processing

Computer graphics

Show All Keywords

Keywords/Phrases

Search In:

Publication Years