A low-complexity, lossless image compression algorithm which is suitable for real-time implementation is presented. The algorithm codes each pixel into a set of two symbols, a prefix and a suffix. The prefix is the number of most significant bits which are identical to a reference pixel, while the suffix is the remaining bits except for the leftmost bit. Three methods, two fixed and one adaptive, are investigated. The results compare favorably with those obtained by using existing schemes.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering