The Community for Technology Leaders
Green Image
<p>The binary-image-compression problem is analyzed using irreducible cover of maximal rectangles. A bound on the minimum-rectangular-cover problem for image compression is given under certain conditions that previously have not been analyzed. It is demonstrated that for a simply connected image, the irreducible cover proposed uses less than four times the number of the rectangles in a minimum cover. With n pixels in a square, the parallel algorithm for obtaining the irreducible cover uses (n/log n) concurrent-read-exclusive write (CREW) processors in O(log n) time.</p>
data structures; image compression; irreducible covers; maximal rectangles; pixels; parallel algorithm; concurrent-read-exclusive write; computerised picture processing; data compression; parallel algorithms

S. Iyengar, R. Kashyap and Y. Cheng, "A New Method of image Compression Using Irreducible Covers of Maximal Rectangles," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 651-658, 1988.
93 ms
(Ver 3.3 (11022016))