Image Rectangular Decomposition on a Recongurable Mesh

Abstract

The major contribution of this paper is in de- signing an eÆcient parallel algorithm for rectan- gular partitioning on the binary image. Based on the recongurability and power of the recon- gurable meshes, a constant time algorithm for rectangular partitioning for an N N binary image using N N processors is derived. For applications of this algorithm, an approach for compressing and decompressing binary images is also proposed. In the sense of the product of time and the number of processors used, our algorithms are time and cost optimal.