Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Data Compression”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6Linked to original sources

Analysis of ECG data, for data compression.

A number of papers on the subject of data reduction techniques applied to ECG Data have recently been published; however, the authors found that most of these articles did not consider quantization techniques, which can be effectively applied to ECG data without any complex parameter extraction procedures. In this paper the authors have looked at the effects of quantization on ECG data and techniques of reducing the amount of data needed to represent these signals. Basically, 3 data reduction techniques, linear prediction using differential pulse code modulation, spectral analysis and slope change detection are investigated and a relative assessment of their performance is presented. This analysis revealed that a slope change detection, as applied to prefiltered data, can be used to represent ECG data at a rate of 2 bits/sample, while maintaining the mean squared error and peak error below 1% and 5% respectively. This technique therefore gives an effective 3 to 1 reduction over the original sampled data, since it was found that the original data could be quantized to 6 bits without significant loss of waveform information.

Electrocardiography↗

Data compression in a textual medical application.

On-line storage of textual data can represent a significant expense even with today's lower storage costs. This paper presents a hybrid compression scheme designed for rapid decoding and retrieval in a medical data base application. Utilizing this method, a 60% reduction of the space required has been obtained.

Computers↗

Recursive versus sequential multiple error measures reduction: a curve simplification approach to ECG data compression.

Previous time domain compression methods have been tackled by sequential one point at a time sub-optimal selection strategies running in approximately O(N) or all points at a time optimal strategies running in approximately O(N3) temporal complexities. Yet basically, the selected dominant points (DPs) are locally only significant in these methods, which may lead to inaccurate reconstruction or even loss of clinical data. Alternatively, the recursive one point at a time selection strategy, through different variants of the Douglas-Peucker line simplification algorithm, computes globally significant DPs for an approximately O(N.log2(N)) temporal complexity. We illustrate that the recursive strategy performs numerically almost two times better than the sequential one. The piecewise linear approximation of the input ECG is formally expressed as a curve simplification problem, through reduction of the Hausdorff error measure. We also illustrate that reduction of two error measures performs better than reduction of one error measure. An additional compression option is proposed in the case of the recursive strategy through simplification of the sorted distances associated to the selected set of points. The outcome is a compression algorithm that yields compression ratios ranging from 8:1 to 22:1 for a perceptually good reconstruction quality and near linear execution time. The tests have been conducted on the MIT-BIH public ECG database. Results show that the proposed recursive algorithm is an excellent compromise on compression ratio - computational time - reconstruction quality.

Algorithms↗

Effects of JPEG2000 data compression on an automated system for detecting clustered microcalcifications in digital mammograms.

The functionalities of the JPEG2000 standard have led to its incorporation into digital imaging and communications in medicine (DICOM), which makes this compression method available for medical systems. In this study, we evaluated the compression of mammographic images with JPEG2000 (16 : 1, 20 : 1, 40 : 1, 60.4 : 1, 80: 1, and 106 : 1) for applications with a computer-aided detection (CAD) system for clusters of microcalcifications. Jackknife free-response receiver operating characteristic (JAFROC) analysis indicated that differences in the detection of clusters of microcalcifications were not statistically significant for uncompressed versus 16: 1 (T = -0.7780; p = 0.4370), 20 : 1 (T = 1.0361; p = 0.3007), and 40 : 1 (T = 1.6966; p = 0.0904); and statistically significant for uncompressed versus 60.4 : 1 (T = 5.8883; p < 0.008), 80 : 1 (T = 7.8414; p < 0.008), and 106 : 1 (T = 17.5034; p = < 0.008). Although there is a small difference in peak signal-to-noise ratio (PSNR) between compression ratios, the true-positive (TP) and false-positive (FP) rates, and the free-response receiver operating characteristic (FROC), figure of merit values considerably decreased from a 60 : 1 compression ratio. The performance of the CAD system is significantly reduced when using images compressed at ratios greater than 40 : 1 with JPEG2000 compared to uncompressed images. Mammographic images compressed up to 20 : 1 provide a percentage of correct detections by our CAD system similar to uncompressed images, regardless of the characteristics of the cluster. Further investigation is required to determine how JPEG2000 affects the detectability of clusters of microcalcifications as a function of their characteristics.

Artificial Intelligence↗

Image data compression in magnification hand radiographs.

A study was conducted on the use of an irreversible compression technique, Fourier quantization, to reduce the amount of digital data needed for an image. The effect of image compression was studied in radiographs obtained to diagnose subperiosteal bone resorption. Magnification radiographs of 44 hands were digitized to an array size of 4,096 X 4,096 X 12 bits. Selected subregions containing a single middle phalanx were compressed and reconstructed. A subset of the resultant 12-bit uncompressed and 8-, 7-, and 6-bit compressed images were read by four radiologists whose responses were analyzed with receiver operating characteristic (ROC) techniques. There were 81 images used in the ROC analysis, of which 48 were normal and 33 showed subperiosteal resorption. No statistically significant loss of diagnostic quality was detected for 8- or 7-bit compressed images, with average compression ratios of 16:1 and 28:1, respectively. Diagnostic quality was lost with 6-bit images, with an average compression ratio of 107:1.

Arthritis↗

Data compression techniques for CT image archiving.

Large digital files are inherent to computed tomography (CT) image data. The CT installations that routinely archive patient data are penalized computer time, technologist's time, tape, purchase, and file space. This paper introduces compression techniques that reduce the amount of tape needed to store image data and the amount of computer time to do so. The benefits delivered by this technique have also been applied to CT disk systems in which limited on-line memory requires compact file storage. Typical reductions of 40 to 50% of original file space are reported.

Computers↗

Amorphous silicon, flat-panel, x-ray detector versus storage phosphor-based computed radiography: contrast-detail phantom study at different tube voltages and detector entrance doses.

RATIONALE AND OBJECTIVES: Evaluation of the contrast-detail performance of an active-matrix flat-panel x-ray detector in comparison with a storage phosphor system with special regard to the potential of dose reduction. METHODS: A digital x-ray detector based on cesium iodide (CsI) and amorphous silicon (a-Si) technology was compared with a fifth-generation storage phosphor system. A lucite plate with 36 drilled holes of varying diameters and depths was used as contrast-detail phantom. At 45 kVp, 70 kVp, and 113 kVp, images at 8 different detector entrance doses ranging between 0.3 microGy and 40 microGy were obtained. On soft-copy displays, 3 masked observers evaluated the detectability of each aperture in each image according to a 5-point scale. The mean sum scores of corresponding images were compared. RESULTS: For all tube voltages and detector entrance doses, the images obtained with the CsI/a-Si detector resulted in better observer contrast-detail performance as compared with the images of the storage phosphor system. The CsI/a-Si system allowed a calculated dose reduction of 39% at 45 kVp, 68% at 70 kVp, and 81% at 113 kVp as compared with the storage phosphor system, without loss of contrast-detail detectability. CONCLUSIONS: Under the conditions of the chosen experimental design, the CsI/a-Si system provided a superior contrast-detail performance as compared with the storage phosphor system. The potential of dose reduction increased with rising tube voltage.

Cesium↗

Data compression of fetal Doppler ultrasound audio signals using zero-crossings analysis.

This paper outlines a method of reducing the data rate for transmitting fetal Doppler ultrasound audio signals. A specific application is cited where compression of the fetal Doppler signal is required to transmit information to cardiotocographs (CTGs) using radio telemetry. The method involves splitting the signal into amplitude and frequency components. The amplitude is represented by samples of the signal envelope whilst the frequency information is represented by the number of zero-crossings within fixed intervals (windows). With a careful choice of window size, it is shown that this method can be used to reproduce the signal with no audible difference when compared with the original waveform. A reduction in data rate of 15:1 is achieved.

Algorithms↗

Data compression methods for EEG.

Modem brain research experiments require the recording of large amounts of high-accuracy EEG data. Sampling frequency, bit resolution and number of channels are significantly larger than in routine clinical measurements. Because of this, the need of efficient signal compression has emerged. This paper presents a survey of available methods and explores some techniques, both lossy and lossless, for compressing EEG signals.

Algorithms↗

Data compression for diffraction patterns.

Efficient coding (lossless) and compression (lossy) of diffraction patterns is important in protein crystallography experiments because of storage and transmission limitations. The goal is to reduce the bit-rate significantly while keeping diffraction peak intensity distortion at an acceptable level. This paper presents an overview of coding and compression techniques more or less adapted to such problems. A large part of this study is dedicated to time-frequency-transform based compression algorithms and some of their extensions. Wavelet based software has been developed and tested. Results are compared with the discrete cosine transform (DCT) and other classical algorithms. These tools seem attractive and very promising for analyzing and compressing signals with singularities and transient phenomena such as diffraction peaks. Tests were performed on a standard protein crystallography data set coming from the CCD detector of D2AM beamline at the European Synchrotron Radiation Facility at Grenoble. These were compressed with DCT and wavelet-based algorithms. It appears that alterations of the result of the processing of restored images remain very weak for compression rates up to 10. These preliminary results indicate that the proposed wavelet method is a good standard technique for efficient compression of diffraction patterns.

Algorithms↗

Data compression by linear prediction for storage and transmission of EEG signals.

The EEG time series has been subjected to various formalisms of analysis to extract meaningful information regarding the underlying neural events. In this paper the linear prediction (LP) method has been used for analysis and presentation of spectral array data for the better visualisation of background EEG activity. It has also been used for signal generation, efficient data storage and transmission of EEG. The LP method is compared with the standard Fourier method of compressed spectral array (CSA) of the multichannel EEG data. The autocorrelation autoregressive (AR) technique is used for obtaining the LP coefficients with a model order of 15. While the Fourier method reduces the data only by half, the LP method just requires the storage of signal variance and LP coefficients. The signal generated using white Gaussian noise as the input to the LP filter has a high correlation coefficient of 0.97 with that of original signal, thus making LP as a useful tool for storage and transmission of EEG. The biological significance of Fourier method and the LP method in respect to the microstructure of neuronal events in the generation of EEG is discussed.

Algorithms↗

Data compression in digital angiography using the Fourier transform.

While digital techniques in radiology develop rapidly, problems arise with archival storage and communication of image data. This paper reports on experiments concerning data reduction of digital image sequences of the heart and the brain. The time-intensity curves corresponding to every picture element are subjected to the Fourier transform and reconstructed from a number of coefficients smaller than the original number of images. The reconstruction error is assessed by visual inspection and by determining the mean-square deviation of the original and the reconstructed curve. It is shown that compression factors between 5 and 10 may be achieved without loss of diagnostic information. It is furthermore demonstrated that storage of the images in the form of Fourier coefficients leads to advantages in fast retrieval, enhancement of morphology, and possibility of further quantitative analysis.

Cerebral Angiography↗

A data compression method for image time series.

Image time series for functional studies frequently vary relatively little from one time point to the next. We describe here a method of lossless file compression that calculates the change in signal intensity as a char (one byte), as opposed to a short or long integer (usually two or four bytes), thus resulting in a compressed file size just over half the size of the original (a 2:1 compression ratio). The calculations and format are exceedingly simple; the compression time is comparable to the time required for a file copy, and is thus transparent to most users. The approach works equally well on any integer-based scanning modality, such as PET, CT, or DSA. Our purpose in this communication is to advocate it as a potential standard, to promote free interchange of scan data.

Algorithms↗

Data compression applied to dynamic electrocardiography.

We have tested some techniques of ECG compression on the BIH/MIT Arrhythmias database. We have applied the following methods: (1) method of differences; (2) compression by prediction; (3) sample skipping methods; with the following kinds of errors: amplitude error, amplitude and delay error, area error. In the first and second method the average code length found after application of the Huffmann encoding has been found to be about 4 bits sample-1. For the third method the final compression ratio varies according to the allowed error; with a limited error threshold, however, we have reached an average compression a little lower than 1:5.

Ambulatory Care↗