A New Method of image Compression Using Irreducible Covers of Maximal Rectangles

Authors:
Y. Cheng;S. S. Iyengar;R. L. Kashyap
Affiliations:
-;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1988

Citing 4
Cited 5

TID—a translation invariant data structure for storing images

Communications of the ACM
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
Tight bounds on the complexity of parallel sorting

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

A retrieval technique for similar shapes

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Covering rectilinear polygons with axis-parallel rectangles

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for approximate polygon decomposition and minimum gap

Information Processing Letters
Hardness of Set Cover with Intersection 1

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Discriminative Representation for Symbolic Image Similarity Evaluation

Graphics Recognition. Recent Advances and New Opportunities

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.