JOURNAL ARTICLE

Lossless Compression Of Images Using Logic Minimization

Abstract

A novel approach for the lossless compression of images is presented. After preprocessing, the image is split into bit planes which are then divided into smaller blocks. Mixed blocks are converted to Boolean switching functions and then subjected to minimization to arrive at a compact representation, leading to possible data compression. Blocks are then classified into distinct events based on the outcome of logic minimization. A Huffman code is constructed and the blocks are encoded suitably. This approach provides a framework to incorporate various possible switching theoretic techniques into the basic coding scheme proposed by us. This paper also shows that logic minimization can be used to handle blocks of larger size, than practically possible with Huffman coding, to yield significant compression on gray-level images. Our approach compares well with JPEG in terms of compression ratio.

Keywords:
Lossless compression Huffman coding Computer science Algorithm Minification Data compression Image compression Canonical Huffman code JPEG Data compression ratio Theoretical computer science Artificial intelligence Image (mathematics) Image processing Decoding methods

Metrics

11
Cited By
0.38
FWCI (Field Weighted Citation Impact)
13
Refs
0.68
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Data Compression Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Numerical Methods and Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Lossless Compression Using Two-Level and Multilevel Boolean Minimization

Jeehong YangSerap A. SavariOskar Mencercv

Journal:   SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems Year: 2006 Pages: 148-152
© 2026 ScienceGate Book Chapters — All rights reserved.