Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Compression Algorithms”

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 415 records · Page 23Linked to original sources
PubMed2004

Loading simulation of lumbar spine vertebrae during a compression test using the finite elements method and trabecular bone strength properties, determined by means of nanoindentations.

The mechanical strength properties of lumbar spine vertebrae are of great importance in a wide range of applications. Herein, through nanoindentations and appropriate evaluation of the corresponding results, trabecular bone struts stress-strain characteristics can be determined. In the frame of the present paper, an L2 fresh cadaveric vertebra, from which posterior elements were removed, was subjected to compression. With the aid of developed finite elements method based algorithms, the cortical shell and the cancellous core bulk elasticity moduli and stresses were determined, whereas the tested vertebra geometrical model used in these algorithms was considered as having a compound structure, consisting of the cancellous bone surrounded by the cortical shell. Moreover nanoindentations were conducted and an appropriate evaluation method of the obtained results was applied to extract stress-strain curves of individual lumbar spine vertebra trabecular bone struts. These data were used in the mathematical description of the vertebrae compression test. The vertebral cancellous bone structure was simulated by a beam elements network, possessing an equivalent porosity and different stiffnesses in vertical and horizontal direction. Thus, the measured course of the compression load versus the occurring specimen deformation was verified.

Algorithms↗
PubMed2006

A flexible structure for fully scalable motion-compensated 3-D DWT with emphasis on the impact of spatial scalability.

We investigate the implications of the conventional "t+2-D" motion-compensated (MC) three-dimensional (3-D) discrete wavelet/subband transform structure for spatial scalability and propose a novel flexible structure for fully scalable video compression. In this structure, any number of levels of "pretemporal" spatial wavelet decomposition are performed on the original full resolution frames, followed by MC temporal decomposition of the subbands within each spatial resolution level. Further levels of "posttemporal" spatial decomposition may be performed on the spatiotemporal subbands to provide additional levels of spatial scalability and energy compaction. This structure allows us to trade energy compaction against the potential for artifacts at reduced spatial resolutions. More importantly, the structure permits extensive study of the interaction between spatial aliasing, scalability and energy compaction. We show that where the motion model fails, the "t+2-D" structure inevitably produces misaligned spatial aliasing artifacts in reduced resolution sequences. These artifacts can be removed by using pretemporal spatial decomposition. On the other hand, we also show that the "t+2-D" structure necessarily maximizes compression efficiency. We propose different schemes to minimize the loss of compression efficiency associated with pretemporal spatial decomposition.

Algorithms↗
PubMed1997

A digital filterbank hearing aid. Improving a prescriptive fitting with subjective adjustments.

Two fitting algorithms for linear hearing aids were compared using a wearable digital hearing aid in a one-month blind field test: a prescriptive method (POGO II) and a new algorithm, LinEar. Both used seven bands for frequency shaping, and two channel compression limiting. When fitting LinEar, the subjects individually adjusted the frequency response according to specified criteria. LinEar used a lower compression threshold setting than prescribed by POGO II. Eight subjects tested the two algorithms in a one-months blind field test as well as in the laboratory. The individual LF- and HF-gain adjustments of the frequency response in LinEar showed rather large variations compared to the POGO II prescription. Measures of S/N for speech did not show any significant differences between LinEar and POGO II, while overall sound quality ratings in laboratory and field test showed that LinEar was rated significantly higher than POGO II.

Adult↗
PubMed2006

Perceptually lossless medical image coding.

A novel perceptually lossless coder is presented for the compression of medical images. Built on the JPEG 2000 coding framework, the heart of the proposed coder is a visual pruning function, embedded with an advanced human vision model to identify and to remove visually insignificant/irrelevant information. The proposed coder offers the advantages of simplicity and modularity with bit-stream compliance. Current results have shown superior compression ratio gains over that of its information lossless counterparts without any visible distortion. In addition, a case study consisting of 31 medical experts has shown that no perceivable difference of statistical significance exists between the original images and the images compressed by the proposed coder.

Algorithms↗
PubMed2006

Perceptual image hashing via feature points: performance evaluation and tradeoffs.

We propose an image hashing paradigm using visually significant feature points. The feature points should be largely invariant under perceptually insignificant distortions. To satisfy this, we propose an iterative feature detector to extract significant geometry preserving feature points. We apply probabilistic quantization on the derived features to introduce randomness, which, in turn, reduces vulnerability to adversarial attacks. The proposed hash algorithm withstands standard benchmark (e.g., Stirmark) attacks, including compression, geometric distortions of scaling and small-angle rotation, and common signal-processing operations. Content changing (malicious) manipulations of image data are also accurately detected. Detailed statistical analysis in the form of receiver operating characteristic (ROC) curves is presented and reveals the success of the proposed scheme in achieving perceptual robustness while avoiding misclassification.

Algorithms↗
PubMedDate not supplied

The utility and cost-effectiveness of D-dimer measurements in the diagnosis of deep vein thrombosis.

BACKGROUND AND OBJECTIVE: The potential utility of D-dimer measurements for the diagnosis of deep vein thrombosis became evident soon after the development of reliable commercial assays. The purpose of this review is to outline some critical aspects affecting cost-effectiveness of D-dimer measurements in the diagnosis of deep vein thrombosis (DVT). METHODS: The authors have been working in this field contributing original papers whose data have been used for this study. In addition, the material analyzed in this article includes papers published in the journals covered by the Science Citation Index and Medline. RESULTS: D-dimer levels are very sensitive to the process of fibrin formation/dissolution occurring with ongoing thrombosis. However, they may not be highly specific for venous thromboembolism as they are influenced by the presence of comorbid conditions potentially elevating plasma D-dimer (cancer, surgery, infectious diseases). In addition, commercially available ELISA assays, although quantitative and reproducible, cannot be used under emergency conditions because they are time-consuming and suited for batch-processing of plasma samples. Recently, new assays have been introduced which permit fast and quantitative D-dimer estimations in individual patients. We have evaluated the utility of two new rapid assays (LPIA D-dimer. Mitsubishi, and VIDAS D-DIMER, bio-Merieux) in combination with compression real-time-B-mode ultrasonography for the detection of deep vein thrombosis in asymptomatic patients following elective hip replacement and in patients with clinically suspected deep vein thrombosis. In both settings, we identified cut-off values with optimal sensitivity which allow exclusion of deep vein thrombosis in a considerable percentage of patients, with substantial sparing of economic resources. In fact, based on a cost-effectiveness analysis, a diagnostic algorithm combining D-dimers measurement and compression ultrasonography would result in cost-savings ranging from 5% to 55% in patients with high or low clinical pretest probability respectively. However, the specificity of D-dimer measurements for deep vein thrombosis was much higher in symptomatic than in asymptomatic patients. Choice of the cut-off value proved to be dependent on the method as well as on the patient populations studied. CONCLUSIONS: The cost-effectiveness of D-dimers measurement in the diagnosis of asymptomatic DVT remains questionable. Conversely, our data strongly support the utility of D-dimers determinations in the diagnosis of symptomatic DVT. In terms of sparing economic resources, the introduction in the clinical laboratory of the rapid quantitative assays would be highly convenient, because they avoid a source of bias in the interpretation of D-dimers results, are easy to perform and do not require dedicated personnel or instrumentation. Prospective management studies validating the utility of D-dimer measurement in the diagnosis of deep vein thrombosis are urgently needed.

Costs and Cost Analysis↗
PubMed1999

A comparison of wavelet and Joint Photographic Experts Group lossy compression methods applied to medical images.

This presentation focuses on the quantitative comparison of three lossy compression methods applied to a variety of 12-bit medical images. One Joint Photographic Exports Group (JPEG) and two wavelet algorithms were used on a population of 60 images. The medical images were obtained in Digital Imaging and Communications in Medicine (DICOM) file format and ranged in matrix size from 256 x 256 (magnetic resonance [MR]) to 2,560 x 2,048 (computed radiography [CR], digital radiography [DR], etc). The algorithms were applied to each image at multiple levels of compression such that comparable compressed file sizes were obtained at each level. Each compressed image was then decompressed and quantitative analysis was performed to compare each compressed-then-decompressed image with its corresponding original image. The statistical measures computed were sum of absolute differences, sum of squared differences, and peak signal-to-noise ratio (PSNR). Our results verify other research studies which show that wavelet compression yields better compression quality at constant compressed file sizes compared with JPEG. The DICOM standard does not yet include wavelet as a recognized lossy compression standard. For implementers and users to adopt wavelet technology as part of their image management and communication installations, there has to be significant differences in quality and compressibility compared with JPEG to justify expensive software licenses and the introduction of proprietary elements in the standard. Our study shows that different wavelet implementations vary in their capacity to differentiate themselves from the old, established lossy JPEG.

Algorithms↗
PubMed2006

An adaptive signal compression system with pre-specified reconstruction quality and compression rate.

Two essential properties of a signal compression method are the compression rate and the distance between the original signal and the reconstruction from the compressed signal. These two properties are used to assess the performance and quality of the method. In a recent work [B. Tümer, B. Demiröz, Lecture Notes in Computer Science-Computer and Information Sciences, volume 2869, chapter Signal Compression Using Growing Cell Structures: A Transformational Approach, Springer Verlag, 2003, pp. 952-959], an adaptive signal compression system (ACS) is presented which defines the performance of the system as a function of the system complexity, system sensitivity and data size. For a compression method, it is desirable to formulate the performance of the system as a function of the system complexity and sensitivity to optimize the performance of the system. It would be further desirable to express the reconstruction quality in terms of the same system parameters so as to know up front what compression rate to end up with for a specific reconstruction quality. In this work, we modify ACS such that the modified ACS (MACS) estimates the reconstruction quality for a given system complexity and sensitivity. Once this relation is identified it is possible to optimize either compression rate or reconstruction quality with respect to system sensitivity and system complexity while limiting the other one.

Algorithms↗
PubMed2006

The Gurnham equation in characterizing the compressibility of pharmaceutical materials.

Limitations of the Heckel equation in characterizing material compression behavior have been well reported. In this work, the Gurnham equation, which was first introduced in chemical engineering, is proposed as an alternate method of evaluating the compressibility of pharmaceutical powders. The Gurnham equation was adapted for tablet compression and the estimated slope parameter c was proposed to represent material compressibility. Data from the compression of four commonly used excipients (microcrystalline cellulose, corn starch, lactose monohydrate, and dibasic calcium phosphate dihydrate) and one drug (acetaminophen) were evaluated using the Gurnham equation. Using compression data at different peak pressures, linear relationships between porosity and lnPressure of the five materials were obtained. The determined parameter c expresses the compressibility of materials. The analysis of previous experimental data, including granulations, mixtures and co-processed materials also indicates that c might be a representative parameter for material compressibility.

Acetaminophen↗
PubMed1998

A structural model of the forced compression of the fingertip pulp.

The fingertip pulp modulates the force transmitted to the underlying musculoskeletal system during finger contact on external bodies. A model of the fingertip pulp is needed to represent the transmission of forces to the tendons, muscles, and bone during these contacts. In this study, a structural model of the in vivo human fingertip was developed that incorporates both the material inhomogeneity and geometry. Study objectives were to determine (1) if this fingertip model can predict the force-displacement and force contact area responses of the in vivo human fingertip during contact with a flat, rigid surface, and (2) if the stresses and strains predicted by this model are consistent with the tactile sensing functionality of the in vivo human fingertip. The in vivo fingertip pulp was modeled as an inflated, ellipsoidal membrane, containing an incompressible fluid, that is quasi-statically compressed against a flat, frictionless surface. The membrane was assigned properties of skin (Veronda and Westmann, 1970) and when inflated, possessed dimensions approximating those of a human fingertip. Finite deformation was allowed. The model was validated by the pulp force-displacement relationship obtained by Serina et al. (1997) and by measurements of the contact area when the fingertip was pressed against a rigid surface with contact forces between 0.25 and 7.0 N. Model predictions represent the experimental data sufficiently well, suggesting that geometry, inhomogeneous material structure, and initial skin tension appear to represent the nonlinear response of the in vivo human fingertip pulp under compression. The predicted response of the fingertip pulp is consistent with its functionality as a tactile sensor.

Algorithms↗
PubMed2006

Real-time processing and compression of DNA microarray images.

In this paper, we present a pipeline architecture specifically designed to process and compress DNA microarray images. Many of the pixilated image generation methods produce one row of the image at a time. This property is fully exploited by the proposed pipeline that takes in one row of the produced image at each clock pulse and performs the necessary image processing steps on it. This will remove the present need for sluggish software routines that are considered a major bottleneck in the microarray technology. Moreover, two different structures are proposed for compressing DNA microarray images. The proposed architecture is proved to be highly modular, scalable, and suited for a standard cell VLSI implementation.

Algorithms↗
PubMed2005

Optimal erasure protection for scalably compressed video streams with limited retransmission.

This paper shows how the priority encoding transmission (PET) framework may be leveraged to exploit both unequal error protection and limited retransmission for RD-optimized delivery of streaming media. Previous work on scalable media protection with PET has largely ignored the possibility of retransmission. Conversely, the PET framework has not been harnessed by the substantial body of previous work on RD optimized hybrid forward error correction/automatic repeat request schemes. We limit our attention to sources which can be modeled as independently compressed frames (e.g., video frames), where each element in the scalable representation of each frame can be transmitted in one or both of two transmission slots. An optimization algorithm determines the level of protection which should be assigned to each element in each slot, subject to transmission bandwidth constraints. To balance the protection assigned to elements which are being transmitted for the first time with those which are being retransmitted, the proposed algorithm formulates a collection of hypotheses concerning its own behavior in future transmission slots. We show how the PET framework allows for a decoupled optimization algorithm with only modest complexity. Experimental results obtained with Motion JPEG2000 compressed video demonstrate that substantial performance benefits can be obtained using the proposed framework.

Algorithms↗
PubMed2005

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↗
PubMed2002

Compression and filtration of U.S. medical images with a modified inverse difference pyramid.

In this paper a new approach for compression and filtration of U.S. medical images is introduced. The application of the algorithm, based on image processing with an inverse difference pyramid (IDP) along with considerable image compression, permits filtration of a specific (speckle) noise in ultrasound images. The paper describes the principle of image decomposition and its modification designed specifically for this medical application. The paper also provides images that illustrate some of the results of this work.

Algorithms↗
PubMed2001

Wavelet-based space-frequency compression of ultrasound images.

This paper describes the compression of grayscale medical ultrasound images using a recent compression technique, i.e., space-frequency segmentation (SFS). This method finds the rate-distortion optimal representation of an image from a large set of possible space-frequency partitions and quantizer combinations and is especially effective when the images to code are statistically inhomogeneous, which is the case for medical ultrasound images. We implemented a compression application based on this method and tested the algorithm on representative ultrasound images. The result is an effective technique that performs better than a leading wavelet-transform coding algorithm, i.e., set partitioning in hierarchical trees (SPIHT), using standard objective distortion measures. To determine the subjective qualitative performance, an expert viewer study was run by presenting ultrasound radiologists with images compressed using both SFS and SPIHT. The results confirmed the objective performance rankings. Finally, the performance sensitivity of the space-frequency codec is shown with respect to several parameters, and the characteristic space-frequency partitions found for ultrasound images are discussed.

Algorithms↗
PubMed2005

Wavelet-based lossy-to-lossless ECG compression in a unified vector quantization framework.

In a prior work, a wavelet-based vector quantization (VQ) approach was proposed to perform lossy compression of electrocardiogram (ECG) signals. In this paper, we investigate and fix its coding inefficiency problem in lossless compression and extend it to allow both lossy and lossless compression in a unified coding framework. The well-known 9/7 filters and 5/3 integer filters are used to implement the wavelet transform (WT) for lossy and lossless compression, respectively. The codebook updating mechanism, originally designed for lossy compression, is modified to allow lossless compression as well. In addition, a new and cost-effective coding strategy is proposed to enhance the coding efficiency of set partitioning in hierarchical tree (SPIHT) at the less significant bit representation of a WT coefficient. ECG records from the MIT/BIH Arrhythmia and European ST-T Databases are selected as test data. In terms of the coding efficiency for lossless compression, experimental results show that the proposed codec improves the direct SPIHT approach and the prior work by about 33% and 26%, respectively.

Algorithms↗
PubMed1997

Focal hepatic lesions: effect of three-dimensional wavelet compression on detection at CT.

PURPOSE: To evaluate the effect of three-dimensional, wavelet-based compression on the detection of focal hepatic lesions at computed tomography (CT). MATERIALS AND METHODS: CT images obtained in 69 patients with focal hepatic lesions were studied (35 consecutive cases and 34 cases selected to be difficult on the basis of lesion size or contrast). Image data were compressed by means of a three-dimensional, wavelet-based algorIthm at ratios of 10:1, 15:1, and 20:1. Normal and abnormal sections (on original and compressed images) were reviewed by using an interactive workstation. Four readers rated the presence or absence of a lesion with a five-point scale. RESULTS: At receiver operating characteristic analysis, no statistically significant difference was detected for all cases considered together. Differences approached but did not reach statistical significance for the diagnostic performance of one reader with compressed images (15:1, P = .054; 20:1, P = .051). For the subset of difficult cases, a significant difference was observed with 20:1 compressed images for one reader (P = .026). Diagnostic performance of readers was less certain in normal than in abnormal cases with both original and compressed images (difference was significant for 15:1 [P = .035] and 20:1 [P < .0001] compressed images). CONCLUSION: Three-dimensional wavelet compression is satisfactory at ratios of at least 10:1. Additional studies with a larger sample would help confirm findings with higher ratios.

Cysts↗
PubMed2006

Extraction and compression of hierarchical isocontours from image data.

In this work, we introduce a new scheme to extract hierarchical isocontours from regular and irregular 2D sampled data and to encode it at single rate or progressively. A dynamic tessellation is used to represent and adapt the 2D data to the isocontour. This adaptation induces a controlled multi-resolution representation of the isocontour. This representation can then be encoded while controlling the geometry and topology of the decoded isocontour. The resulting algorithms form an efficient and flexible isocontour extraction and compression scheme.

Algorithms↗