Lossless Image Compression Using Seed Number and JPEG-LS Prediction Technique

The article considers the relevance of the development of lossless image compression and transmission algorithms and their application for creating transport video surveillance systems. A brief overview of lossless transport image compression methods is provided. We propose a method for compressing transport plots based on the pyramid-recursive method of splitting the source image into polygons of various shapes and sizes. We consider two new algorithms for implementing the proposed method that are fundamentally different from each other: with a transition to the spectral region and without a transition to the spectral region of the original signal to ensure lossless compression. The results of testing various well-known lossless compression algorithms are analyzed: series length, Huffman, and arithmetic encoding, and compared with the proposed algorithms. It is shown that the proposed algorithms are more efficient in terms of compression ratio (2—3 times) compared to the known ones, while the computational complexity increases approximately by more than 3-4 times.

Problem statement: Identifying the new lossless image compression algorithm for high performance applications like medical and satellite imaging; a high quality lossless image is most important when reproduction which leads to classify the data for decision making. Approach: A new lossless hybrid algorithm based on simple selective scan order with Bit Plane Slicing method is presented for lossless Image compression of limited bits/pixel images, such as medical images, satellite images and other still images common in the world. Efficient coding is achieved by run length and modified Huffman coding. This approach is combined with efficient selective scan order for entire image in one pass through. Results: The new hybrid algorithm achieves good compression rate, compared to the existing schemes of coding with different test images. Conclusion: Compared to the existing standards JPEG-LS and CALIC, the compression rate is reduced with our proposed algorithm for different standard test images.

Although subband and wavelet coding have been proved to be very efficient for lossy image compression, it is generally not possible to represent the output of most subband/wavelet filters by a limited number of bits and yet guarantee perfect reconstruction. This is a fundamental problem when applying subband and wavelet coding to lossless image compression. This paper presents a solution to this problem by an investigation of interpolative subband coding. Based on an evaluation of the decorrelation performance of some typical image interpolation techniques, a new interpolative coding algorithm has been proposed. The new algorithm has been shown to be superior to two related algorithms, the hierarchical interpolation algorithm and the recently published minimum entropy pyramid algorithm.

In this article we report on a study of how to use the context tree weighting (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modifications of the basic CTW algorithm to let it work more efficiently for image data. Our research is briefly focussed on the compression of medical gray scale images.

With the success of deep learning in computer vision applications, deep learning based algorithms have also been proposed for image processing applications. One such application is lossless image compression. Most traditional lossless image compression algorithms use pixel-by-pixel processing algorithms. In the pixel-by-pixel algorithms, each pixel is predicted from the previously coded neighbor pixels and the prediction error is compressed without loss. Deep learning based lossless image compression algorithms can be categorized into two categories, namely prior based algorithms and pixel-by-pixel (or masked convolution based) algorithms. In the pixel-by-pixel algorithms, each pixel's probability distribution is obtained by processing the previously coded neighboring pixels with a neural network, which is then used by an arithmetic coder for lossless compression. This paper explores a deep learning based architecture, which utilizes masked convolutions, to model probability distributions of pixels and also presents a method to improve the parallelization of the algorithms. The obtained compression performance is competitive and is compared to both state-of-the art traditional and deep learning based methods.

In technological developments, it also affects the size of the data from a file, especially in transmitting JPEG images or images. Digital images have a size or capacity that is large enough so that the image transmission process often experiences problems due to its large enough capacity. Large data sizes also require large storage space, therefore additional solutions are needed to save space on storage media, such as reducing the size of the data to be stored. Knowing the value of the speed and efficiency of the JPEG image compression process needs to remember so many compression methods that exist today, one of which is the FELICS method. Image compression is carried out on images aimed at reducing the redundancy of existing data in the image so that it can be stored or transmitted efficiently. The FELICS method, which stands for Fast Compression & Lossless Image System, is a lossless image compression algorithm that performs 5 times faster than the original lossless JPEG codec and produces a compression ratio of the same value. So through this research the writer wants to carry out the analysis process of the FELICS method. The Fast Compression & Lossless Image System method works very well on images and produces high ratio values. Keywords : Analysis, Image, Compression, FELICS Method

An antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary alphabet. This paper proposes on-line ECG lossless compression for a given data on a finite alphabet. The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do. Moreover, the proposed algorithm work in real-time. Its effectiveness is demonstrated by simulation results.

A multidimensional incremental parsing algorithm (MDIP) for multidimensional discrete sources, as a generalization of the Lempel-Ziv coding algorithm, is investigated. It consists of three essential component schemes, maximum decimation matching, hierarchical structure of multidimensional source coding, and dictionary augmentation. As a counterpart of the longest match search in the Lempel-Ziv algorithm, two classes of maximum decimation matching are studied. Also, an underlying behavior of the dictionary augmentation scheme for estimating the source statistics is examined. For an m-dimensional source, m augmentative patches are appended into the dictionary at each coding epoch, thus requiring the transmission of a substantial amount of information to the decoder. The property of the hierarchical structure of the source coding algorithm resolves this issue by successively incorporating lower dimensional coding procedures in the scheme. In regard to universal lossy source coders, we propose two distortion functions, the local average distortion and the local minimax distortion with a set of threshold levels for each source symbol. For performance evaluation, we implemented three image compression algorithms based upon the MDIP; one is lossless and the others are lossy. The lossless image compression algorithm does not perform better than the Lempel-Ziv-Welch coding, but experimentally shows efficiency in capturing the source structure. The two lossy image compression algorithms are implemented using the two distortion functions, respectively. The algorithm based on the local average distortion is efficient at minimizing the signal distortion, but the images by the one with the local minimax distortion have a good perceptual fidelity among other compression algorithms. Our insights inspire future research on feature extraction of multidimensional discrete sources.

We present a novel lossless image compression algorithm. It achieves better compression than popular lossless image formats like PNG and lossless JPEG 2000. Existing image formats have specific strengths and weaknesses: e.g. JPEG works well for photographs, PNG works well for line drawings or images with few distinct colors. For any type of image, our method performs as good or better (on average) than any of the existing image formats for lossless compression. Interlacing is improved compared to PNG, making the format suitable for progressive decoding and responsive web design.

Diabetic retinopathy is the leading cause of blindness in the adult population. Mass-screening efforts, during which high resolution images of the retina are captured, are therefore underway in order to detect the disease in its early stages. In this paper we evaluate the compression performance of several lossless image compression algorithms that could be employed in a retina Picture Archiving and Communications System to lessen the demand on computing resources. The algorithms we analyse are TIFF PackBits, Lossless JPEG, JPEG-LS, and JPEG2000 all of which are incorporated in the current DICOM standard together with the non-standard CALIC algorithm for benchmark comparison. Compression performance is evaluated in terms of compression ratio, compression speed, and decompression speed. Based on a large dataset of more than 800 colour retinal images, divided into groups according to retinal region (nasal, posterior, and temporal) and image size, JPEG-LS is found to be the most suitable compression algorithm, offering good compression ratios combined with high compression and decompression speed. Compression ratios can be further improved through the application of a reversible colour space transformation prior to compression as a second set of experiments show.

In this paper we propose a DWT-based perceptually lossless image compression algorithm and architecture. Many image-capturing devices acquire images in subsampled R-G-B format and have real-time constraints which prohibit conversion to other formats, generally preferred for image compression, such as Y-Cb-Cr. Therefore, we propose a compression algorithm which works performed directly on the subsampled R-G-B data. The scheme exploits the correlation between the color planes and the perceptual sensitivity of the human visual system in order to improve the compression ratio. Moreover it can be easily mapped into an integrated fast architecture yielding very high throughput.

Space research organizations, hospitals and military air surveillance activities, among others, produce a huge amount of data in the form of images hence a large storage space is required to record this information. In hospitals, data produced during medical examination is in the form of a sequence of images and are very much correlated; because these images have great importance, some kind of lossless image compression technique is needed. Moreover, these images are often required to be transmitted over the network. Since the availability of storage and bandwidth is limited, a compression technique is required to reduce the number of bits to store these images and take less time to transmit them over the network. For this purpose, there are many state-of the-art lossless image compression algorithms like CALIC, LOCO-I, JPEG-LS, JPEG20000; Nevertheless, these compression algorithms take only a single file to compress and cannot exploit the correlation among the sequence frames of MRI or CE images. To exploit the correlation, a new algorithm is proposed in this paper. The primary goals of the proposed compression method are to minimize the memory resource during storage of compressed data as well as minimize the bandwidth requirement during transmission of compressed data. For achieving these goals, the proposed compression method combines the single image compression technique called super spatial structure prediction with inter-frame coding to acquire grater compression ratio. An efficient compression method requires elimination of redundancy of data during compression; therefore, for elimination of redundancy of data, initially, the super spatial structure prediction algorithm is applied with the fast block matching approach and later Huffman coding is applied for reducing the number of bits required for transmitting and storing single pixel value. Also, to speed up the block-matching process during motion estimation, the proposed method compares those blocks that have identical sum and leave the others; therefore, the time taken by the block-matching process is reduced by minimizing the unnecessary overhead during the blockmatching process. Thus, in the proposed fast lossless compression method for medical image sequences, the twostage redundant data elimination process ultimately reduces the memory resource required for storing and transmission. The method is tested on the sequences of MRI and CE images and produces an improved compression rate.

As medical imaging facilities move towards film-less imaging technology, robust image compression systems are starting to play a key role. Conventional storage and transmission of large-scale raw medical image datasets can be very expensive and time-consuming. Recently, we proposed a memory-assisted lossless image compression algorithm based on Principal Component Analysis(PCA). In this paper, we further improve the performance of the algorithm in two different directions: Firstly, we replace PC A with NMF (Non Negative Matrix Factorization). NMF has several advantages in representing images with an image-like basis, results in sparse factors, and provides better user control over iterations. Secondly, we expand the single-level model with a new multilevel decomposition/projection framework to further reduce entropy of residual images. Our experimental results on X-ray images confirm that both modifications provide significant improvements over the single level PCA based algorithm as well as existing non-memory based techniques.

Integer-coefficient Discrete Wavelet Transformation (DWT) filters widely used in the literature are implemented and investigated as spectral decorrelator for on-board lossless hyperspectral image compression. As the performance of spectral decorrelation step has direct impact on the compression ratio (CR), it is important to employ the most convenient spectral decorrelator in terms of low computational complexity and high CR. Extensive tests using AVIRIS image data set are carried out and CRs corresponding to various subband decomposition levels are presented within a lossless hyperspectral compression framework. Results suggest that Cohen-Daubechies-Feauveau (CDF) 9/7 integer-coefficient wavelet transform with five levels of spectral subband decomposition would be an efficient spectral decorrelator for on-board lossless hyperspectral image compression.

Images include information about human body which is used for different purpose such as medical examination security and other plans Compression of images is used in some applications such as profiling information and transmission systems. Regard to importance of images information, lossless or loss compression is preferred. Lossless compressions are JPEG, JPEG-LS and JPEG2000 are few well-known methods for lossless compression. We will use differential pulse code modulation for image compression with Huffman encoder, which is one of the latest and provides good compression ratio, peak signal to noise ratio and minimum mean square error. In real time application which needs hardware implementation, low complex algorithm accelerate compression process. In this paper, we use differential pulse code modulation for image compression lossless and near-lossless compression method is introduced which is efficient due to its high compression ratio and simplicity. This method is consists of a new transformation method called Enhanced DPCM Transformation (EDT) which has a good energy compaction and a suitable Huffman encoding. After introducing this compression method it is applied on different images from Corel dataset for experimental results and analysis. Also we compare it with other existing methods with respect to parameter compression ratio, peak signal noise ratio and mean square error.