The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1988 vol.14)
pp: 651-658
ABSTRACT
<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>
INDEX TERMS
data structures; image compression; irreducible covers; maximal rectangles; pixels; parallel algorithm; concurrent-read-exclusive write; computerised picture processing; data compression; parallel algorithms
CITATION
Y. Cheng, S.S. Iyengar, R.L. Kashyap, "A New Method of image Compression Using Irreducible Covers of Maximal Rectangles", IEEE Transactions on Software Engineering, vol.14, no. 5, pp. 651-658, May 1988, doi:10.1109/32.6142
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool