General information about RLE
The purpose of the application is to demonstrate the run length encoding algorithms: Column by Column, Row by Row, Zig-Zag, Hilbert Space Filling Curve and Sierpinski Space Filling Curve.
Overview
RLE animates compression of bitmaps using lossless methods: Column by Column, Row by Row, Zig-Zag, Hilbert and Sierpinski Space Filling Curves.
The RLE compression techniques count the number of runs of black and white pixels in the bitmap. We assume that the bitmap starts with a white pixel. If it is not true, then the bitmap starts with zero white pixels, and the output stream will start with 0. Next, we will record the length of the black pixel run, followed by the length of the white pixel run, and so on.
Although RLE algorithms do not usually yield compression ratios as high as other algorithms, most of them are both fast and easy to implement. RLE algorithms are used as one of the components of several hybrid image compression algorithms (algorithms that use more than one technique), such as JPEG.
E-mail comments or suggestions about RLE to khuri@cs.sjsu.edu or joy@mathcs.sjsu.edu