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.
18 July 1988Dynamically Differenced Rectangles For Reversible Image Data Compression
The goal of this work is to develop better reversible data compression techniques for image data. A variety of known standard techniques (Run length, Huffman, Arithmetic, Contour tracing and Rectangles) are compared with two new hybrid techniques (Dynamically differenced contours and Dynamically differenced rectangles). The comparison includes the degree of data compression and the encode/decode times for 256 by 256 eight-bit per pixel grayscale images. Results indicate that the 'Dynamically differenced rectangles' technique generally gives the greatest degree of data compression, and also has favorable encode/decode times.
The alert did not successfully save. Please try again later.
Gerardus S. Plattel, Kevin Bowyer, "Dynamically Differenced Rectangles For Reversible Image Data Compression," Proc. SPIE 0939, Hybrid Image and Signal Processing, (18 July 1988); https://doi.org/10.1117/12.947051