Data Compression Research Articles

Lossy Compression of Single-channel Noisy Images by Modern Coders

Lossy compression of remote-sensing images is a typical stage in their processing chain. In design or selection of methods for lossy compression, it is commonly assumed that images are noise-free. Meanwhile, there are many practical situations where an image or a set of its components are noisy. This fact needs to be taken into account since noise presence leads to specific effects in lossy compressed data. The main effect is the possible existence of the optimal operation point (OOP) shown for JPEG, JPEG2000, some coders based on the discrete cosine transform (DCT), and the better portable graphics (BPG) encoder. However, the performance of such modern coders as AVIF and HEIF with application to noisy images has not been studied yet. In this paper, analysis is carried out for the case of additive white Gaussian noise. We demonstrate that OOP can exist for AVIF and HEIF and the performance characteristics in it are quite similar to those for the BPG encoder. OOP exists with a higher probability for images of simpler structure and/or high-intensity noise, and this takes place according to different metrics including visual quality ones. The problems of providing lossy compression by AVIF or HEIF are shown and an initial solution is proposed. Examples for test and real-life remote-sensing images are presented.

SHM data compression and reconstruction based on IGWO-OMP algorithm

The long-term operating structural health monitoring (SHM) system generates massive monitoring data, whose transmission and storage are challenging tasks. To address this issue, this study proposed an improved grey wolf optimizer-orthogonal matching pursuit (IGWO-OMP) algorithm for SHM data compression and reconstruction. The effectiveness of the proposed algorithm was validated using four SHM datasets including ultrasonic guided wave (UGW), acceleration, and audio signals. Firstly, the optimization results of IGWO were compared with those of other classical algorithms to verify its superiority in reconstruction accuracy. Secondly, the reconstruction accuracy under various compression factors was investigated and the optimal compression factor was determined. Finally, the relationship between reconstruction accuracy and signal sparsity as well as the performance of IGWO-OMP in dealing with noise-containing signals were discussed. The results demonstrate the generalizability and excellent noise robustness of IGWO-OMP in SHM data compression and reconstruction. Compared with other optimization algorithms, IGWO exhibits the best global optimal solution searching ability and obtains the reconstructed signal closest to the original one. Comprehensively considering the compressed signal length, reconstruction accuracy and computational efficiency, the optimal compression factor is suggested to be 0.2. In IGWO-OMP, the signal reconstruction accuracy is related to its sparsity, the variation of the CCD index for the reconstructed signal with relative sparsity follows an exponential growth relationship.

Synchronous Fluorescence Spectrometry (SFS) with Multivariate Calibration for the Determination of Polycyclic Aromatic Hydrocarbons (PAHs) and Their Oxygen Analogs in Printer Toner

Synchronous molecular fluorescence with multivariate calibration was investigated to assay seven polycyclic aromatic hydrocarbons (PAHs) and three oxygenated derivatives (O-PAHs) in printer toner. Great sensitivity and a good data compression capacity were achieved; therefore, a relatively small number of factors were used. Correlation coefficients above 0.95 for the calibration functions were obtained, and recoveries lie between 70 and 130% in analyzing synthetic samples (13 PCs). For the real samples assayed, recoveries between 81 and 125% were obtained when compared to the results obtained by gas chromatography – tandem mass spectrometry (GC-MS/MS). Despite a certain loss in accuracy when compared to chromatography, the proposed methodology is faster, simpler, and lower in cost. The multivariate tool proved to be an expeditious alternative for screening toner in relation to the presence and abundance of PAHs and derivatives.

Mutual information as a measure of mixing efficiency in viscous fluids

Because of the kinematic reversibility of the Stokes equation, fluid mixing at the microscale requires an interplay between advection and diffusion. Here, we introduce mutual information between particle positions before and after mixing as a measure of mixing efficiency. We demonstrate its application in a Couette flow in an annulus and show that nonuniform rotation sequences can lead to more efficient mixing. We also determine mutual information from Brownian dynamics simulations using data compression algorithms. Our results show that mutual information provides a universal and assumption-free measure of mixing efficiency in microscale flows. Published by the American Physical Society 2024

SunbYte: an autonomous pointing framework for low-cost robotic solar telescopes on high altitude balloons

The design and usability of a fully autonomous robotic control system (SunbYte - Sheffield University Balloon “lYfted” TElescope) for solar tracking and observational applications onboard high-altitude balloons are addressed here. The design is based on a six-step development plan balancing scientific objectives and practical engineering requirements. The high-altitude solar observational system includes low-cost components such as a Cassegrain-type telescope, stepper motors, harmonic drives, USB cameras and microprocessors. OpenCV installed from ROS (Robotic Operating System), python and C facilitated the collection, compression, and processing of housekeeping and scientific data. This processed data was then transmitted to the ground station through the launch vehicle’s telecommunication link. The SunbYte system allows the brightest spot in the sky, the sun, to be identified, and a telescope pointed towards it with high enough accuracy that a scientific camera can capture images. This paper gathers and presents the results from primarily two missions with the High-Altitude Student Platform (HASP, NASA Balloon Program office and LaSpace). Additionally, a discussion will be made comparing these with an earlier iteration flown with the German-Swedish “REXUS/BEXUS” programme coordinated by the European Space Agency. By capturing and analysing a series of tracking images with the location of the Sun at the calibrated centre, the system demonstrated the tracking capabilities on an unstable balloon during ascent. Housekeeping sensor data was collected to further analyse the thermal and mechanical performance. The low temperature increased friction in the drive train and reduced the responsiveness of the harmonic drive actuation system. This caused some issues which require further work in future missions, for example, with SunbYte 4 and its work when flying with the HEMERA ZPB (Zero Pressure Balloon) program.

Extended dynamic mode decomposition for model reduction in fluid dynamics simulations

High computational cost and storage/memory requirements of fluid dynamics simulations constrain their usefulness as a predictive tool. Reduced-order models (ROMs) provide a viable solution to this challenge by extracting the key underlying dynamics of a complex system directly from data. We investigate the efficacy and robustness of an extended dynamic mode decomposition (xDMD) algorithm in constructing ROMs of three-dimensional cardiovascular computations. Focusing on the ROMs' accuracy in representation and interpolation, we relate these metrics to the truncation rank of singular value decomposition, which underpins xDMD and other approaches to ROM construction. Our key innovation is to relate the truncation rank to the singular values of the original flow problem. This result establishes a priori guidelines for the xDMD deployment and its likely success as a means of data compression and reconstruction of the system's dynamics from dominant spatiotemporal structures present in the data.

P‐57: A Novel Compression Algorithm using Machine Learning for Mura Compensation of OLED Panel

In the modern display panel manufacturing industry, the Mura problem that occurs during initial shipment has a significant impact on improving image quality. The purpose of this paper is to effectively solve these Mura defects while reducing additional production costs. We propose an innovative method of storing and compressing the De‐Mura compensation data of the display panel in external memory. Two‐dimensional compensation data compression based on machine learning using surface fitting and vector quantization is presented as an effective response to the Mura problem. This approach, which achieves up to 8:1 compression ratio while minimizing image quality degradation through vector quantization, is expected to provide economic benefits to manufacturers. The paper also introduces a new surface prediction method that replaces the existing DC‐shift and uses residual vector quantization, which can reduce the implementation complexity of vector quantization. Through experimental results, this study demonstrates that the compensated data compression technique yields excellent results in post‐compression restoration performance.

Feasibility of Formulating Ecosystem Biogeochemical Models From Established Physical Rules

AbstractTo improve the predictive capability of ecosystem biogeochemical models (EBMs), we discuss the feasibility of formulating biogeochemical processes using physical rules that have underpinned the many successes in computational physics and chemistry. We argue that the currently popular empirically based approaches, such as multiplicative empirical response functions and the law of the minimum, will not lead to EBM formulations that can be continuously refined to incorporate improved mechanistic understanding and empirical observations of biogeochemical processes. Instead, we propose that EBM parameterizations, as a lossy data compression problem, can be better formulated using established physical rules widely used in computational physics and chemistry, and different biogeochemical processes can be more robustly integrated within a reactive‐transport framework. Through several examples, we demonstrate how mathematical representations derived from physical rules can improve understanding of relevant biogeochemical processes and enable more effective communication between modelers, observationalists, and experimentalists regarding essential questions, such as what measurements are needed to meaningfully inform models and how can models generate new process‐level hypotheses to test in empirical studies. Finally, while empirical models with more parameters are often less robust, physical rules‐based models can be more robust and show lower predictive equifinality, stemming from their enhanced consistency in representations of processes, interactions and spatial scaling.

47‐4: A Novel Demura Compensation Data Compression Algorithm based on JPEG‐LS

JPEG‐LS is a lossless/near‐lossless image compression algorithm based on context modeling, which has the advantages of easy implementation, low resource consumption and high compression rate. It is widely used in the compression field of continuous‐tone still images. However, single image compression has significant latency and high hardware resource consumption issues, as the JPEG‐LS algorithm requires pixel by pixel prediction and real‐time context updates during the compression process, which is not conducive to algorithm IP implementation. Based on Demura compensation data compression requirements, this article has made changes to the pixel prediction method of the JPEG‐LS algorithm and delayed the update of the context to solve the compression latency and resource consumption issues. After algorithm optimization (NJPEGLS), the linebuffer resource occupation was reduced by 8/9, the clock frequency reached above 140 MHz, and the comprehensive compression rate loss was within 4.5%, meeting the demand for Demura compensation data compression/decompression. In this paper, we also conducted statistics and analysis on the distribution of values, and found that the distribution of values was very regular, and we propose an adaptive value scheme (KNJPEG‐LS) to further simplify the hardware circuit.

Local Integrals of Motion in Dipole-Conserving Models with Hilbert Space Fragmentation.

Hilbert space fragmentation is an ergodicity-breaking phenomenon, in which the Hamiltonian shatters into exponentially many dynamically disconnected sectors. In many fragmented systems, these sectors can be labeled by statistically localized integrals of motion, which are nonlocal operators. We study the paradigmatic nearest-neighbor pair hopping model exhibiting the so-called strong fragmentation. We show that this model hosts local integrals of motion (LIOMs), which correspond to frozen density modes with long wavelengths. The latter modes become subdiffusive when longer-range pair hoppings are allowed. Finally, we make a connection with a tilted (Stark) chain. Contrary to the dipole-conserving effective models, the tilted chain is shown to support either a Hamiltonian or dipole moment as an LIOM. Numerical results are obtained from a numerical algorithm, in which finding LIOMs is reduced to a data compression problem.

An efficient deep learning-based workflow for real-time CO2 plume visualization in saline aquifer using distributed pressure and temperature measurements

Underground carbon dioxide (CO2) sequestration is widely accepted as a proven and established technology to respond to global warming from greenhouse gas emissions. It is crucial to monitor the CO2 plume effectively throughout the life cycle of a geologic CO2 sequestration project to ensure safety and storage efficacy. We propose a fast and efficient deep learning workflow for near real-time data assimilation, forecasting and visualization of CO2 plume evolution in saline aquifer and demonstrate its application at a field site.Our proposed workflow integrates field measurements, including distributed pressure and temperature at wells to visualize spatial and temporal migration of the CO2 plume in the subsurface. The deep learning framework has two key concepts that enhance the efficiency of the training and robustness of the CO2 plume prediction: first, instead of using multiple saturation images as output of the deep-learning model, a single Time of Flight (TOF) image are used to represent CO2 plume propagation; second, we use variational autoencoder-decoder (VAE) for high dimensional image data compression considering uncertainties in the predicted images. Time-of-Flight (TOF) is the travel time of a neural particle from the injection point, which is calculated along streamline based on the velocity field by considering reservoir heterogeneity and driving forces. The latent variables of VAE are estimated through a deep neural network model with inputs of distributed pressure and temperature measurements. Subsequently, the decoder part of the VAE expands the estimated latent variables to the original dimension of the TOF images. We demonstrate the efficacy of the proposed method by comparison with the more traditional pareto-based multi-objective Genetic Algorithm (MOGA) for the assimilation of the field measurements and forecasting of the CO2 plume migration.The power and utility of our proposed workflow are demonstrated by application to the Illinois Basin-Decatur Project (IBDP). The IBDP is a large scale 3-year CO2 storage test and is part of the Midwest Regional Carbon Sequestration Partnership (MRCSP). The field measurements include bottom-hole pressure and distributed temperature sensing (DTS) data at the injection well, and the distributed pressure measurements at several locations along the monitoring well. The dynamic model is a compositional model with 1.7 million cells. First, we identify the influential parameters using sensitivity analysis based on the pressure and temperature responses. Next, the sensitive parameters are sampled from a pre-specified range and a comprehensive training dataset is generated, including the pressure and temperature measurements and TOF images based on flow simulation results from a variety of geological model realizations. The trained neural network model can identify geological model realizations that capture the spatial and temporal migration of pressure and CO2 saturation based on Euclidean distance within the VAE latent space. For comparison with traditional history matching workflow, the selected sensitive parameters are also tuned using MOGA with the pressure and temperature measurements. A reasonable agreement is obtained for the predicted CO2 plume migration between two workflows. The proposed deep learning workflow shows significant speed-up compared to the traditional multi-objective optimization-based history matching workflow (5 h for training and seconds for prediction; compared to several days/weeks for the MOGA).The novelty of this work is the application of an efficient deep learning-based workflow to a large-scale CO2 storage test site for assimilating field measurements and predicting CO2 plume propagation in a near real-time and comparison with traditional history matching approach.

Virtual cylindrical PET for efficient DOI image reconstruction with sub-millimetre resolution

Objective. Image reconstruction in high resolution, narrow bore PET scanners with depth of interaction (DOI) capability presents a substantial computational challenge due to the very high sampling in detector and image space. The aim of this study is to evaluate the use of a virtual cylinder in reducing the number of lines of response (LOR) for DOI-based reconstruction in high resolution PET systems while maintaining uniform sub-millimetre spatial resolution. Approach. Virtual geometry was investigated using the awake animal mousePET as a high resolution test case. Using GEANT4 Application for Tomographic Emission (GATE), we simulated the physical scanner and three virtual cylinder implementations with detector size 0.74 mm, 0.47 mm and 0.36 mm (vPET1, vPET2 and vPET3, respectively). The virtual cylinder condenses physical LORs stemming from various crystal pairs and DOI combinations, and which intersect a single virtual detector pair, into a single virtual LOR. Quantitative comparisons of the point spread function (PSF) at various positions within the field of view (FOV) were compared for reconstructions based on the vPET implementations and the physical scanner. We also assessed the impact of the anisotropic PSFs by reconstructing images of a micro Derenzo phantom. Main results. All virtual cylinder implementations achieved LOR data compression of at least 50% for DOI PET reconstruction. PSF anisotropy in radial and tangential profiles was chiefly influenced by DOI resolution and only marginally by virtual detector size. Spatial degradation introduced by virtual cylinders was most prominent in the axial profile. All virtual cylinders achieved sub-millimetre volumetric resolution across the FOV when 6-bin DOI reconstructions (3.3 mm DOI resolution) were performed. Using vPET2 with 6 DOI bins yielded nearly identical reconstructions to the non-virtual case in the transaxial plane, with an LOR compression factor of 86%. Resolution modelling significantly reduced the effects of the asymmetric PSF arising from the non-cylindrical geometry of mousePET. Significance. Narrow bore and high resolution PET scanners require detectors with DOI capability, leading to computationally demanding reconstructions due to the large number of LORs. In this study, we show that DOI PET reconstruction with 50%–86% LOR compression is possible using virtual cylinders while maintaining sub-millimetre spatial resolution throughout the FOV. The methodology and analysis can be extended to other scanners with DOI capability intended for high resolution PET imaging.

Learning-based Property Estimation with Polynomials

The problem of estimating data properties using sampling frequency histograms has attracted extensive interest in the area of databases. The properties include the number of distinct values (NDV), entropy, and so on. In the field of databases, property estimation is fundamental to complex applications. For example, NDV estimation is the foundation of query optimization, and entropy estimation is the foundation of data compression. Among them, methods originating from statistics exhibit desirable theoretical guarantees but rely on specific assumptions about the distribution of data, resulting in poor performance in real-world applications. Learning-based methods, which use information from training data, are adaptable in the real world but often lack theoretical guarantees or explainability. In addition, a unified framework for estimating these frequency-based estimators with machine learning is lacking. Given the aforementioned challenges, it is natural to wonder if a unified framework with theoretical guarantees can be established for property estimation. The recent literature has presented theoretical studies that propose estimation frameworks based on polynomials. These studies also prove estimation errors with respect to the sample size. Motivated by the above polynomial estimation framework, we propose a learning-based estimation framework with polynomial approximation, which aims to learn the coefficients of the polynomial, providing theoretical guarantees to the learning framework. Through comprehensive experiments on both synthetic and real-world datasets for estimating various data properties like NDV, entropy, and power sum, our results show the superiority of our algorithms over previous estimators.

Improved ACOM pattern matching in 4D-STEM through adaptive sub-pixel peak detection and image reconstruction

The technique known as 4D-STEM has recently emerged as a powerful tool for the local characterization of crystalline structures in materials, such as cathode materials for Li-ion batteries or perovskite materials for photovoltaics. However, the use of new detectors optimized for electron diffraction patterns and other advanced techniques requires constant adaptation of methodologies to address the challenges associated with crystalline materials. In this study, we present a novel image-processing method to improve pattern matching in the determination of crystalline orientations and phases. Our approach uses sub-pixel adaptive image processing to register and reconstruct electron diffraction signals in large 4D-STEM datasets. By using adaptive prominence and linear filters, we can improve the quality of the diffraction pattern registration. The resulting data compression rate of 103 is well-suited for the era of big data and provides a significant enhancement in the performance of the entire ACOM data processing method. Our approach is evaluated using dedicated metrics, which demonstrate a high improvement in phase recognition. Several features are extracted from the registered data to map properties such as the spot count, and various virtual dark fields, which are used to enhance the handling of the results maps. Our results demonstrate that this data preparation method not only enhances the quality of the resulting image but also boosts the confidence level in the analysis of the outcomes related to determining crystal orientation and phase. Additionally, it mitigates the impact of user bias that may occur during the application of the method through the manipulation of parameters.

Hardware Compression Method for On-Chip and Interprocessor Networks with Wide Channels and Wormhole Flow Control Policy

Increasing the number of processing cores is currently a common way to boost processor performance. However, the load on the memory subsystem consequently increases as the number of its agents grows. Hardware data compression is an unconventional approach to improving memory subsystem performance by reducing, firstly, the main memory access rate by increasing the cache capacity and, secondly, data traffic by packing the data more densely. The paper describes the implementation of hardware data compression in the on-chip network and interprocessor links of a configuration with wide data transmission channels and a wormhole flow control policy. The existing solutions cannot be applied to such configurations because they are essentially based on using narrow data channels and flow control policies implying uninterrupted packet transmission, which is not maintained with the wormhole flow control. The method proposed in this paper enables the use of hardware compression in the aforementioned configuration by moving data compression and decompression from networks to the connected devices, as well as by using a number of optimizations to hide the data processing delays. Optimizations of some specific cases, such as the transmission of large data packets with several cache lines or the transmission of zero data, are considered. Special attention is given to data transmission via interprocessor links, where, due to their lower bandwidth compared to the on-chip network, data compression can be the most beneficial. The increase in memory subsystem bandwidth from using hardware data compression was confirmed in the experiments showing the relative IPC increase in SPEC CPU2017 benchmarks up to 14 percent.

Meta-Meshing and Triangulating Lattice Structures at a Large Scale

Lattice structures have been widely used in applications due to their superior mechanical properties. To fabricate such structures, a geometric processing step called triangulation is often employed to transform them into the STL format before sending them to 3D printers. Because lattice structures tend to have high geometric complexity, this step usually generates a large amount of triangles, a memory and compute-intensive task. This problem manifests itself clearly through large-scale lattice structures that have millions or billions of struts. To address this problem, this paper proposes to transform a lattice structure into an intermediate model called meta-mesh before undergoing real triangulation. Compared to triangular meshes, meta-meshes are very lightweight and much less compute-demanding. The meta-mesh can also work as a base mesh reusable for conveniently and efficiently triangulating lattice structures with arbitrary resolutions. A CPU+GPU asynchronous meta-meshing pipeline has been developed to efficiently generate meta-meshes from lattice structures. It shifts from the thread-centric GPU algorithm design paradigm commonly used in CAD to the recent warp-centric design paradigm to achieve high performance. This is achieved by a new data compression method, a GPU cache-aware data structure, and a workload-balanced scheduling method that can significantly reduce memory divergence and branch divergence. Experimenting with various billion-scale lattice structures, the proposed method is seen to be two orders of magnitude faster than previously achievable.

Compression algorithm for colored de Bruijn graphs

A colored de Bruijn graph (also called a set of k-mer sets), is a set of k-mers with every k-mer assigned a set of colors. Colored de Bruijn graphs are used in a variety of applications, including variant calling, genome assembly, and database search. However, their size has posed a scalability challenge to algorithm developers and users. There have been numerous indexing data structures proposed that allow to store the graph compactly while supporting fast query operations. However, disk compression algorithms, which do not need to support queries on the compressed data and can thus be more space-efficient, have received little attention. The dearth of specialized compression tools has been a detriment to tool developers, tool users, and reproducibility efforts. In this paper, we develop a new tool that compresses colored de Bruijn graphs to disk, building on previous ideas for compression of k-mer sets and indexing colored de Bruijn graphs. We test our tool, called ESS-color, on various datasets, including both sequencing data and whole genomes. ESS-color achieves better compression than all evaluated tools and all datasets, with no other tool able to consistently achieve less than 44% space overhead. The software is available at http://github.com/medvedevgroup/ESSColor.

Enhancing data sparsity in spectral signals using wavelet decomposition for improved compression and storage efficiency

Wavelet decomposition (WD) is integrated into the Compressive Sensing (CS) model to enhance data sparsity. This approach aims to ensure efficiency and quality in the received data after compression and reconstruction processes. The proposed WD-CS model is developed for reflected spectra signals from Fiber Bragg Gratings-based extensometers, which were subjected to induced deflections simulating the underground soil movement. WD decomposes the input signal before compressive measurement, followed by transferring and storing the compressed data in the cloud. The spectral data were reconstructed using Orthogonal Matching Pursuit (OMP) followed by wavelet reconstruction. The impact of wavelet decomposition on the quality of compression and reconstruction is assessed and compared against that of the standard CS model. The findings indicate that the WD-CS model can improve data sparsity by a factor of three and compressibility by a factor of ten without degenerating the reconstructed data quality. The error in the Bragg wavelength shift of the reconstructed spectra is minimal extracted using Pseudo-high Resolution Interrogation (PHRI) method. The proposed WD-CS model is useful in improving data compression for FBG spectra as well as storage efficiency, which make it potentially applicable in FBG-based sensor networks for long-term structural health monitoring applications.

Fast computational approach with prior dimension reduction for three-dimensional chemical component analysis using CT data of spectral imaging.

Spectral image (SI) measurement techniques, such as X-ray absorption fine structure (XAFS) imaging and scanning transmission electron microscopy (STEM) with energy-dispersive X-ray spectroscopy (EDS) or electron energy loss spectroscopy (EELS), are useful for identifying chemical structures in composite materials. Machine-learning techniques have been developed for automatic analysis of SI data, and their usefulness has been proven. Recently, an extended measurement technique combining SI with a computed tomography (CT) technique (CT-SI), such as CT-XAFS and STEM-EDS/EELS tomography, was developed to identify the three-dimensional (3D) structures of chemical components. CT-SI analysis can be conducted by combining CT reconstruction algorithms and chemical component analysis based on machine learning techniques. However, this analysis incurs high computational costs owing to the size of the CT-SI datasets. To address this problem, this study proposed a fast computational approach for 3D chemical component analysis in an unsupervised learning setting. The primary idea for reducing the computational cost involved compressing the CT-SI data prior to CT computation and performing 3D reconstruction and chemical component analysis on the compressed data. The proposed approach significantly reduced the computational cost without losing information about the 3D structure and chemical components. We experimentally evaluated the proposed approach using synthetic and real CT-XAFS data, which demonstrated that our approach achieved a significantly faster computational speed than the conventional approach while maintaining analysis performance. As the proposed procedure can be implemented with any CT algorithm, it is expected to accelerate 3D analyses with sparse regularized CT algorithms in noisy and sparse CT-SI datasets.

A Compression and Encryption Based Heart Disease Diagnosis with Deep Learning through ECG Signals

Electrocardiogram (ECG) monitoring models are commonly employed for diagnosing heart diseases. Since ECG signals are normally acquired for a longer time duration with high resolution, there is a need to compress the ECG signals for transmission and storage. So, a novel compression technique is essential in transmitting the signals to the telemedicine center to monitor and analyses the data. In addition, the protection of ECG signals poses a challenging issue, which encryption techniques can resolve. The existing Encryption-Then-Compression (ETC) models for multimedia data fail to properly maintain the trade- off between compression performance and signal quality. In this view, this study presents a new ETC with a diagnosis model for ECG data, called the ETC-ECG model. The proposed model involves four major processes, namely, pre-processing, encryption, compression, and classification. Once the ECG data of the patient are gathered, Discrete Wavelet Transform (DWT) with a Thresholding mechanism is used for noise removal. In addition, the chaotic map-based encryption technique is applied to encrypt the data. Moreover, the Burrows-Wheeler Transform (BWT) approach is employed for the compression of the encrypted data. Finally, a Deep Neural Network (DNN) is applied to the decrypted data to diagnose heart disease. The detailed experimental analysis takes place to ensure the effective performance of the presented model to assure data security, compression, and classification performance for ECG data