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 865 records · Page 48Linked to original sources

Blind MPEG-2 video watermarking robust against geometric attacks: a set of approaches in DCT domain.

A set of robust MPEG-2 video watermarking techniques is proposed, focusing on commonly used typical geometric processing for bit-rate reduction, cropping, removal of any rows, arbitrary-ratio downscaling, and frame dropping. Both the embedding and the extraction of watermarks are done in the compressed domain, so the computational cost is low. Moreover, the watermark extraction is blind, i.e., no original unwatermarked MPEG-2 video is needed for watermark extraction. The presented technique is applicable not only to MPEG-2 video, but also to other DCT-based coding videos. Selected experimental results validate our techniques.

Algorithms↗

On the use of context-weighting in lossless bilevel image compression.

We present a context-weighting algorithm that adaptively weights in real-time three-context models based on their relative accuracy. It can automatically select the better model over different regions of an image, producing better probability estimates than using either one of these models exclusively. Combined with the previously proposed block arithmetic coder for image compression (BACIC), the overall performance is slightly better than JBIG for the eight CCITT business-type test images, outperforms JBIG by 13.8% on halftone images, and by 17.5% for compounded images containing both text and halftones. Furthermore, users no longer need to select models as in JBIG and BACIC to get the better performance.

Algorithms↗

FFC: a scalable FASTA compressor.

SUMMARY: FASTA is a widely used text-based format for storing nucleotide and protein sequences. The existing FASTA compressors usually focus on (slightly) improving the compression ratio, not on practical performance. We present FFC, a scalable FASTA compressor that achieves average compression speeds 4.7× and 11.4× higher than two high-performance compressors, zstd and NAF, respectively, across a benchmark set of seven single genomes. It also delivers average decompression speeds 3.5× and 2.7× higher than zstd and NAF, respectively. Although a chunk-based zstd variant with parallel decompression, pzstd, almost matches FFC speed, its compression ratio is on average by 23% worse than FFC's. For the experiment, a 14-core workstation and a RAM disk (to reduce the impact of I/O) were used. AVAILABILITY AND IMPLEMENTATION: FFC is freely available at github.com/kowallus/ffc and also as a Zenodo repository at 10.5281/zenodo.18892353, and the used datasets at 10.5281/zenodo.18873744.

Data Compression↗

Wireless image transmission using turbo codes and optimal unequal error protection.

A novel image transmission scheme is proposed for the communication of set partitioning in hierarchical trees image streams over wireless channels. The proposed scheme employs turbo codes and Reed-Solomon codes in order to deal effectively with burst errors. An algorithm for the optimal unequal error protection of the compressed bitstream is also proposed and applied in conjunction with an inherently more efficient technique for product code decoding. The resulting scheme is tested for the transmission of images over wireless channels. Experimental evaluation clearly demonstrates the superiority of the proposed transmission system in comparison to well-known robust coding schemes.

Algorithms↗

The effect of compression on clinical diagnosis of glaucoma based on non-analyzed confocal scanning laser ophthalmoscopy images.

BACKGROUND AND OBJECTIVE: To evaluate the effect of different image compression formats of non-analyzed Heidelberg Retina Tomography (HRT; Heidelberg Engineering, Heidelberg, Germany) images on the diagnosis of glaucoma by ophthalmologists. MATERIALS AND METHODS: Thirty-three topographic and reflectance images taken with the HRT representing different levels of disease were transformed using nine different compression formats. Three independent ophthalmologists, masked as to contour line and stereometric parameters, classified the original and compressed HRT images as normal, suspected glaucoma, or glaucoma, and Kappa agreement coefficients were calculated. RESULTS: The Tagged Image File Format had the largest file size and the Joint Photographic Experts Group (JPEG) 2000 format had the smallest size. The highest Kappa coefficient value was 1.00 for all ophthalmologists using the Tagged Image File Format. Kappa values for JPEG formats were all in the range of good to excellent agreement. Kappa values were lower for Portable Network Graphic and Graphics Interchange Format compression formats. CONCLUSION: Image compression with JPEG 2000 at a ratio of 20:1 provided sufficient quality for glaucoma analysis in conjunction with a relatively small image size format, and may prove to be attractive for HRT telemedicine applications. Further clinical studies validating the usefulness of interpreting non-analyzed HRT images are required.

Data Compression↗

[Application study of JPEG2000 image compression in nuclear medicine].

To study the usefulness of JPEG2000 compression for nuclear medicine (NM) image, normal and abnormal static images were compressed using a JPEG2000 plug-in. For lossless algorithm, the compressing ratio (CR) was calculated. For lossy algorithm, images were visually analyzed by NM physicians and ROC curves were generated. The area under ROC curve (AUC) was used as the index of image diagnostic quality. Paired sample t tests were performed to compare the AUCs. It was found that the lossless CR was (1.34+/-0.05) : 1. For lossy algorithm, the AUC decreased with the increase of CR. Comparison between the original and the compressed images revealed no significant difference for 10:1 CR but significant difference for bigger CRs. It was concluded that lossless compression has little usefulness for NM image because of very low CR. While lossy compression isused, the diagnostic quality of static NM images is preserved at CRs 50 : 1,40 : 1, 30 : 1,20 : 1 up to 10 : 1. For other types of NM image, CR should be increased or decreased according to their characteristics, especially the level of intrinsic statistical noise of NM image.

Algorithms↗

Efficient storage of urodynamic signals by computer: application of FAN adaptive sampling.

Digital storage of urodynamic signals such as detrusor pressure and flowrate at a sufficiently high sampling rate (10 samples per second) to allow subsequent analysis requires considerable computer memory. A procedure for compressing these data by deleting redundant samples (the fan method of adaptive sampling) was tested. The method allows a flexible adaptation to specific hardware and a compromise between storage requirements and accuracy. In this study the number of samples required for adequate reconstruction of the detrusor pressure signal could be varied from 80% to 4% of the original number of samples by varying the average difference between reconstructed and original signal from 0.01 to 2 cm H2O. Fast components of the measurements (for example cough peaks) which were lost if a lower sampling rate or averaging was used to obtain equally low storage requirements were unaffected by this compression technique.

Algorithms↗

Performance of Web-based image distribution: client-oriented measurements.

The aim of this study was to define a clinically suitable personal computer (PC) configuration for Web-based image distribution and to assess the influence of different hard- and software configurations on the performance. Through specially developed software the time-to-display (TTD) for various PC configurations was measured. Different processor speeds, random access memory (RAM), screen resolutions, graphic adapters, network speeds, operating systems and examination types (computed radiography, CT, MRI) were evaluated, providing more than half a million measurements. Processor speed was the most relevant factor for the TTD; doubling the speed halved the TTD. Under processor speeds of 350 MHz, TTD mostly remained above 5 s for 1 CR or 16 CT images. Here Windows NT with lossy compression were superior. Processor speeds of 350 MHz and over delivered TTD <5 s. In this case Windows 2000 and lossless compression were preferable. Screen resolutions above 1280 x 1024 pixels increased the TTD mainly for CR images. The RAM amount, network speed and graphic adapter did not have a significant influence. The minimum threshold for clinical routine is any standard off-the-shelf PC better than Pentium II 350 MHz, 128 MB RAM; hence, high-end PC hardware is not required.

Computers↗

Lossless compression of volumetric medical images with improved three-dimensional SPIHT algorithm.

This article presents a lossless compression of volumetric medical images with the improved three-dimensional (3-D) set partitioning in hierarchical tree (SPIHT) algorithm that searches on asymmetric trees. The tree structure links wavelet coefficients produced by 3-D reversible integer wavelet transforms. Experiments show that the lossless compression with the improved 3-D SPIHT gives improvement about 42% on average over two-dimensional techniques and is superior to those of prior results of 3-D techniques. In addition, we can easily apply different numbers of decomposition between the transaxial and axial dimensions, which is a desirable function when the coding unit of a group of slices is limited in size.

Adolescent↗

Optimal wavelets for biomedical signal compression.

Signal compression is gaining importance in biomedical engineering due to the potential applications in telemedicine. In this work, we propose a novel scheme of signal compression based on signal-dependent wavelets. To adapt the mother wavelet to the signal for the purpose of compression, it is necessary to define (1) a family of wavelets that depend on a set of parameters and (2) a quality criterion for wavelet selection (i.e., wavelet parameter optimization). We propose the use of an unconstrained parameterization of the wavelet for wavelet optimization. A natural performance criterion for compression is the minimization of the signal distortion rate given the desired compression rate. For coding the wavelet coefficients, we adopted the embedded zerotree wavelet coding algorithm, although any coding scheme may be used with the proposed wavelet optimization. As a representative example of application, the coding/encoding scheme was applied to surface electromyographic signals recorded from ten subjects. The distortion rate strongly depended on the mother wavelet (for example, for 50% compression rate, optimal wavelet, mean+/-SD, 5.46+/-1.01%; worst wavelet 12.76+/-2.73%). Thus, optimization significantly improved performance with respect to previous approaches based on classic wavelets. The algorithm can be applied to any signal type since the optimal wavelet is selected on a signal-by-signal basis. Examples of application to ECG and EEG signals are also reported.

Algorithms↗

Video compression for lossy packet networks with mode switching and a dual-frame buffer.

Video codecs that use motion compensation benefit greatly from the development of algorithms for near-optimal intra/inter mode switching within a rate-distortion framework. A separate development has involved the use of multiple-frame prediction, in which more than one past reference frame is available for motion estimation. In this paper, we show that using a dual-frame buffer (one short-term frame and one long-term frame available for prediction) together with intra/inter mode switching improves the compression performance of the coder. We improve the mode-switching algorithm with the use of half-pel motion vectors. In addition, we investigate the effect of feedback in making more informed and effective mode-switching decisions. Feedback information is used to limit drift errors due to packet losses by synchronizing the long-term frame buffers of both the encoder and the decoder.

Algorithms↗

A survey on palette reordering methods for improving the compression of color-indexed images.

Palette reordering is a well-known and very effective approach for improving the compression of color-indexed images. In this paper, we provide a survey of palette reordering methods, and we give experimental results comparing the ability of seven of them in improving the compression efficiency of JPEG-LS and lossless JPEG 2000. We concluded that the pairwise merging heuristic proposed by Memon et al. is the most effective, but also the most computationally demanding. Moreover, we found that the second most effective method is a modified version of Zeng's reordering technique, which was 3%-5% worse than pairwise merging, but much faster.

Algorithms↗

Optimal block boundary pre/postfiltering for wavelet-based image and video compression.

This paper presents a pre/postfiltering framework to reduce the reconstruction errors near block boundaries in wavelet-based image and video compression. Two algorithms are developed to obtain the optimal filter, based on boundary filter bank and polyphase structure, respectively. A low-complexity structure is employed to approximate the optimal solution. Performances of the proposed method in the removal of JPEG 2000 tiling artifact and the jittering artifact of three-dimensional wavelet video coding are reported. Comparisons with other methods demonstrate the advantages of our pre/postfiltering framework.

Algorithms↗

An RBF-based compression method for image-based relighting.

In image-based relighting, a pixel is associated with a number of sampled radiance values. This paper presents a two-level compression method. In the first level, the plenoptic property of a pixel is approximated by a spherical radial basis function (SRBF) network. That means that the spherical plenoptic function of each pixel is represented by a number of SRBF weights. In the second level, we apply a wavelet-based method to compress these SRBF weights. To reduce the visual artifact due to quantization noise, we develop a constrained method for estimating the SRBF weights. Our proposed approach is superior to JPEG, JPEG2000, and MPEG. Compared with the spherical harmonics approach, our approach has a lower complexity, while the visual quality is comparable. The real-time rendering method for our SRBF representation is also discussed.

Algorithms↗

High reliability outdoor sonar prototype based on efficient signal coding.

Many mobile robots and autonomous vehicles designed for outdoor operation have incorporated ultrasonic sensors in their navigation systems, whose function is mainly to avoid possible collisions with very close obstacles. The use of these systems in more precise tasks requires signal encoding and the incorporation of pulse compression techniques that have already been used with success in the design of high-performance indoor sonars. However, the transmission of ultrasonic encoded signals outdoors entails a new challenge because of the effects of atmospheric turbulence. This phenomenon causes random fluctuations in the phase and amplitude of traveling acoustic waves, a fact that can make the encoded signal completely unrecognizable by its matched receiver. Atmospheric turbulence is investigated in this work, with the aim of determining the conditions under which it is possible to assure the reliable outdoor operation of an ultrasonic pulse compression system. As a result of this analysis, a novel sonar prototype based on complementary sequences coding is developed and experimentally tested. This encoding scheme provides the system with very useful additional features, namely, high robustness to noise, multi-mode operation capability (simultaneous emissions with minimum cross talk interference), and the possibility of applying an efficient detection algorithm that notably decreases the hardware resource requirements.

Data Compression↗

A wavelet-based region of interest encoder for the compression of angiogram video sequences.

A new method for the compression of angiogram video sequences is presented. The method is based on the philosophy that diagnostically significant areas of the image should be allocated the greatest proportion of the total allocated bit budget. The approach uses a three-dimensional wavelet-coder based on the popular set partitioning in hierarchical trees algorithm. Incorporated into this framework are a region-of-interest (ROI) detection stage and a texture-modeling stage. The combined result is an approach that models the high-frequency wavelet coefficients for some diagnostically unimportant regions of the image in an extremely efficient manner. This allows additional bits to be used within the ROI to improve the quality of the diagnostically significant areas. Results are compared for a number of real data sets and evaluated by trained cardiologists.

Algorithms↗

Influence of different sources on the processing and biopharmaceutical properties of high-dose ibuprofen formulations.

It is known that depending on the manufacturing and synthetic processes, drugs may exist as different forms. As a result, physicochemical properties, compression characteristics, intrinsic dissolution and bioavailability may vary substantially. The purpose of this study was to investigate the effect of different sources of ibuprofen on the processing of tablets and on their properties. Another emphasis of this work was to rationalize one or several key characteristics of the raw material as directly related to wet granulation parameters and to the behavior of final tablets. Commercially available ibuprofen was obtained from different manufacturers and a preformulation program, including X-ray crystallography, differential scanning calorimetry, scanning electron microscopy, determination of particle size distribution and flowability, was performed to characterize the raw material. Granules were prepared with a planetary mixer and liquid requirements for the end point were obtained by monitoring power consumption. Tablets were manufactured on Stokes rotary and single punch instrumented presses. Data acquisition interfaces produced compression data for each formulation. Granules and final tablets were analyzed for hardness, dissolution profiles and content uniformity. Statistical evaluations using analysis of variance and multiple comparison procedures were performed on the results to determine the significance of the variability between independent parameters. The ibuprofen tested was found to be a unique polymorphic form with some differences in the external crystallinity. The particle size characteristics of the material also allowed a differentiation between sources and although there was no differences in dissolution patterns or content uniformity, particle size was found to account for 50% of the variability in tablet hardness. Two sources of ibuprofen with lower mean particle size showed significant variations in end point liquid requirements resulting in variable tablet crushing strength.

Biopharmaceutics↗

Medical image compression using 3-D Hartley transform.

In this paper, 3-D discrete Hartley transform is applied for the compression of two medical modalities, namely, magnetic resonance images and X-ray angiograms and the performance results are compared with those of 3-D discrete cosine and Fourier transforms using the parameters such as PSNR and bit rate. It is shown that the 3-D discrete Hartley transform is better than the other two transforms for magnetic resonance brain images whereas for the X-ray angiograms, the 3-D discrete cosine transform is found to be superior.

Algorithms↗