Compression Scheme Research Articles

RGB-D Data Compression via Bi-Directional Cross-Modal Prior Transfer and Enhanced Entropy Modeling

RGB-D data, being homogeneous cross-modal data, demonstrates significant correlations among data elements. However, current research focuses only on a unidirectional pattern of cross-modal contextual information, neglecting the exploration of bidirectional relationships in the compression field. Thus, we propose a joint RGB-D compression scheme, which is combined with Bi-directional Cross-modal Prior Transfer (Bi-CPT) modules and a Bi-directional Cross-modal Enhanced Entropy (Bi-CEE) model. The Bi-CPT module is designed for compact representations of cross-modal features, effectively eliminating spatial and modality redundancies at different granularity levels. In contrast to the traditional entropy models, our proposed Bi-CEE model not only achieves spatial-channel contextual adaptation through partitioning RGB and depth features but also incorporates information from other modalities as prior to enhance the accuracy of probability estimation for latent variables. Furthermore, this model enables parallel multi-stage processing to accelerate coding. Experimental results demonstrate the superiority of our proposed framework over the current compression scheme, outperforming both rate-distortion performance and downstream tasks, including surface reconstruction and semantic segmentation. The source code will be available at https://github.com/xyy7/Learning-based-RGB-D-Image-Compression .

Reduction of arrival time jitter or energy spread with arclike variable bunch compressors

Synchronizing free-electron laser pulses for time-resolved experiments is necessary as an unsynchronized system reduces the effective repetition rate of the experiment. Additionally, free-electron laser longitudinal coherence and spectral brightness are limited by electron beam energy spread. In this paper, a variable bunch compressor design and compression schemes were developed to: reduce klystron-induced arrival time jitter by 85% while preserving peak current and transverse emittance and to minimize electron beam correlated energy spread for potential self-seeding or HB-SASE modes. Published by the American Physical Society 2024

Image reconstruction from compressed measurements for ultrasound NDT

In ultrasound NDT, Delay-and-Sum schemes are commonly used to reconstruct images from the measurement data. For single channel pulse-echo measurements, this is called Synthetic Aperture Focusing Technique (SAFT). In a multi-channel setup, SAFT is extended to the Total Focusing Method (TFM), where the focused image is reconstructed from measurements of all transmit-receive combinations, called Full Matrix Capture (FMC). In previous work, we showed that both SAFT and TFM can be cast as a sparse recovery problem that enables enhancing the Delay-and-Sum scheme to a physically motivated forward model that leads to improved image quality. The reconstruction is performed using l1 minimization. Further, this also allows to perform the reconstruction from compressed/subsampled measurements following compressed sensing theory. This subsampling was achieved by only measuring a subset of the frequency coefficients of the signal. In both the single channel and the multi-channel setup the amount of measurement data is thereby significantly reduced. Additionally, for the TFM, we added a spatial subsampling by only considering a subset of transmit and receive pairs, further reducing the measurement data and at the same time also reducing the measurement time. In our previous work, the frequency and spatial dimensions were considered separately for simplicity, using the same compression strategy for all spatial measurements. In this work we consider joint frequency/spatial compression schemes. We show that a joint multidimensional compression strategy where different Fourier subsets are considered for each channel pair leads to a superior reconstruction performance when the compression rate is fixed. Analysis based on an analytical model for a single defect and a real-world example with multiple defects shows that the approach works in practice.

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.

Lossless Recompression of Vector Quantization Index Table for Texture Images Based on Adaptive Huffman Coding Through Multi-Type Processing

With the development of the information age, all walks of life are inseparable from the internet. Every day, huge amounts of data are transmitted and stored on the internet. Therefore, to improve transmission efficiency and reduce storage occupancy, compression technology is becoming increasingly important. Based on different application scenarios, it is divided into lossless data compression and lossy data compression, which allows a certain degree of compression. Vector quantization (VQ) is a widely used lossy compression technology. Building upon VQ compression technology, we propose a lossless compression scheme for the VQ index table. In other words, our work aims to recompress VQ compression technology and restore it to the VQ compression carrier without loss. It is worth noting that our method specifically targets texture images. By leveraging the spatial symmetry inherent in these images, our approach generates high-frequency symbols through difference calculations, which facilitates the use of adaptive Huffman coding for efficient compression. Experimental results show that our scheme has better compression performance than other schemes.

Coherent high-harmonic generation with laser-plasma beams

Active energy compression scheme is presently being investigated for future laser-plasma accelerators. This method enables generating laser-plasma accelerator electron beams with a small, ∼10−5, relative slice energy spread. When modulated by a laser pulse, such beams can produce coherent radiation at very high, ∼100th harmonics of the modulation laser wavelength, which are hard to access by conventional techniques. The scheme has a potential of providing additional capabilities for future plasma-based facilities by generating stable, tunable, narrow-band radiation. Published by the American Physical Society 2024

Accelerating and Compressing Transformer-Based PLMs for Enhanced Comprehension of Computer Terminology

Pretrained language models (PLMs) have significantly advanced natural language processing (NLP), establishing the "pretraining + fine-tuning" paradigm as a cornerstone approach in the field. However, the vast size and computational demands of transformer-based PLMs present challenges, particularly regarding storage efficiency and processing speed. This paper addresses these limitations by proposing a novel lightweight PLM optimized for accurately understanding domain-specific computer terminology. Our method involves a pipeline parallelism algorithm designed to accelerate training. It is paired with an innovative mixed compression strategy that combines pruning and knowledge distillation to effectively reduce the model size while preserving its performance. The model is further fine-tuned using a dataset that mixes source and target languages to enhance its versatility. Comprehensive experimental evaluations demonstrate that the proposed approach successfully achieves a balance between model efficiency and performance, offering a scalable solution for NLP tasks involving specialized terminology.

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

RFCSC: Communication efficient reinforcement federated learning with dynamic client selection and adaptive gradient compression

In the field of public safety, high-quality data is often owned by governments, companies, and organizations, making it difficult to train effective models through centralized datasets. This paper leverages federated learning as a mechanism to address data privacy concerns. Within the federated learning framework, the data across different clients is typically Non-IID (non-Independently and Identically Distributed). Furthermore, The complexity of sensitive image recognition tasks in public safety, along with the large number of model parameters, can lead to communication congestion issues in federated learning. To solve these challenges, this paper proposes a Reinforcement Federated Client Selection and Gradient Compression Method(RFCSC). By integrating client data prototypes with accuracy metrics, we dynamically assess the contribution of each client in federated learning. Through an intelligent dynamic incentive mechanism based on reinforcement learning, high-quality client nodes are dynamically selected to participate in federated learning, achieving dynamic adaptive aggregation, reducing the influence of Non-IID data, reducing communication cost, enhancing model accuracy, and achieving a balance between quality and efficiency. To address the issue of high communication cost for parameter transmission, we propose an adaptive model compression strategy in reinforcement federated learning which make local clients find an appropriate compression rate. This approach not only reduces gradient communication overhead but also minimizes the impact of compression on model accuracy. The effectiveness of our proposed approach are corroborated through comprehensive experiments conducted on one private dataset and two public datasets.

Quantum data compression under localized features

In this paper, we first introduce the local quantum information processing task by compressing the density operator based on local quantum Bernoulli noises. Then, the local quantum compression theorem is given, that is, the local quantum entropy is the minimum achievable rate of local compression. Finally, we prove the theorem with the proof of the direct coding theorem and the inverse theorem. The direct coding theorem shows that a scheme with such a local compression rate exists, and that this local compression rate converges to the local quantum entropy. The inverse theorem shows that the compression scheme with the rate below the local entropy is unachievable. With the continuous development of quantum technology, local quantum data compression technology will have broad application prospects and development space.

Adaptive compressed learning boosts both efficiency and utility of differentially private federated learning

In the federated learning (FL) research field, current research is confronted with several pivotal challenges, e.g., data privacy, model utility and communication efficiency. Furthermore, these challenges are further amplified by statistical data heterogeneous in the FL system. Thus, a novel Communication-efficient and Utility-assured Gaussian differential privacy-based Personalized Federated Adaptive Compressed Learning method, called CUG-PFACL, is proposed. Specifically, an end-to-end local adaptive compressed learning strategy is designed, including three crucial modules, namely the measurement matrix, the personalized compressed data transformation and the local model. Especially, jointly training the measurement matrix module and the personalized compressed data transformation module can mitigate the inherent statistical heterogeneity while preserving all important characteristics of the compressed private data of each local client, and alleviate the additional heterogeneity induced by Gaussian differential privacy in each global communication round. Numerous experimental simulation and comparisons demonstrate that CUG-PFACL has three notable advantages: data privacy guarantee, enhanced personalized model utility and high-efficient communication.

Improving Cloud Database Performance Using Storage Technologies

Cloud databases have become indispensable for modern applications due to their scalability, flexibility, and cost-effectiveness. However, optimizing performance in cloud environments can be challenging due to factors such as network latency, data distribution, and resource contention. This paper explores various storage technologies and techniques that can significantly enhance cloud database performance. We delve into the characteristics of different storage types, including solid-state drives (SSDs), hard disk drives (HDDs), and object storage, and discuss their suitability for various workloads. Additionally, we examine caching mechanisms, data compression, and deduplication strategies that can optimize data access and reduce storage costs. Furthermore, we explore the impact of database architecture choices, such as distributed databases and inmemory databases, on performance. We also discuss the importance of effective query optimization and indexing techniques. By understanding and implementing these storage technologies and techniques, organizations can achieve substantial improvements in cloud database performance, leading to better user experiences and increased application efficiency

Modular-Based Compression Scheme for Address Data in the Blockchain System for IoV Applications

Modular-Based Compression Scheme for Address Data in the Blockchain System for IoV Applications

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. In this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

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

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution

We formally prove the equivalence between Assembly Theory (AT) and Shannon Entropy via a method based upon the principles of statistical compression that belongs to the LZ family of popular compression algorithms. Such popular lossless compression algorithms behind file formats such as ZIP and PNG have been shown to empirically reproduce the results that AT considers its cornerstone. The same results have also been reported before AT in successful application of other complexity measures in the areas covered by AT such as separating organic from non-organic molecules and in the context of the study of selection and evolution. We demonstrate that the assembly index is equivalent to the size of a minimal context-free grammar. The statistical compressibility of such a method is bounded by Shannon Entropy and other equivalent traditional LZ compression schemes, such as LZ77 and LZW. We also demonstrate that AT, and the algorithms supporting its pathway complexity, assembly index, and assembly number, define compression schemes and methods that are subsumed into algorithmic information theory. We conclude that the assembly index and the assembly number do not lead to an explanation or quantification of biases in generative (physical or biological) processes, including those brought about by (abiotic or biotic) selection and evolution, that could not have been arrived at using Shannon Entropy, or that have not been already reported before using classical information theory or algorithmic complexity.

Efficient genetic code expansion without host genome modifications.

Supplementing translation with noncanonical amino acids (ncAAs) can yield protein sequences with new-to-nature functions but existing ncAA incorporation strategies suffer from low efficiency and context dependence. We uncover codon usage as a previously unrecognized contributor to efficient genetic code expansion using non-native codons. Relying only on conventional Escherichia coli strains with native ribosomes, we develop a plasmid-based codon compression strategy that minimizes context dependence and improves ncAA incorporation at quadruplet codons. We confirm that this strategy is compatible with all known genetic code expansion resources, which allowed us to identify 12 mutually orthogonal transfer RNA (tRNA)-synthetase pairs. Enabled by these findings, we evolved and optimized five tRNA-synthetase pairs to incorporate a broad repertoire of ncAAs at orthogonal quadruplet codons. Lastly, we extend these resources to an in vivo biosynthesis platform that can readily create >100 new-to-nature peptide macrocycles bearing up to three unique ncAAs. Our approach will accelerate innovations in multiplexed genetic code expansion and the discovery of chemically diverse biomolecules.

Compress and Compare: Interactively Evaluating Efficiency and Behavior Across ML Model Compression Experiments.

To deploy machine learning models on-device, practitioners use compression algorithms to shrink and speed up models while maintaining their high-quality output. A critical aspect of compression in practice is model comparison, including tracking many compression experiments, identifying subtle changes in model behavior, and negotiating complex accuracy-efficiency trade-offs. However, existing compression tools poorly support comparison, leading to tedious and, sometimes, incomplete analyses spread across disjoint tools. To support real-world comparative workflows, we develop an interactive visual system called COMPRESS AND COMPARE. Within a single interface, COMPRESS AND COMPARE surfaces promising compression strategies by visualizing provenance relationships between compressed models and reveals compression-induced behavior changes by comparing models' predictions, weights, and activations. We demonstrate how COMPRESS AND COMPARE supports common compression analysis tasks through two case studies, debugging failed compression on generative language models and identifying compression artifacts in image classification models. We further evaluate COMPRESS AND COMPARE in a user study with eight compression experts, illustrating its potential to provide structure to compression workflows, help practitioners build intuition about compression, and encourage thorough analysis of compression's effect on model behavior. Through these evaluations, we identify compression-specific challenges that future visual analytics tools should consider and COMPRESS AND COMPARE visualizations that may generalize to broader model comparison tasks..

Electrocardiogram Signal Compression Using Deep Convolutional Autoencoder with Constant Error and Flexible Compression Rate

ObjectivesElectrocardiogram (ECG) signals are beneficial for diagnosing cardiac diseases. The cardiac patients' life quality likely increases with continuous or long-period recording and monitoring of ECG signals, leading to better and early diagnosis of disease and heart attacks. However, continuous ECG recording necessitates high data rates and storage, which means high costs. Therefore, ECG compression is a handy concept that facilitates continuous monitoring of ECG signals. Deep neural networks open up new horizons for compression and also for ECG compression by providing high compression rates and quality. Although they bring constant compression ratios with better average quality, the compression quality of individual samples is not guaranteed, which may lead to misdiagnoses. This study aims to investigate the effect of compression quality on the diagnoses and to develop a deep neural network-based compression strategy that guarantees a quality-bound in return for varying compression ratios.Materials and methodsThe effect of the compression quality on the arrhythmia diagnoses is tested by comparing the performance of the deep learning-based ECG classifier on the original ECG recordings and the distorted recordings using a lossy compression algorithm with different compression error levels. Then, a compression error upper limit is calculated in terms of normalized percent root mean square difference (PRDN) error, which also coincides with the findings of the previous studies in the literature. Lastly, to enable deep learning in ECG compression, a single encoder-multi-decoder convolutional autoencoder architecture, and multiple quantization levels are proposed to guarantee a desired upper limit on the error rate.ResultsThe efficiency of the proposed method is demonstrated on a popular benchmark data set for ECG compression methods using a transfer learning approach. The PRDN error is fixed to various values, and the average compression rates are reported. An average of 13.019:1 compression is achieved for a 10% PRDN error rate, assessed as a fair quality threshold for reconstruction error. It has also been shown that the compression model has a runtime that can be run in real-time on wearable devices such as commercial smartwatches.ConclusionThis study proposes a deep learning-based ECG compression algorithm that guarantees a desired upper limit on the compression error. This model may facilitate an eHealth solution for continuous monitoring of ECG signals of individuals, especially cardiac patients.

Compression and Confusion Scheme with Perceptual Security for Smart Cities Applications

Compression and Confusion Scheme with Perceptual Security for Smart Cities Applications