2015
DOI: 10.1109/tip.2014.2363411
|View full text |Cite
|
Sign up to set email alerts
|

An Innovative Lossless Compression Method for Discrete-Color Images

Abstract: In this paper, we present an innovative method for lossless compression of discrete-color images, such as map images, graphics, GIS, as well as binary images. This method comprises two main components. The first is a fixed-size codebook encompassing 8×8 bit blocks of two-tone data along with their corresponding Huffman codes and their relative probabilities of occurrence. The probabilities were obtained from a very large set of discrete color images which are also used for arithmetic coding. The second compone… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
8
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…There are 'r' registers in the generator which boost their values at each instant depending on the value of the incoming pointer to the shift register. The main requirements of the pseudo noise code are good spectral characteristics and security [8].…”
Section: Proposed Methodsmentioning
confidence: 99%
“…There are 'r' registers in the generator which boost their values at each instant depending on the value of the incoming pointer to the shift register. The main requirements of the pseudo noise code are good spectral characteristics and security [8].…”
Section: Proposed Methodsmentioning
confidence: 99%
“…In addition to the storage, data are often required to be transmitted over the Internet at the highest possible speed. Due to the constraint in storage facility and limitation in transmission bandwidth, compression of data is vital [1][2][3][4][5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%
“…In [26], the image pixels are predicted by a hierarchical prediction scheme and then the wavelet transform is applied to the prediction error. Some work [5,9,11,[27][28][29][30] applies various types of image transformation or pixel difference or simple entropy coding. An image transformation scheme known as "J bit encoding" (JBE) has been proposed in [11].…”
mentioning
confidence: 99%
“…Energyefficient low bit rate image compression in wavelet domain for wireless image sensor networks; in this technique, the authors presented Wavelet transform based approximation band algorithm for low bit rate image compression (Phamil and Amutha, 2015). An innovative lossless compression method for discrete-color images; in this paper relative probability of occurrence of Huffman codes and rowcolumn reduction coding were performed on images (Alzahir and Borici, 2015). A 151 dB High Dynamic Range CMOS Image Sensor Chip Architecture with tone mapping compression embedded in-pixel; in the proposed framework, in-pixel content-aware adaptive global tone mapping algorithm is studied and tone mapping curve on the compression function of illuminations is calculated using histogram (Vargas et al, 2015).…”
Section: Introductionmentioning
confidence: 99%