Image Compression Technology Research Articles

Syntax-Guided Content-Adaptive Transform for Image Compression.

The surge in image data has significantly increased the pressure on storage and transmission, posing new challenges for image compression technology. The structural texture of an image implies its statistical characteristics, which is effective for image encoding and decoding. Consequently, content-adaptive compression methods based on learning can better capture the content attributes of images, thereby enhancing encoding performance. However, learned image compression methods do not comprehensively account for both the global and local correlations among the pixels within an image. Moreover, they are constrained by rate-distortion optimization, which prevents the attainment of a compact representation of image attributes. To address these issues, we propose a syntax-guided content-adaptive transform framework that efficiently captures image attributes and enhances encoding efficiency. Firstly, we propose a syntax-refined side information module that fully leverages syntax and side information to guide the adaptive transformation of image attributes. Moreover, to more thoroughly exploit the global and local correlations in image space, we designed global-local modules, local-global modules, and upsampling/downsampling modules in codecs, further eliminating local and global redundancies. The experimental findings indicate that our proposed syntax-guided content-adaptive image compression model successfully adapts to the diverse complexities of different images, which enhances the efficiency of image compression. Concurrently, the method proposed has demonstrated outstanding performance across three benchmark datasets.

Research on image compression technology based on improved SPIHT compression algorithm for power grid data

Abstract At present, the amount of information on power grid operation and maintenance monitoring image data is increasing, and the requirements for data compression are higher and higher. Based on the improved SPIHT image compression algorithm, this study presents the research of power grid data compression. First, the basic theory of image compression, and the principle of one-dimensional wavelet transform and two-dimensional wavelet transform are introduced. The development process, characteristics, and advantages of image coding are discussed. Then, the shortcomings of the SPIHT algorithm are analyzed, and the SPIHT coding is improved by parallel computation. The parallel wavelet transform algorithm based on the block idea and the parallel SPIHT coding algorithm based on the code tree are proposed in the data parallelism of the compression algorithm. At the same time, the data dependence between tasks in the process of SPIHT image compression coding is analyzed, and the task parallelism in the compression algorithm is realized by using the relative independence of tasks in different threshold coding. Finally, the application and simulation analysis of power grid data based on the SPIHT compression algorithm, the construction of power grid data model simulation, and the composition of two-dimensional power grid data images are carried out. Secondly, the obtained 2D power grid data image is compressed by the SPIHT algorithm and improved SPIHT algorithm, respectively, and the compression effect of the two algorithms on the power grid data image is compared. When the bit rate is 0.5, the compression effect of the improved SPIHT algorithm is 13.6506. When the bit rate is 1, the compression effect of the improved SPIHT algorithm is 18.9287. The results show that the improved SPIHT algorithm can compress the grid data to obtain better grid image quality.

A lossy compression algorithm for data basis images based on DCT decomposition and diffuse representation

In this manuscript, we present a novel approach for compressing a database of images. Initially, we introduce a new representation that effectively reduces the data required to represent the image, enhancing the efficiency of subsequent compression steps. We apply the Discrete Cosine Transform (DCT) to the new representation and perform thresholding at different levels for a selected image. The DCT is known for concentrating image energy into a few coefficients, making it ideal for compression. By calculating the Peak Signal-to-Noise Ratio (PSNR) variation of the reconstructed image and evaluating the percentage of non-zero coefficients after thresholding, we plot the corresponding curve. These calculations provide insights into the quality of the reconstructed image, ensuring minimal degradation from compression. We repeat the steps with the Discrete Wavelet Transform (DWT), known for its multi-resolution analysis, to compare its performance against the DCT. The curves help us observe which process allows for image reconstruction with only a small percentage of coefficients, achieving significant data reduction. This comparative analysis determines the most effective method for various types of images. After analyzing the digital results from these curves, we generate and discuss the reconstructed image outcomes in detail. The digital and visual results presented at the conclusion demonstrate the robustness of the proposed strategy. We also explore potential applications in fields such as medical imaging, remote sensing, and multimedia storage, highlighting its versatility. Our findings suggest that the novel representation combined with DCT is highly effective, offering substantial storage space savings while maintaining image quality. These results are significant for theoretical research and practical implementations, providing a foundation for future advancements in image compression technologies.

Lossless and lossy remote sensing image encryption-compression algorithm based on DeepLabv3+ and 2D CS

With the advancement of remote sensing technology, the amount of remote sensing image (RSI) has increased sharply. The explosion in data volume requires higher standards of image compression and encryption technology. This paper proposes a lossless and lossy encryption-compression method for RSI. Because RSIs contain important and unimportant information, using a normal algorithm could ignore their important information or reduce the computational efficiency, so we use the trained model by DeepLabv3+ to segment the region of interest (ROI) and the region of non-interest (RONI), and implement lossless and lossy algorithms respectively. The whole algorithm is based on the newly proposed hyperchaotic system 2D Tent coupled Infinite collapse map (2D TICM). According to the 2D TICM, the dynamic 3D Latin cube is generated. This cube is then used for dynamic scrambling algorithms between multiple planes (3D LMBS), within planes (3D LMIS), and for the multiple dynamic S boxes substitution algorithm. Due to the large size of RSI, the image is divided into blocks, and MATLAB parallel mechanism is used to encrypt each block at the same time. First, the lossy part is scrambled by 3D LMIS, then compressed with 2D compressive sensing (2D CS). Finally, each block is substituted with a different S box. A CS reconstruction algorithm combining decryption and reconstruction, 2D projection gradient chaotic decryption algorithm (2D PG-CD), is proposed. The lossless part embeds the encryption into JPEG-LS, encrypts while compressing, and then encrypts according to 3D LMBS and S boxes. The algorithm in this paper considers the characteristics of RSI, experiments show that it has good security and compression performance.

Image compression and reconstruction based on GUI and Huffman coding

Huffman coding is an important part of image compression technology, the image compression platform is based on GUI, and Huffman is also widely used. This paper introduces the basic principle of the Huffman algorithm, compares it with arithmetic coding and run length encoding, and expounds on the application of these three algorithms in JPEG compression. The AC algorithm combined block-based, fine texture models and adaptive arithmetic coding in the given an example. The RLE algorithm used automatic threshold, direction judgment, and selective value counts to improve its compression efficiency. JPEG algorithm adopted an adaptive quantization table to reduce the distortion rate of image compression. This paper proves the possibility of a better compression rate and distortion rate of the hybrid compression algorithm by demonstrating the improved example of the basic image compression algorithm. In the future, the improved basic algorithms can be combined based on the original JPEG algorithm, and different algorithms can be integrated on the GUI to face different use environments.

Image Splicing Compression Algorithm Based on the Extended Kalman Filter for Unmanned Aerial Vehicles Communication

The technology of unmanned aerial vehicles (UAVs) is extensively utilized across various domains due to its exceptional mobility, cost-effectiveness, rapid deployment, and flexible configuration. However, its limited storage space and the contradiction between the large amount of image data returned and the limited bandwidth in emergency scenarios necessitate the development of a suitable UAVs image compression technology. In this research, we propose an image splicing compression algorithm based on the extended Kalman filter for UAV communication (SEKF-UC). Firstly, we introduce the concept of image splicing to enhance the compression ratio while ensuring image quality, leveraging the characteristics of deep learning-based compression, which are relatively unaffected by the size of the compressed data. Secondly, to address the issue of slow processing speed of deep neural networks (DNN) caused by the substantial volume of data involved in image splicing, we incorporate an extended Kalman filter module to expedite the process. Simulation experiments show that our proposed algorithm outperforms existing methods in multiple ways, achieving a significant compression ratio improvement, from 2:1 to 25:1, with a marginal reduction of 6.5% in structural similarity (SSIM) compared to the non-spliced approach. Moreover, for deep neural networks (DNN), our method incorporating the extended Kalman filter module achieves the same error level with only 30 iterations—a significant reduction compared to the traditional BP algorithm’s requirement of over 4000 iterations—while improving the average network operation speed by an impressive 89.76%. Additionally, our algorithm excels in image quality, with peak signal-to-noise ratio (PSNR) improving by 92.7% and SSIM by 42.1%, at most, compared to other algorithms. These results establish our algorithm as a highly efficient and effective solution, suitable for various image processing and data compression applications.

Comparison of image compression techniques using Huffman and Lempel-Ziv-Welch algorithms

Image compression technology is very popular in the field of image analysis because the compressed image is convenient for storage and transmission. In this paper, the Huffman algorithm and Lempel-Ziv-Welch (LZW) algorithm are introduced. They are widely used in the field of image compression, and the compressed image results of the two algorithms are calculated and compared. Based on the four dimensions of Compression Ratio (CR), Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) and Bits Per Pixel (BPP), the applicable conditions of the two algorithms in compressing small image files are analysed. The results illustrated that when the source image files are less than 300kb, the Compression Ratio (CR) of Huffman algorithm was better than that of LZW algorithm. However, for Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR) and Bits Per Pixel (BPP), which are used to represent the compressed images qualities, LZW algorithm gave more satisfactory results.

Research on Spaceborne Target Detection Based on Yolov5 and Image Compression

Satellite image compression technology plays an important role in the development of space science. As optical sensors on satellites become more sophisticated, high-resolution and high-fidelity satellite images will occupy more storage. This raises the required transmission bandwidth and transmission rate in the satellite–ground data transmission system. In order to reduce the pressure from image transmission on the data transmission system, a spaceborne target detection system based on Yolov5 and a satellite image compression transmission system is proposed in this paper. It can reduce the pressure on the data transmission system by detecting the object of interest and deciding whether to transmit. An improved Yolov5 network is proposed to detect the small target on the high-resolution satellite image. Simulation results show that the improved Yolov5 network proposed in this paper can detect specific targets in real satellite images, including aircraft, ships, etc. At the same time, image compression has little effect on target detection, so detection complexity can be effectively reduced and detection speed can be improved by detecting the compressed images.

Medical Image Compression Based on Variational Autoencoder

With the rapid growth of medical image data, it has become a current research hotspot that how to realize the large amounts of the real-time upload and storage of medical images with limited network bandwidth and storage space. However, currently, medical image compression technology cannot perform joint optimization of rate (the degree of compression) and distortion (reconstruction effect). Therefore, this study proposed a medical image compression algorithm based on a variational autoencoder. This algorithm takes rate and distortion as the common optimization goal and uses the residual network module to directly transmit information, which alleviates the contradiction between improving the degree of compression and optimizing the reconstruction effect. At the same time, the algorithm also reduces image loss in the medical image compression process by adding the residual network. The experimental results show that, compared with the traditional medical image compression algorithm and the deep learning compression algorithm, the algorithm in this study has smaller distortion, better reconstruction effect, and can obtain higher quality medical images at the same compression rate.

An Efficient Enhanced Full Homomorphic Encryption for Securing Video in Cloud Environment

At present days, exponential growth in the transmission of multimedia data takes place due to a significant rise in network bandwidth and video image compression technologies. However, the transmission of videos over wireless channels often brings an unseen risk that sensitive video details might be corrupted and distributed in an illegal way. So, the security of video transmission has become a hot research topic. Several encryption models have been presented in the literature, yet, it is believed that the performance of encryption process can be further improved. In this perspective, an efficient novel video encryption technique is presented using an enhanced variant of Fully Homomorphic Encryption (FHE) model called as EFHE model. By the hybridization of Ducas and Micciancio (DM) with the FHE model presented by Gentry, Sahai, and Waters (GSW), matrix operations vector additions are properly employed in the proposed EFHE model. In addition, a new key generation scheme to increase the fastness of the encryption process. The EFHE model is designed and placed on a cloud environment which leads to reduced cloud user’s communication and computation complexity. It is ensured that the presented EFHE model is highly efficient and secure over the compared methods.

A General Rate-Distortion Optimization Method for Block Compressed Sensing of Images.

Block compressed sensing (BCS) is a promising technology for image sampling and compression for resource-constrained applications, but it needs to balance the sampling rate and quantization bit-depth for a bit-rate constraint. In this paper, we summarize the commonly used CS quantization frameworks into a unified framework, and a new bit-rate model and a model of the optimal bit-depth are proposed for the unified CS framework. The proposed bit-rate model reveals the relationship between the bit-rate, sampling rate, and bit-depth based on the information entropy of generalized Gaussian distribution. The optimal bit-depth model can predict the optimal bit-depth of CS measurements at a given bit-rate. Then, we propose a general algorithm for choosing sampling rate and bit-depth based on the proposed models. Experimental results show that the proposed algorithm achieves near-optimal rate-distortion performance for the uniform quantization framework and predictive quantization framework in BCS.

Adaptive scene-aware deep attention network for remote sensing image compression

Deep neural networks have been successfully used in image processing and have benefitted image compression technology. On this basis, deeper and more extensive use of compression algorithms in remote sensing applications was investigated in our study. As a general residual block does not effectively utilize the connections between channels and spatial regions in the reconstruction process, an attention mechanism codec framework based on the channel-spatial attention residual block was introduced. Consequently, the network can account for the interdependence between channels and enhance specific spatial areas. Simultaneously, the feature importance map makes the network focus on valuable information, especially for small objects and remote sensing images with many tiny details, which is crucial to describe their contours. Introducing the attention mechanism commonly used in target detection can effectively recover the missing detailed information for remote sensing compressed images. Moreover, to utilize the underlying information of the various scene categories and characterize the feature differences between scenes in remote sensing images, an adaptive scene-aware module was introduced to enhance the feature representation in remote sensing images of different scenes. The experimental results show that the proposed method has superior subjective and objective effects in remote sensing image compression tasks.

A New Method for Geophysical Induced Polarization Inversion Based on Stochastic Medium Model and Sample-Compressed Artificial Neural Network

Induced polarization (IP) is a near-surface geophysical exploration method. Inverting the electrical properties of the underground medium from surface apparent IP parameters is a highly nonlinear problem. To further improve the accuracy, the artificial neural network (ANN) algorithm is applied to the two-dimensional (2D) IP data inversion for the first time. We firstly produced smooth geo-electric models based on the stochastic medium theory, and obtained the corresponding theoretical responses through forward modelling. Then, we compressed the responses and models through image compression technology. Finally, the above compressed responses and models were used as input and output samples to train an optimal network system for inversion. We tested the algorithm with synthetic examples. The results show that ANN can improve the longitudinal resolution of the inversion results and make the inversion results more focused.

Data Hiding Method for Color AMBTC Compressed Images Using Color Difference

Image compression technology and copyright protection are certainly the important technologies for free exchange of multimedia. For compression of an image, we propose a color Absolute Moment Block Trucation Coding (AMBTC) method using a common bit-plane created by k-means. In addition, a data hiding method based on a color AMBTC using Optimal Pixel Adjustment Process (OPAP) was proposed for copyright protection and confidential secret communication. The number of quantization levels of the proposed color AMBTC is nine per block. Therefore, the edge of the compressed color image can be expressed more delicately. As a result of the simulation, it can be seen that the edge of the image of the color AMBTC is close to the original image. Moreover, the data hiding performance of the proposed method also obtained excellent results. For the experiment, we measured the quality of the image using the Color Difference (CD) we proposed, and the measurement result was very satisfactory.

An advanced image compression technique by using a coupled compression algorithms depend on different wavelet methods

Digital images need a large storage capacity, and as a result they need a large bandwidth for data transmission to deliver to the desired destination over the network. Image compression technologies not only reduce the size of stored data, but also maintain as much as possible the output image quality. In the proposed research we review a technique for image compression that uses a distinct two-stage image encoding method using different compression algorithms and wavelet transform methods, which combines two types of effective compression algorithms that give more ability to compress image data. The proposed compression technique which coupled two image compression algorithms that put to use premium characteristics from each algorithm. The wavelet transform methods contribute effectively to finding suitable solutions to supply better compression ratios for images with high resolution. The complete series of compression includes repeated stages of encoding and decoding, in addition to the wavelet processing itself. This study will have carried out an advanced compression technique that contain a coupled compression algorithms relying on the preferred wavelets to this work from practical experiments they are, biorthogonal and Haar wavelet transform, the performance metrics for tested true HD color image will be studied. The challenge for image compression algorithms is to detect a best solution between a low compression ratio and good visual perception results. An essential measure of achieved image compression process is taken by compression ratio CR and the ratio of bit-per-pixel BPP. The CR and BPP metrics are important components in image compression techniques. Through the results of the image compression metrics in two stages, the best practical results were obtained when the compression ratio metric CR was equal to 2.3%, and this metric indicates that the compressed image can be stored using 2.3% of the original image data size. While the BPP which represent the bit number that used to store one pixel of true color image is equal to 0.575.

An advanced image compression technique by using a coupled compression algorithms depend on different wavelet methods

Digital images need a large storage capacity, and as a result they need a large bandwidth for data transmission to deliver to the desired destination over the network. Image compression technologies not only reduce the size of stored data, but also maintain as much as possible the output image quality. In the proposed research we review a technique for image compression that uses a distinct two-stage image encoding method using different compression algorithms and wavelet transform methods, which combines two types of effective compression algorithms that give more ability to compress image data. The proposed compression technique which coupled two image compression algorithms that put to use premium characteristics from each algorithm. The wavelet transform methods contribute effectively to finding suitable solutions to supply better compression ratios for images with high resolution. The complete series of compression includes repeated stages of encoding and decoding, in addition to the wavelet processing itself. This study will have carried out an advanced compression technique that contain a coupled compression algorithms relying on the preferred wavelets to this work from practical experiments they are, biorthogonal and Haar wavelet transform, the performance metrics for tested true HD color image will be studied. The challenge for image compression algorithms is to detect a best solution between a low compression ratio and good visual perception results. An essential measure of achieved image compression process is taken by compression ratio CR and the ratio of bit-per-pixel BPP. The CR and BPP metrics are important components in image compression techniques. Through the results of the image compression metrics in two stages, the best practical results were obtained when the compression ratio metric CR was equal to 2.3%, and this metric indicates that the compressed image can be stored using 2.3% of the original image data size. While the BPP which represent the bit number that used to store one pixel of true color image is equal to 0.575.

A Task-Driven Invertible Projection Matrix Learning Algorithm for Hyperspectral Compressed Sensing

The high complexity of the reconstruction algorithm is the main bottleneck of the hyperspectral image (HSI) compression technology based on compressed sensing. Compressed sensing technology is an important tool for retrieving the maximum number of HSI scenes on the ground. However, the complexity of the compressed sensing algorithm is limited by the energy and hardware of spaceborne equipment. Aiming at the high complexity of compressed sensing reconstruction algorithm and low reconstruction accuracy, an equivalent model of the invertible transformation is theoretically derived by us in the paper, which can convert the complex invertible projection training model into the coupled dictionary training model. Besides, aiming at the invertible projection training model, the most competitive task-driven invertible projection matrix learning algorithm (TIPML) is proposed. In TIPML, we don’t need to directly train the complex invertible projection model, but indirectly train the invertible projection model through the training of the coupled dictionary. In order to improve the accuracy of reconstructed data, in the paper, the singular value transformation is proposed. It has been verified that the concentration of the dictionary is increased and that the expressive ability of the dictionary has not been reduced by the transformation. Besides, two-loop iterative training is established to improve the accuracy of data reconstruction. Experiments show that, compared with the traditional compressed sensing algorithm, the compressed sensing algorithm based on TIPML has higher reconstruction accuracy, and the reconstruction time is shortened by more than a hundred times. It is foreseeable that the TIPML algorithm will have a huge application prospect in the field of HSI compression.

Design and implementation of power efficient image compressor for WSN systems

In the digital electronics era, video and image processing, storage, data transmitting, data streaming, data retrieval, video playback features increasing exponentially. These requirements data processing and storage improvement results to necessity of hybrid compression, efficient encoding and decoding, compression ratio techniques in demand for modern real time applications. For that spatial domine technology of compression is prefer to satisfy the computational constraint for real time gadgets. Discrete wavelet transformation (DWT) based Multi-Level Block Truncation Coding (MLBTC) methodology used for special domine. Discrete Wavelet Transform procedure is utilized to constant and motion images and implemented to all mean pixel estimation of the image. Loss type compression technology BTC is implemented for gray scale image processing. It designed that original image divided as square blocks with help of quantize for decrease the gray intensity images every portion of square box having equal standard deviation and Mean values. In this proposed methodology is analysis of BWT-MLBTC image compression technologies for both binary and color images. The methodology has been implemented in Xilinx ISE software, the simulation results shows that the proposed method consumes less hardware resources, delay generations and power utilizations compared to the state of art approaches.

A review of research on medical image confidentiality related technology coherent taxonomy, motivations, open challenges and recommendations

With the modernization of biomedical image equipment and image processing technology, the amount of medical image data increases rapidly. These medical images need to be transmitted over a public network between doctors or hospitals to provide telemedicine services and sometimes need to be uploaded to a telemedicine data center or health cloud due to limited local computing and storage resources. Medical images involve confidential and sensitive information of patients, and the confidentiality technology to protect patient privacy is becoming more and more important. These problems have been studied by many scholars, but these studies are largely limited and scattered. To the authors’ knowledge, there is no systematic literature review related to medical image confidentiality technology. To provide valuable insights into the technical environment and to support researchers, the available options and gaps in this research area must be understood. Therefore, in this study, the recent 5 years’ research results in the field of medical image security are reviewed to map the field of study into a coherent taxonomy. We use five major academic databases which are (1) Medline, (2) IEEE Xplore, (3) WoS, (4) Scopus, and (5) ScienceDirect, and every literature related to (1) medical images, and (2) encryption were searched with a focus in these databases. These databases contain literature about medical image confidentiality technology. According to the classification scheme, the final data set consists of 123 pieces of literature, and are divided into five categories. The first category, which also occupies the most proportion, focuses on medical image confidentiality algorithms, and most of them adopt chaotic mapping correlative technology The second category considers multiple security requirements while studying medical image confidentiality. The third category combines medical image encryption and image compression technologies. The fourth category focuses on the hardware related medical image confidentiality design. The final category is the medical image security systems design. We then identify the basic characteristics of this emerging field from the following aspects; the motivations of using medical image confidentiality technology, the challenges of medical image confidentiality technology, and the recommendations for further research and use of medical image confidentiality technologies. Finally, the quality evaluation criteria of the medical image security algorithm are summarized, including but not limited to the evaluation of security and the evaluation of speed and time complexity. The results of the reference evaluation show that most studies on medical image security algorithms lack sufficient safety evaluation. This was evident from less than 30% of the total articles that used all kinds of security evaluation methods.

A novel image compression technology based on vector quantisation and linear regression prediction

In the information age, a digital image is an important media for people’s daily interactions. Looking to maintain the quality of the restored image, how to maximise the compression of images has become a challenging topic. Vector quantisation (VQ) compression is an easy-operating image compression method that can compress images to 1/16th of the original size. Based on VQ compresses, a novel image compression method is proposed in this paper. The proposed scheme compresses the image depending on the result of linear regression prediction which can significantly increase the compression ratio.