A new method of image compression using irreducible covers of maximal rectangles
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 14 (5) , 651-658
- https://doi.org/10.1109/32.6142
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- TID—a translation invariant data structure for storing imagesCommunications of the ACM, 1986
- An optimal parallel algorithm for integer sortingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Minimal rectangular partitions of digitized blobsComputer Vision, Graphics, and Image Processing, 1984
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- An algorithm for constructing regions with rectanglesPublished by Association for Computing Machinery (ACM) ,1984
- Tight bounds on the complexity of parallel sortingPublished by Association for Computing Machinery (ACM) ,1984
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981