Paper
1 November 1990 Data structure based on Gray code encoding for graphics and image processing
D. J. Amalraj, N. Sundararajan, Goutam Dhar
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
D. J. Amalraj, N. Sundararajan, and Goutam Dhar "Data structure based on Gray code encoding for graphics and image processing", Proc. SPIE 1349, Applications of Digital Image Processing XIII, (1 November 1990); https://doi.org/10.1117/12.23516
Lens.org Logo
CITATIONS
Cited by 11 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Digital image processing

Image compression

Image processing

Visualization

Binary data

Image segmentation

RELATED CONTENT

VAP A Video Array Processor Using Cascaded Look...
Proceedings of SPIE (October 26 1983)
Efficient error-resilient codes for sparse image coefficients
Proceedings of SPIE (September 01 1990)
Adaptive vector quantization for binary images
Proceedings of SPIE (December 28 2000)
Dual-Mode Hybrid Compressor For Facsimile Images
Proceedings of SPIE (December 28 1979)

Back to Top