Abstract

A new data compression algorithm for a binary image is presented. This is fully 2-dimensional and has a hierarchical format for describing a macroscopic image structure. An image is described as a set of uniform rectangles and a set of explicit point-by-point data which are outside of these rectangles. The basic problem involved is to find the largest possible rectangle in a given region. For this purpose an image pyramid is employed. The simulation results of this algorithm show a very good compression ratio. This algorithm has many other interesting characteristics and can be applied for the image data storage, image edition and image transmission.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.