Low complexity image compression algorithm using AMBTC and bit plane squeezing

Abstract

This paper introduces a low complex image compression algorithm. The proposed algorithm is a combination of pattern squeezing, moments re-quantizing, absolute moments block truncation coding (AMBTC) and a postprocessing unit. One advantage of the proposed algorithm is that it reduces and controls the higher bit rate of the AMBTC while preserving a reasonable image quality. The complexity reduction has been accomplished by utilizing only four (2×2) bit patterns rather than a 32 or 64 (4×4) pattern fitting. This proposed size of pattern fitting reduces the computation costs by reducing the time and arithmetic operations required to search for the best match plane. The four (2×2) bit planes offer the advantage of bit rate control by performing multi level bit plane reduction. This operation has been named pattern squeezing. The algorithm performance has shown good image quality with lower bit rate.