Share Email Print

Proceedings Paper

Data structure based on Gray code encoding for graphics and image processing
Author(s): D. J. Amalraj; N. Sundararajan; Goutam Dhar
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A data structure based on the Gray code is presented which while maintaining the computational efficiency of linear quadtrees requires less storage memory. Unlike linear quadtrees where one can condense only to squares of 2hierarchically code can condense the adjoining black nodes to rectangles of the size 2'' x 2 . Due to this data can be condensed to a greater extent using Gray code. Algorithms for condensed encoded Gray code structure are similar to those of linear quadtrees. This paper presents algorithms for Gray code encoding comparing members adjacency and neighbour finding condensing data component labelling area and perimeter calculations.

Paper Details

Date Published: 1 November 1990
PDF: 12 pages
Proc. SPIE 1349, Applications of Digital Image Processing XIII, (1 November 1990); doi: 10.1117/12.23516
Show Author Affiliations
D. J. Amalraj, Bharat Heavy Electricals Ltd. (India)
N. Sundararajan, Bharat Heavy Electricals Ltd. (India)
Goutam Dhar, Bharat Heavy Electricals Ltd. (India)

Published in SPIE Proceedings Vol. 1349:
Applications of Digital Image Processing XIII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?