ISSN:
1573-7683
Keywords:
bincodes
;
interpolation-based bintrees
;
meshes with multiple broadcasting
;
neighbors finding
;
parallel algorithms
;
set operations
;
linear quadtrees
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The Interpolation-Based Bintree (IBB) is a storage-saving encodingscheme for representing binary images. In this paper, we presentefficient parallel algorithms for important manipulations on IBBcoded images (also called bincodes). Given a set of bincodes, e.g.,B with size n, the 4-neighborfinding and the diagonal-neighbor finding algorithms onB can be accomplished in O(1) time on an n x n mesh computer with multiple broadcasting(MMB). Given two sets of bincodes, B 1 and B 2, with size n and m≤ n, respectively, the intersection and unionoperations for B 1 and B 2 can be performedin O(1) time on an MMB using $$(n + m)^2$$ processors. With n 2 processors, the complementoperation for B can be performed in O(logn) time.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008234629602
Permalink