Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting

Abstract

The Interpolation-Based Bintree (IBB) is a storage-saving encoding scheme for representing binary images. In this paper, we present efficient parallel algorithms for important manipulations on IBB coded images (also called bincodes). Given a set of bincodes, e.g.,B with size n, the 4-neighbor finding and the diagonal-neighbor finding algorithms onB can be accomplished in O(1) time on ann x n mesh computer with multiple broadcasting (MMB). Given two sets of bincodes, B_1 andB_2 , with size n and m ≤ n, respectively, the intersection and union operations for B_1 and B_2 can be performed in O(1) time on an MMB using (n+m)^2 processors. With n^2 processors, the complement operation for B can be performed in O(Log n) time.