You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
26 September 2001Fractal-coding-like lossless binary image compressing method
A new binary image lossless compressing method is proposed, which regards a binary image as being constructed of a limited number of fractal elements that have undergone a series of operations such as contraction/dilation, embedding and jointing. Therefore, coding compression for an image is mainly a process of acquiring its specific fractal structure. This algorithm defines 16 basic elements of size 2x2, which can be dilated to power of 2 or put together side by side when of the same type to make up a self-similar element set in different scales. This element set constitutes the codebook of fractal-like-coding. Prior to coding, it is necessary to carry out decorrelation operation of an image and then perform sliding matching on the image with the elements to find the best matching element that meets appropriate matching merit. Record the error subimage that may have formed owing to incomplete matching. Then carry out dynamic segment designates coding for the error image featuring a sparse matrix form. Finally perform arithmetic coding for the code characters sequence obtained. It has been demonstrated by testing images of different complexities that the new method is very efficient to encode binary images.