Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting

  • Authors:

  • Kuo-Liang Chung

  • Affiliations:

  • Department of Information Management, National Taiwan Institute of Technology, No. 43, Sec. 4, Keelung Road, Taipei, Taiwan 10672, R.O.C./ E-mail: klchung@cs.ntit.edu.tw

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

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 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 unionoperations for B_1 and B_2 can be performedin O(1) time on an MMB using (n+m)^2processors. With n^2 processors, the complementoperation for B can be performed in O(Log n) time.