Thresholding And Quantization Algorithms for Image Compression Techniques: A Review

Uncompressed form of the digital images are needed a very large storage capacity amount, as a consequence requires large communication bandwidth for data transmission over the network. Image compression techniques not only minimize the image storage space but also preserve the quality of image. This paper reveal image compression technique which uses distinct image coding scheme based on wavelet transform that combined effective types of compression algorithms for further compression. EZW and SPIHT algorithms are types of significant compression techniques that obtainable for lossy image compression algorithms. The EZW coding is a worthwhile and simple efficient algorithm. SPIHT is an most powerful technique that utilize for image compression depend on the concept of coding set of wavelet coefficients as zero trees. The proposed compression algorithm that combined dual image compression techniques (DICT) invest an excellent features from each methods, which then produce promising technique for still image compression through minimize bits number that required to represent the input image, to the degree allowed without significant impact on quality of reconstructed image.
 The experimental results present that DICT will improve the image compression efficiency between 8 to 24%, and will result high performance of metrics values.

Compression of images process is a step in the image processing. It is concerned with the transmission and storage of digitally created images. Fractal coding is a potential image and video compression approach with good reconstruction fidelity and relatively large compression ratios, because of its simplicity and great performance; fractal image compression (FIC) is a particularly popular approach in image compression applications. However, it has a significant disadvantage in the form of a long encoding time. This is because encoding any small bit necessitates a massive similarity search in the original data As a result; the FIC search time is reduced while the quality of the reconstructed images is maintained acceptable level in many introduced paper and other still a study topic in progress. Fractal images are images that are self-similar in that each individual part is the same as the total. This paper will discusses many attempts for more author that working on image and video compression using fractal compression technique based on various approach and with each discuss focuses on the main parameter of compression such compression ratio (CR), peak signal to noise ratio (PSNR) and encoding time, as well as the details of data set the used for testing also writing with each technique to creating fractal video and image compression. Index Terms— FIC, Video compression, parallel processing, Iteration Function System (IFS), Image processing.

The rapid advancement of digital technology has created a demand for improved compression methods. Image compression is data compression applied to digital images. The goal is to eliminate picture data redundancy in order to store or transfer data efficiently. When a picture is compressed at low bitrates, the image fidelity is lost. Images can be compressed in several ways. This paper reviews image kinds and compression strategies. All type of images and the factors by which one can identify the performance assessment of images are described in this paper.

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.

New techniques for image compression and image magnification using the theory of fractals is proposed. The fractal codes are designed assuming the self similarity property of images. In particular, to generate the fractal codes, the genetic algorithm is used which greatly decreases the search for finding self similarities in the given image. The obtained fractal codes are stored instead of the given image in the compression algorithm. Moreover the magnification task is performed using the obtained fractal codes of the image instead of the original one resulting in a reduction in memory requirement. The article presents both theory and implementation of the proposed methods. A simple distortion measure scheme is also proposed to judge the image quality of the magnified image.

With the rapid growth of wireless sensor network technologies and the availability of less expensive hardware such as complementary metal oxide semiconductor cameras and microphones has encourage the development of wireless multimedia sensor network. Some application areas for wireless multimedia sensor network are health care monitoring, traffic monitoring, environment monitoring and wildlife monitoring. The constraints of sensors are limited processing capability, limited storage and energy. Energy consumed by sensor during image transmission is very high due to large size of images. Hence, networks lifetime is decreased rapidly. A numbers of techniques have been proposed to enhance the network lifetime. Image compression techniques are one of them. This paper describes the various image compression techniques, which can be used to aid energy efficient wireless multimedia sensor network. Furthermore, we have compared various image compression techniques, so one can find out suitable compression technique for their application.

Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.

A novel Adaptive Lossy Image Compression (ALIC) technique is proposed to achieve high compression ratio by reducing the number of source symbols through the application of an efficient technique. The proposed algorithm is based on processing the discrete cosine transform (DCT) of the image to extract the highest energy coefficients in addition to applying one of the novel quantization schemes proposed in the present work. This method is straightforward and simple. It does not need complicated calculation; therefore the hardware implementation is easy to attach. Experimental comparisons are carried out to compare the performance of the proposed technique with those of other standard techniques such as the JPEG. The experimental results show that the proposed compression technique achieves high compression ratio with higher peak signal to noise ratio than that of JPEG at low bit rate without the visual degradation that appears in case of JPEG.

Today with the development of technology the entire world is moving towards digital communication for fast and quality communication. Digital images play an important role in digital communication. Original image is too large in size requires huge storage space, large transmission bandwidth and more transmission time. Due to large storage space and bandwidth, cost of communication becomes high, and slow transmission degrades the quality communication which is not desirable. There is a need to reduce the size of image. Image compression is used to reduce the size of the image while maintaining the quality of an image as original image. Reduced size of image increases the storage capacity of system and reduces the channel bandwidth requirement making it feasible for high speed communication. There are several methods available to compress an image file. In this paper we use different types of image compression technique SVD, BTC DWT DCT to compress it. After that we find various parameters i.e. compression ratio, MSE, BPP, PSNR from each image compression technique and then compare each technique's parameters from one another.

This work introduces a new technique for lossless compression of color images. The technique is composed of first transforming an RGB image into luminance and chrominance domain (Y CuCv). Then, the luminance channel Y is compressed with a context-based, adaptive, lossless image coding technique (CALIC). After processing the chrominance channels with a hierarchical prediction technique that was introduced by Kim and Cho, Burrows-Wheeler Inversion Coder (BWIC) or JPEG 2000 is used to compress of the chrominance channels Cu and Cv. It is demonstrated that, on a wide variety of images, particularly on medical images, the technique achieves substantial compression gains over other well-known compression schemes such as CALIC, JPEG 2000, LOCO-I, BPG(HEVC), and the previously proposed hierarchical prediction and context adaptive coding technique LCIC.

Wavelet transforms emerge as one of the popular techniques in image compression. This technique is accepted by the JPEG Committee for the next-generation image compression standard JPEG-2000. Convolution-based strategy is widely used in calculating the wavelet transform of the image. A convolution-based wavelet transform consists of a large number of multiplications and additions. A color image consists of a two-dimensional matrix each for red, green, and blue colors. An ordinary way to calculate the wavelet transform of a color image includes calculating the transform of the intensity matrix of the red, green, and blue components. In this article, we present a parallel algorithm for calculating the convolution-based wavelet transform of the red, green, and blue intensity components simultaneously in color images, which can run on commonly used processors. This means that it needs no extra hardware. The results are also compared to the nonparallel algorithm based on compression time, mean square error, compression ratio, and peak signal-to-noise ratio. Complexity analysis and comparative complexity analysis with some other papers are also shown here.

With the continuous advances in technology, the bandwidth requirements of a communication network have been increased. But increased pixel size in and gray level resolution in sensor technology and in digital image representation, the increased bandwidth is not satisfying the requirements. Hence image compression becomes a prominent research area. Image compression decreases the number of bits necessary to symbolize the image without destroying the original quality of the image. This paper briefly discusses different types of image formats to represent the image, types of compression methods used, and their performance measurements.

Problem statement: Existing lossless image compression schemes attempt to do prediction in an image data using their Local Binary Pattern ( LBP) and their spatial neighborhood based techniques. In the previous techniques such as Vec tor Quantization (VQ) and Gradient Adjusted Prediction (GAP) the texture and non-texture region s are not classified separately. Texture and Non- texture images prophecy has been a key factor in ef ficient lossless image compression. Hence, there is a need to develop a more efficient image prediction scheme to exploit these texture components. Approach: In this research, an efficient visual quality tech nique for image compression is proposed. The image is classified into texture and non-textur e regions by using an Artificial Neural Network (ANN) Classifier. The texture region is encoded wit h the Similar Block Matching (SBM) encoder and the non-texture region is encoded with SPIHT encoding. Results: The proposed texture prediction based compression is compared with the existing compression techniques such as H.264 and JPEG. From the result it reveals that the Peak Signal to Noise Ratio (PSNR) values of all the test images is higher in the proposed technique as compared to JPE G technique. Similarly PSNR values are low in H.264 for all the images except Boat image when compared to the proposed technique. This result concludes that the increase in PSNR indicates that the output image has less noise as compared to existing techniques. Conclusion: The compression of the proposed algorithm is superi or to JPEG and H.264. Our new method of compression algorithm can be used to improve the performance of Compression ratio and Peak Signal to Noise Ratio (P SNR). In future this study can be extended to real time applications for video compression in medical images.

Block based transform coding is the most popular technique for image and video compression. However, images compressed using block based algorithms exhibit blocking which is one of the most annoying artifacts in compressed images and video. Many deblocking algorithms have been proposed to improve the quality of the reconstructed image. Although the deblocking operation improves the image appearance by smoothing the block discontinuities, a loss of information also occurs during this process. As a consequence, there is a need to develop methods to reduce the blocking artifacts while minimizing the information loss. We propose a novel fusion based technique to minimize the loss of useful information which may result from the deblocking operation. The loss of key image information can be reduced by fusing a deblocking result and the compressed image.

The recent years have witnessed rapid strides in the use of cloud computing and its countless applications. A cloud can contain massive volumes of multimedia data in the form of images, video and audio. Cloud computing platforms confront challenges in terms of data confidentiality, message integrity, user authentication and compression. Multimedia data needs plenty of storage capacity. Consequently, there is a need for multimedia data compression to reduce data size. Compression techniques are quite reliable, offering benefits to organizations dealing with metasized data in the cloud. Compressing large quanta of data leads to superior utilization of cloud storage. Compression techniques can compress data used for storage and transmission, yet compression alone is inadequate because multimedia data shared should, of necessity, be secure. Therefore, both multimedia compression and security are mandatory in the cloud. The chief goal of this paper is to propose a new framework, comprising multiscale transforms, public key cryptography and appropriate encoding techniques, that performs joint medical image compression and image encryption in the cloud. Multiscale transforms play a lead role in image compression, and the ones discussed in this paper include wavelet, bandelet, curvelet, ridgelet and contourlet transforms. Wavelet transforms offer robust localization both in terms of time and frequency domains. Bandelet transforms offer natural images geometric regularity to help improve the efficiency of representation. Curvelet transforms handle curve discontinuities well, with ridgelet transforms being the core idea behind curvelets. Contourlet transforms capture smooth contours and edges at any orientation. The Rivest-Shamir-Adleman (RSA) algorithm is used to encrypt images to provide maximum security when they are being transferred. Encoding techniques involved in this paper comprise the Embedded Zerotree Wavelet (EZW), Set Partitioning in Hierarchical Trees (SPIHT), Wavelet Difference Reduction (WDR), and Adaptively Scanned Wavelet Difference Reduction (ASWDR). Performance parameters such as peak signal to noise ratio (PSNR), mean square error (MSE), image quality index and structural similarity index (SSIM) are used for evaluation. It is justified that the proposed framework compresses images securely in the cloud.