I've written a program which opens a bmp file and treats it as a character file and performs run length encoding on it. It produces a valid compressed encoding file, which I read again to perform the decoding. When i'd made the application i was using Fedora and it ran perfectly fine. Now i'm running it on ubuntu and it refuses to work....
I've written a program to perform run length encoding. In typical scenario if the text is AAAAAABBCDEEEEGGHJ run length encoding will make it A6B2C1D1E4G2H1J1 but it was adding extra 1 for each non repeating character. Since i'm compressing BMP files with it, i went with an idea of placing a marker "$" to signify the occurance of a...
I need a FAST decompression routine optimized for restricted resource environment like embedded systems on binary (hex data) that has following characteristics: Data is 8bit (byte) oriented (data bus is 8 bits wide). Byte values do NOT range uniformly from 0 - 0xFF, but have a poisson distribution (bell curve) in each DataSet. Dataset ...
I've been banging my head for a long time on this one I am doing imaging. So far I've binarized my images, meaning that from a grayscale image, every pixel under a certain value are dropped. This gives me only some regions out of the original image with a lot of "zero pixels" all around those regions. Next I've run length encoded my re...
The classical RLE algorithm compresses data by using numbers to represent how many times the character following a number appears in the text at that position. For example: AAABBAAABBCECE => 3A2B3A2B1C1E1C1E However, in the above example, that method results in even more space being used by the compressed text. A better idea would be t...