Title :
Transformations between boundary codes, run length codes, and linear quadtrees
Author :
Kim, Myung Hee ; Ibarra, Oscar H.
Author_Institution :
Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA
Abstract :
We present SIMD hypercube algorithms for transforming between any pair of the following binary image representations: boundary codes, quadtrees, and run length codes. Unlike previous parallel algorithms, these do not have restrictions on the shape of the images. In particular, the algorithms allow holes in the image regions. We believe that the algorithm for transforming from quadtrees to boundary codes is the first such algorithm on the SIMD hypercube. The algorithms for transforming between boundary codes and quadtrees are modified to work for the transformations between these representations and run length codes
Keywords :
computational geometry; hypercube networks; parallel algorithms; tree data structures; trees (mathematics); SIMD hypercube algorithms; binary image representations; binary image transformations; boundary codes; holes; image regions; linear quadtrees; parallel algorithms; run length codes; Computer science; Computer vision; Data structures; Displays; Hypercubes; Image representation; Parallel algorithms; Pixel; Shape; TV;
Conference_Titel :
Parallel Processing Symposium, 1994. Proceedings., Eighth International
Conference_Location :
Cancun
Print_ISBN :
0-8186-5602-6
DOI :
10.1109/IPPS.1994.288311
