Discrete Atomic Transform-Based Lossy Compression of Three-Channel Remote Sensing Images with Quality Control

Lossy compression of remote sensing data has found numerous applications. Several requirements are usually imposed on methods and algorithms to be used. A large compression ratio has to be provided, introduced distortions should not lead to sufficient reduction of classification accuracy, compression has to be realized quickly enough, etc. An additional requirement could be to provide privacy of compressed data. In this paper, we show that these requirements can be easily and effectively realized by compression based on discrete atomic transform (DAT). Three-channel remote sensing (RS) images that are part of multispectral data are used as examples. It is demonstrated that the quality of images compressed by DAT can be varied and controlled by setting maximal absolute deviation. This parameter also strictly relates to more traditional metrics as root mean square error (RMSE) and peak signal-to-noise ratio (PSNR) that can be controlled. It is also shown that there are several variants of DAT having different depths. Their performances are compared from different viewpoints, and the recommendations of transform depth are given. Effects of lossy compression on three-channel image classification using the maximum likelihood (ML) approach are studied. It is shown that the total probability of correct classification remains almost the same for a wide range of distortions introduced by lossy compression, although some variations of correct classification probabilities take place for particular classes depending on peculiarities of feature distributions. Experiments are carried out for multispectral Sentinel images of different complexities.

Kompresi Citra Medis dengan DWT dan Variable Length Code

Paper ini merancang sebuah skema kompresi citra medis menggunakan DWT dengan mother wavelet Coiflet dan Symlet. Proses thresholding dan kuantisasi menjadi kunci terjadinya lossy compression di skema ini, dan data outputnya akan dikodekan dengan pengkodean Huffman atau Arithmetic. Terdapat empat kombinasi codec berbeda yakni: Coiflet-Huffman, Coiflet-Arithmetic, Symlet-Huffman yang masing-masing akan dianalisa kinerja kompresinya berdasarkan PSNR dan rasio kompresi. Pengujian kompresi menggunakan 3 citra medis grayscale berdimensi 160x160 piksel. Hasil pengujian menunjukan codec yang mampu menghasilkan PSNR dan rate paling optimal adalah codec Symlet-Arithmetic dengan nilai threshold yang dianjurkan yakni kurang dari 12. Pemberian nilai threshold diatas 12 akan menyebabkan PSNR citra rekonstruksi berada dibawah standar nilai minimum PSNR citra digital sebesar 30 dB.

Efficient Coding in the Economics of Human Brain Connectomics

In systems neuroscience, most models posit that brain regions communicate information under constraints of efficiency. Yet, evidence for efficient communication in structural brain networks remains sparse. The principle of efficient coding proposes that the brain transmits maximal information in a metabolically economical or compressed form to improve future behavior. To determine how structural connectivity supports efficient coding, we develop a theory specifying minimum rates of message transmission between brain regions to achieve an expected fidelity, and we test five predictions from the theory based on random walk communication dynamics. In doing so, we introduce the metric of compression efficiency, which quantifies the trade-off between lossy compression and transmission fidelity in structural networks. In a large sample of youth (n = 1,042; age 8–23 years), we analyze structural networks derived from diffusion weighted imaging and metabolic expenditure operationalized using cerebral blood flow. We show that structural networks strike compression efficiency trade-offs consistent with theoretical predictions. We find that compression efficiency prioritizes fidelity with development, heightens when metabolic resources and myelination guide communication, explains advantages of hierarchical organization, links higher input fidelity to disproportionate areal expansion, and shows that hubs integrate information by lossy compression. Lastly, compression efficiency is predictive of behavior—beyond the conventional network efficiency metric—for cognitive domains including executive function, memory, complex reasoning, and social cognition. Our findings elucidate how macroscale connectivity supports efficient coding, and serve to foreground communication processes that utilize random walk dynamics constrained by network connectivity.

GENERAL TECHNOLOGY OF ENCRYPTION AND INTEGRATION OF DATA IN A PATTERN OF A PICTURE OF IMAGES THAT IS RESISTANT TO JPEG COMPRESSION

The object of the thesis is the use of steganographic methods for organizing a covert communication channel in a public channel, providing resistance to lossy compression. The aim of the thesis is to develop an algorithm for embedding data into bitmap images that is resistant to JPEG compression and attacks on the container. In this thesis, the features of the JPEG algorithm are investigated, steganographic methods of information protection are analyzed, and a steganographic algorithm is designed that is resistant to JPEG compression and attacks on the container. Additional security is provided by the polyalphabetic substitution cipher and user secret key used to encrypt the original message. The algorithm was developed using the Python 3 programming language, the NumPy, SciPy, MatPlotLib libraries and the Jupyter Lab package. The task was completed using standard mathematical and statistical methods and tools of the high-level programming language Python 3.

Enhancing Performance of Lossy Compression on Encrypted Gray Images through Heuristic Optimization of Bitplane Allocation

Nowadays, it remains a major challenge to efficiently compress encrypted images. In this paper, we propose a novel encryption-then-compression (ETC) scheme to enhance the performance of lossy compression on encrypted gray images through heuristic optimization of bitplane allocation. Specifically, in compressing an encrypted image, we take a bitplane as a basic compression unit and formulate the lossy compression task as an optimization problem that maximizes the peak signal-to-noise ratio (PSNR) subject to a given compression ratio. We then develop a heuristic strategy of bitplane allocation to approximately solve this optimization problem, which leverages the asymmetric characteristics of different bitplanes. In particular, an encrypted image is divided into four sub-images. Among them, one sub-image is reserved, while the most significant bitplanes (MSBs) of the other sub-images are selected successively, and so are the second, third, etc., MSBs until a given compression ratio is met. As there exist clear statistical correlations within a bitplane and between adjacent bitplanes, where bitplane denotes those belonging to the first three MSBs, we further use the low-density parity-check (LDPC) code to compress these bitplanes according to the ETC framework. In reconstructing the original image, we first deploy the joint LDPC decoding, decryption, and Markov random field (MRF) exploitation to recover the chosen bitplanes belonging to the first three MSBs in a lossless way, and then apply content-adaptive interpolation to further obtain missing bitplanes and thus discarded pixels, which is symmetric to the encrypted image compression process. Experimental simulation results show that the proposed scheme achieves desirable visual quality of reconstructed images and remarkably outperforms the state-of-the-art ETC methods, which indicates the feasibility and effectiveness of the proposed scheme.

A survey on GAN acceleration using memory compression techniques

Since its invention, generative adversarial networks (GANs) have shown outstanding results in many applications. GANs are powerful, yet resource-hungry deep learning models. The main difference between GANs and ordinary deep learning models is the nature of their output and training instability. For example, GANs output can be a whole image versus other models detecting objects or classifying images. Thus, the architecture and numeric precision of the network affect the quality and speed of the solution. Hence, accelerating GANs is pivotal. Data transfer is considered the main source of energy consumption, that is why memory compression is a very efficient technique to accelerate and optimize GANs. Two main types of memory compression exist: lossless and lossy ones. Lossless compression techniques are general among all models; thus, we will focus in this paper on lossy techniques. Lossy compression techniques are further classified into (a) pruning, (b) knowledge distillation, (c) low-rank factorization, (d) lowering numeric precision, and (e) encoding. In this paper, we survey lossy compression techniques for CNN-based GANs. Our findings showed the superiority of knowledge distillation over pruning alone and the gaps in the research field that needs to be explored like encoding and different combination of compression techniques.