This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Method of image Compression Using Irreducible Covers of Maximal Rectangles
May 1988 (vol. 14 no. 5)
pp. 651-658

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.

[1] S. Chaiken, D. J. Kleitman, M. Saks, and J. Shearer, "Covering regions by rectangles,"SIAM J. Algebraic Discrete Methods, vol. 2, pp. 394-410, Dec. 1981.
[2] H. E. Conn and J. O'Rourke, "Some restricted rectangle covering problems," Dep. Comput. Sci., Johns Hopkins Univ., Tech. Rep. JHU-87/13, June 1987.
[3] L. Ferrari, P. V. Sankar, and J. Sklansky, "Minimal rectanglar partitions of digitized blobs,"Computer Vision, Graphics, Image Processing, vol. 28, pp. 58-71, Oct. 1981.
[4] D. S. Franzblau and D. J. Kleitman, "An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals," inProc. 16th Annu. ACM Symp. Theory Comput., 1984, pp. 167-174.
[5] F.T. Leighton, "Tight bounds on the complexity of parallel sorting," inProc. 16th Annu. ACM Symp. Theory Computing, Washington, DC, May 1984, pp. 71-80.
[6] D. Moitra and A. Moitra, "Irreducible cover for binary images using maximal squares," Aug. 1987, unpublished manuscript.
[7] J. H. Reif, "An optimal parallel algorithm for integer sorting," inIEEE Symp. Foundations Comput. Sci., 1985, pp. 496-503.
[8] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[9] D. S. Scott and S. S. Iyengar, "TID--A translation invariant data structure for storing images,"Commun. ACM, vol. 29, pp. 418-429, May 1986.

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
Usage of this product signifies your acceptance of the Terms of Use.