Image Compression Scheme Research Articles

A Knowledge Base Driven Task-Oriented Image Semantic Communication Scheme

With the development of artificial intelligence and computer hardware, semantic communication has been attracting great interest. As an emerging communication paradigm, semantic communication can reduce the requirement for channel bandwidth by extracting semantic information. This is an effective method that can be applied to image acquisition of unmanned aerial vehicles, which can transmit high-data-volume images within the constraints of limited available bandwidth. However, the existing semantic communication schemes fail to adequately incorporate the guidance of task requirements into the semantic communication process and are difficult to adapt to the dynamic changes of tasks. A task-oriented image semantic communication scheme driven by knowledge base is proposed, aiming at achieving high compression ratio and high quality image reconstruction, and effectively solving the bandwidth limitation. This scheme segments the input image into several semantic information unit under the guidance of task requirements by Yolo-World and Segment Anything Model. The assigned bandwidth for each unit is according to the task relevance scores, which enables high-quality transmission of task-related information with lower communication overheads. An improved metric weighted learned perceptual image patch similarity (LPIPS) is proposed to evaluate the transmission accuracy of the novel scheme. Experimental results show that our scheme achieves a notable performance improvement on weighted LPIPS while the same compression ratio compared with traditional image compression schemes. Our scheme has a higher target capture ratio than traditional image compression schemes under the task of target detection.

Correction to: A remote sensing image encryption and compression scheme using novel hyperchaotic system and plaintext related random S-box

Correction to: A remote sensing image encryption and compression scheme using novel hyperchaotic system and plaintext related random S-box

A remote sensing image encryption and compression scheme using novel hyperchaotic system and plaintext related random S-box

A remote sensing image encryption and compression scheme using novel hyperchaotic system and plaintext related random S-box

Effect of an image compression scheme on optical camera communication

Optical camera communication (OCC) represents a subset of visible light communication with considerable potential applications in domains such as intelligent transportation systems. However, many related studies on OCC ignore the effect of image compression. Cameras typically compress captured image data to reduce the resources required to store the data. Taking Joint Photographic Experts Group (JPEG) and AV1 image file format (AVIF) compression as examples, the effect is studied based on a simplified OCC model. The simulation results indicate that image compression can achieve the effect of a low-pass filter. Image compression, especially AVIF compression, can effectively reduce the bit error ratio (BER) of the system. Compared with demodulating RAW images, the BER is reduced from 1.2×10−1 to 7.0×10−4 when the AVIF image compression ratio is approximately 140. In addition, image compression is one of the reasons for the different performance of the red, green, and blue channels.

DESIGN AND ANALYSIS ON IMAGE COMPRESSION USING NEURAL NETWORKS

Due to the explosion of video based information proliferating in the world due to the ubiquitous usage of video cameras the amount of video based information that is currently being generated around the world is huge. And due to security purposes it is becoming imperative that these video data needs to be stored in computer memory for an extended period of time for referrals by security agencies. Because of the advancement of imaging technologies that is being used nowadays it is possible to capture extremely detailed high definition images. But it is not physically possible to store all these high-definition images in computer memories for a long time because infrastructure providers will run out of memory. Image compression is a technology which assists us in this regard. Nowadays this technology has moved from image compression to video compression to compression of 3- dimensional videos which is now becoming more and more popular due to the ever increasing usage of Augmented Reality, Virtual Reality and Ec The quantity of image data produced in modern surveillance networks is rising exponentially year on year which necessitated development of novel schemes for reducing the sizes of the images captured by CCTV cameras while not compromising on the image quality increases when the images are decompressed. This paper proposed a novel Deep Neural Network based method of compressing images in which the image accuracy is not lost but the space it occupies in the memory storage of the computes is reduced greatly compared to other image compression schemes, this proposed scheme is best suited for usage in CCTVs and other networks using Internet of Things which record images and videos continuously.

A lossless compression and encryption scheme for sequence images based on 2D-CTCCM, MDFSM and STP

A lossless compression and encryption scheme for sequence images based on 2D-CTCCM, MDFSM and STP

Empirical Evaluation of Coding and Inter Pixel Redundancy in still Image Compression

The main aim of this research work is to compress grayscale images efficiently using prediction and intensity-based image compression algorithms. Image compression is useful for removing the duplication in an image to store and transmit the data in an efficient form. This research work analyzes four new schemes for gray scale lossy image compression. Among the four schemes considered, two compressive approaches are designed for Prediction Based Image Compression (PBIC) level implementation. Third approach is designed for Intensity Based Image Compression (IBIC). Finally, the previously designed PBIC and IBIC schemes lead to an Integrated Encoder. All the considered method performances are analyzed using the performance metrics. These results are compared with JPEG 2000 which is a extensively used benchmark compression encoder. The outcome of all the proposed methods is also compared with modern encoders.

Image Compression Scheme based on Optimized K-means Clustering and Higher-Level Decomposed DWT

Image processing is a vital research domain essential in day-to-day digital activities. Image compression reduces memory space, transmission bandwidth requirement, transmission time, and computational complexity. This article aims to construct and compare hybrid image compression schemes using DWT, PCA, and K-means clustering techniques. This research proposes an image compression scheme based on optimized K-means clustering and higher-level decomposed DWT (K-DWT). Also, we have developed the hybrid image compression schemes based on PCA and DWT (P-DWT), PCA, K-means, and DWT (P-K-DWT) and analyzed the performance. Initially, we implemented compression algorithms using K-means Clustering, PCA, and DWT. Further, using the python platform, K-DWT, P-DWT, and P-K-DWT compression models have been executed on the images of the kodak dataset. The research objective is to obtain good image quality and better compression algorithms. The image quality and compression efficiency are evaluated using Peak Signal to Noise Ratio (PSNR), Structural Similarity Index Measurement (SSIM), and Compression Ratio (CR). The K-DWT methods have achieved a higher compression ratio, i.e., 15.3870, compared with other methods. Also, the outcomes show that the K-DWT method has provided the required values of PSNR and SSIM.

QARV: Quantization-Aware ResNet VAE for Lossy Image Compression.

This paper addresses the problem of lossy image compression, a fundamental problem in image processing and information theory that is involved in many real-world applications. We start by reviewing the framework of variational autoencoders (VAEs), a powerful class of generative probabilistic models that has a deep connection to lossy compression. Based on VAEs, we develop a new scheme for lossy image compression, which we name quantization-aware ResNet VAE (QARV). Our method incorporates a hierarchical VAE architecture integrated with test-time quantization and quantization-aware training, without which efficient entropy coding would not be possible. In addition, we design the neural network architecture of QARV specifically for fast decoding and propose an adaptive normalization operation for variable-rate compression. Extensive experiments are conducted, and results show that QARV achieves variable-rate compression, high-speed decoding, and better rate-distortion performance than existing baseline methods.

Improved DWT and IDWT architectures for image compression

In the recent era, a rapid development in the field of image processing has been observed. One of the important applications in image processing is compression. Several wavelet transform based image compression techniques have already been introduced. In this paper, Discrete Wavelet Transform (DWT) and Inverse Discrete Wavelet Transform (IDWT) based improved image compression and decompression techniques have been proposed by incorporating a scaling factor. The DWT and IDWT algorithms are implemented using folded architecture. To reduce the usages of hardware resources, a multiplier is recursively used. Image compression and decompression schemes based on proposed DWT and IDWT architectures are tested using four different image databases. The proposed technique provides better results in terms of bits per pixel, compression ratio, mean square error, peak-signal-to-noise ratio, normalized correlation coefficient and structural similarity index. FPGA based synthesis has been performed using Xilinx Vivado Synthesis tool in terms of slice LUTs, slice registers, clock frequency, delay and power. The synthesis results show that proposed DWT and IDWT architectures are amenable for image compression and decompression applications.

An Empirical Selection of Wavelet for Near-Lossless Medical Image Compression.

Wavelets are defined as mathematical functions that segment the data into different frequency levels. We can easily capture the fine and coarse details of an image or signal referred to as a subband. And it also helps in subband thresholding to achieve good compression performance. In recent days in telemedicine services, the handling of medical images is prominently increasing and it leads to the demand for medical image compression. While compressing the medical images, we have to concentrate on the data that holds important information, and at the same time, it must retain the image quality. Near-Lossless compression plays an essential role to achieve a better compression ratio than lossy compression and provides better quality than lossless compression. In this paper, we analyzed the sub-banding of Discrete Wavelet Transform (DWT) using different types of wavelets and made an optimal selection of wavelets for subband thresholding to attain a good compression performance with an application to medical images. We used Set Partitioning In Hierarchical Trees (SPIHT) compression scheme to test the compression performance of different wavelets. The Peak Signal to Noise Ratio (PSNR), Bits Per Pixel (BPP), Compression Ratio, and percentage of number of zeros are used as metrics to assess the performance of all the selected wavelets. And to find out its efficiency in possessing the essential information of medical images, the subband of the selected wavelets is further utilized to devise the near-lossless compression scheme for medical images.

An image compression and encryption scheme for similarity retrieval

With the development of cloud computing, people usually outsource encrypted images for saving storage and protecting privacy. However, traditional image encryption methods not only hinder the availability of images such as similarity retrieval, but also degrade the compression performance. To address this issue, we propose a retrievable image compression and encryption method(RICE). RICE takes into account the contradiction of image compression, availability and security, then propose a cascaded information bottleneck model, which includes the compression information bottleneck and the security and availability information bottleneck. The former is converted into a rate distortion problem and its optimal solution is sought by a convolutional neural network(CNN)-based compression network which includes channel space attention module and discrete wavelet transform(DWT) module. To solve the later, we propose a feature partition method to find a retrieval subset that balances the contradiction between security and availability, and design a DNA-based deterministic encryption method for this subset to support ciphertext retrieval. The ciphertext of the retrieved subset is sent to the proposed similarity search fully connected network(SimFcNet) to improve the retrieval accuracy. The remaining subset is encrypted by Non-deterministic encryption to further improve security. In general, the method RICE we proposed supports similarity retrievable in compressed domain ciphertext, and can achieve excellent performance. Experimental results show that our method is 36.56% higher than JPEG2000 at compression ratio of 60:1 in MS-SSIM, the accuracy of ciphertext retrieval can reach 0.828, and the security of ciphertext is close to that of traditional encryption methods.

An Efficient and Robust Underwater Image Compression Scheme Based on Autoencoder

Images occupy a prominent place in data because they are more visually appealing than sounds or texts. Acoustic waves are the only feasible alternative for long-distance underwater transmission since seawater has a high absorption impact on lighting and electromagnetic signals. However, underwater acoustic (UWA) communication technology can only provide relatively limited bandwidth (low effectiveness) and insufficiently stable links (low reliability). As a result, it is challenging to send high-resolution underwater images via the UWA channel. This article proposes an effective and robust underwater image compression scheme. First, an autoencoder is used for underwater image extreme bit rate compression. Then, a multistep training strategy is proposed to improve the robustness of the decoder by gradually learning channel degradation features. Finally, the autoencoder encodes images in two paths to achieve efficient compression and higher image quality when reconstructing images. The main path completes the compression task with a low bit rate and high robustness, while the branching path implements the image block retransmission compensation through the feedback signal. The experimental results demonstrate that the content of the reconstructed image can still be recognized under the conditions of a compression ratio of up to 1/768 and an average bit error rate of up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ \text{10}^{-1}$</tex-math></inline-formula> . The joint multistep training strategy and multidescription coding achieve a low bit rate and high robustness for underwater image communication, which has good application prospects.

A joint image compression and encryption scheme based on a novel coupled map lattice system and DNA operations

A joint image compression and encryption scheme based on a novel coupled map lattice system and DNA operations

Deep Image Compression Toward Machine Vision: A Unified Optimization Framework

There has been an increasing consensus that the machine vision is gradually replacing human vision in numerous tasks, with the demonstrated success of artificial intelligence. In this paper, we propose a deep image compression scheme towards machine vision, with the principle of “begin with the end in mind”. In particular, a unified optimization scheme for end-to-end image compression towards machine vision is proposed, accompanied with the dedicated variable bitrate coding and generalized rate-accuracy optimization. The presented framework, which jointly optimizes the compression and the machine vision networks, exploits the utmost potential of robust machine vision for compressed images. The variable bitrate modules towards machine vision, which effectively shrink the storage space for model parameters, are further developed to accommodate to the real-world applications. Moreover, an iterative algorithm is presented to achieve the optimality in terms of the generalized rate-accuracy towards machine vision. Experimental results show that the proposed framework achieves the state-of-the-art object detection performance among the end-to-end image compression methods: in the exploration of Video Coding for Machines (VCM) in Moving Picture Experts Group (MPEG), and the proposed framework achieves 31.69% and 23.96% BD-rate gains compared with the VCM official test datasets, the Open Images dataset and the TVD dataset respectively, which are generated using the state-of-the-art standard Versatile Video Coding (VVC) standard. The generalization capability of the proposed framework is also verified with instance segmentation under various scenarios.

A novel image compression and encryption scheme based on conservative chaotic system and DNA method

An image compression encryption scheme on the strength of a conservative chaotic map, compressed sensing (CS) and DNA method is proposed. Built on the hash algorithm, a novel algorithm for generating the initial state of the chaotic map is designed, which makes the algorithm resistant to chosen-plaintext and known-plaintext attacks. The pseudo-random sequences which are produced by the conservative chaotic map are devoted to constructing the measurement matrix of CS and control the encoding and operation mode of DNA, which improves the complexity of the cryptosystem. In addition, a novel Integrated Cyclic Crossover and Mutation algorithm (ICCM) based on DNA method is proposed. ICCM simultaneously completes the scrambling and diffusion of images based on the loop structure, which greatly enhances the security of the algorithm. Experimental results and a number of security analyses demonstrate that the scheme has excellent performance and robustness, and has good resistance to various attacks.

Optical multi-image encryption scheme with chaotic apertured quaternion fractional Mellin transform

To enhance the encryption quality and the transmission efficiency, an optical compression and encryption scheme for multiple images based on chaotic apertured quaternion fractional Mellin transform (QFrMT) is designed. The apertured optical systems and the quaternions with several imaginary components guarantee our designed scheme harder for the attackers to acquire valuable information. The QFrMT with the chaotic aperture is proposed to eliminate potential insecurity resulting from the known-plaintext attack and the phase-retrieval attack. The quaternion signal containing the main information of the plaintext images is converted into the chaotic apertured QFrMT domain, and then the resulting amplitude is encrypted with the chaotic mask constructed by the truncated phase in the fractional Fourier plane for nonlinear processing and information integrity. The chaos-based non-conventional diffusion is applied to further enhance the robustness against attacks. Extensive experiments results verify the security and efficiency of the presented optical multi-image encryption scheme.

HWCD: A hybrid approach for image compression using wavelet, encryption using confusion, and decryption using diffusion scheme

Abstract Image data play important role in various real-time online and offline applications. Biomedical field has adopted the imaging system to detect, diagnose, and prevent several types of diseases and abnormalities. The biomedical imaging data contain huge information which requires huge storage space. Moreover, currently telemedicine and IoT based remote health monitoring systems are widely developed where data is transmitted from one place to another. Transmission of this type of huge data consumes more bandwidth. Along with this, during this transmission, the attackers can attack the communication channel and obtain the important and secret information. Hence, biomedical image compression and encryption are considered the solution to deal with these issues. Several techniques have been presented but achieving desired performance for combined module is a challenging task. Hence, in this work, a novel combined approach for image compression and encryption is developed. First, image compression scheme using wavelet transform is presented and later a cryptography scheme is presented using confusion and diffusion schemes. The outcome of the proposed approach is compared with various existing techniques. The experimental analysis shows that the proposed approach achieves better performance in terms of autocorrelation, histogram, information entropy, PSNR, MSE, and SSIM.

Information security scheme using deep learning-assisted single-pixel imaging and orthogonal coding.

Providing secure and efficient transmission for multiple optical images has been an important issue in the field of information security. Here we present a hybrid image compression, encryption and reconstruction scheme based on deep learning-assisted single-pixel imaging (SPI) and orthogonal coding. In the optical SPI-based encryption, two-dimensional images are encrypted into one-dimensional bucket signals, which will be further compressed by a binarization operation. By overlaying orthogonal coding on the compressed signals, we obtain the ciphertext that allows multiple users to access with the same privileges. The ciphertext can be decoded back to the binarized bucket signals with the help of orthogonal keys. To enhance reconstruction efficiency and quality, a deep learning framework based on DenseNet is employed to retrieve the original optical images. Numerical and experimental results have been presented to verify the feasibility and effectiveness of the proposed scheme.

Focal Stack Image Compression Based on Basis-Quadtree Representation

In this paper, we propose an efficient compression scheme for focal stack images (FoSIs) based on a new basis-quadtree representation. In the new basis-quadtree representation, FoSIs are initially reorganized as co-located block groups in the depth dimension. In each group, selective basis blocks and adaptive quadtree partition are optimized to predict the focused or defocused co-located blocks by intra-group approximation. By solving a joint optimization problem, FoSIs can be sparsely represented by the optimal basis blocks, corresponding quadtree partition and approximation parameters, which will be compressed separately. Then, these basis blocks are stitched into several new frames (basis frames) according to their original locations and partition modes. Basis frames are compressed by our designed encoder, where the intra-group approximation is embedded into the high efficiency video coding (HEVC) encoder. Thus, the redundancies of basis blocks can be further eliminated. Finally, the approximation parameters are refined to suppress the amplified errors caused by introduced compression blur after basis frame coding. The refined parameters are compressed losslessly and multiplexed with the bitstream of the basis frames to ensure the reconstruction quality of FoSIs. Experiments on 12 test sequences demonstrate that the proposed scheme can obtain higher coding performance than the state-of-the-art comparison schemes. Specifically, the proposed scheme achieves up to 5.23 dB PSNR gains and 71.59% bitrate savings over the HEVC baseline scheme on sequences I03 and I05, respectively.