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 757 records · Page 42Linked to original sources

GOP-based channel rate allocation using genetic algorithm for scalable video streaming over error-prone networks.

In this paper, we address the problem of unequal error protection (UEP) for scalable video transmission over wireless packet-erasure channel. Unequal amounts of protection are allocated to the different frames (I- or P-frame) of a group-of-pictures (GOP), and in each frame, unequal amounts of protection are allocated to the progressive bit-stream of scalable video to provide a graceful degradation of video quality as packet loss rate varies. We use a genetic algorithm (GA) to quickly get the allocation pattern, which is hard to get with other conventional methods, like hill-climbing method. Theoretical analysis and experimental results both demonstrate the advantage of the proposed algorithm.

Algorithms↗

Temporal shape error concealment by global motion compensation with local refinement.

This paper presents an original temporal shape error concealment technique based on a combination of global and local motion compensation. For this technique, which is especially useful for object-based video applications in error-prone environments (e.g., mobile networks), it is assumed that the shape of the corrupted object at hand is in the form of a binary alpha plane and some of the shape data is missing due to channel errors. To conceal the corrupted shape, the decoder first assumes that a global motion model can describe the shape changes in consecutive time instants. This way, based on locally estimated global motion parameters, the decoder attempts to conceal the corrupted alpha plane by global motion compensating the shape data from the previous time instant. Afterwards, since a global motion model cannot perfectly describe all alpha plane changes, a local motion refinement is applied to improve the concealment in areas of the object with significant local motion.

Algorithms↗

Adaptive spectral strain estimators for elastography.

In conventional elastography, internal tissue deformations, induced by external compression applied to the tissue surface, are estimated by cross-correlation analysis of echo signals obtained before and after compression. Conventionally, strains are estimated by computing the gradient of estimated displacement. However, gradient-based algorithms are highly susceptible to noise and decorrelation, which could limit their utility. We previously developed strain estimators based on a frequency-domain (spectral) formulation that were shown to be more robust but less precise compared to conventional strain estimators, In this paper, we introduce a novel spectral strain estimator that estimates local strain by maximizing the correlation between the spectra of pre- and postcompression echo signals using iterative frequency-scaling of the latter; we also discuss a variation of this algorithm that may be computationally more efficient but less precise. The adaptive spectral strain estimator combines the advantages of time- and frequency-domain methods and has outperformed conventional estimators in experiments and 2-D finite-element simulations.

Algorithms↗

Adaptive dynamic range optimization (ADRO): a digital amplification strategy for hearing aids and cochlear implants.

Adaptive dynamic range optimization (ADRO) is an amplification strategy that uses digital signal processing techniques to improve the audibility, comfort, and intelligibility of sounds for people who use cochlear implants and/or hearing aids. The strategy uses statistical analysis to select the most information-rich section of the input dynamic range in multiple-frequency channels. Fuzzy logic rules control the gain in each frequency channel so that the selected section of the dynamic range is presented at an audible and comfortable level. The ADRO processing thus adaptively optimizes the dynamic range of the signal in multiple-frequency channels. Clinical studies show that ADRO can be fitted easily to all degrees of hearing loss for hearing aids and cochlear implants in a direct and intuitive manner, taking the preferences of the listener into account. The result is high acceptance by new and experienced hearing aid users and strong preferences for ADRO compared with alternative amplification strategies. The ADRO processing is particularly well suited to bimodal and hybrid stimulation which combine electric and acoustic stimulation in opposite ears or in the same ear, respectively.

Algorithms↗

Long-term versus short-term hearing aid benefit.

This study compared hearing aid benefit obtained 6 weeks and a minimum of 1 year after fitting to determine if changes occurred over time. Fifteen individuals with mild-to-moderate sensorineural hearing losses, who were successful users of linear amplification, were fitted binaurally with the Resound BT2 Personal Hearing System. These hearing aids are programmable in two frequency bands that provide wide dynamic range compression (WDRC) amplification. The manufacturer's recommended loudness growth in octave bands (LGOB) and audiogram programming algorithm and fitting procedures were used. Following an initial 6-week period and again following a minimum of 1 year of use, the Profile of Hearing Aid Benefit (PHAB) was administered. Similarly, speech recognition performance was tested using the Connected Speech Test (CST) in a six-talker speech babble at 50 dBA, +10 signal-to-noise (S/N); 60 dBA, +5 SNR; and 70 dBA, +2 SNR; and in quiet with a reverberation time of 0.78 seconds. Significant aided benefit was shown. These short-term benefit scores for the PHAB and CST were compared with those obtained after 1 year of full-time use. Results revealed no significant change in hearing aid benefit with long-term use, suggesting that a 6-week acclimatization period is sufficiently long for clinical trials of this type of WDRC amplification.

Aged↗

Mixtures of probabilistic principal component analyzers.

Principal component analysis (PCA) is one of the most popular techniques for processing, compressing, and visualizing data, although its effectiveness is limited by its global linearity. While nonlinear variants of PCA have been proposed, an alternative paradigm is to capture data complexity by a combination of local linear PCA projections. However, conventional PCA does not correspond to a probability density, and so there is no unique way to combine PCA models. Therefore, previous attempts to formulate mixture models for PCA have been ad hoc to some extent. In this article, PCA is formulated within a maximum likelihood framework, based on a specific form of gaussian latent variable model. This leads to a well-defined mixture model for probabilistic principal component analyzers, whose parameters can be determined using an expectation-maximization algorithm. We discuss the advantages of this model in the context of clustering, density modeling, and local dimensionality reduction, and we demonstrate its application to image compression and handwritten digit recognition.

Algorithms↗

Approximating edit distances between complex tandem repeats efficiently.

MOTIVATION: Extended tandem repeats (TRs) have been associated with 60 or more diseases over the past 30 years. Although most TRs have single repeat units (or motifs), complex TRs with different units have recently been correlated with some brain disorders. Of note, a population-scale analysis shows that complex TRs at one locus can be divergent, and different units are often expanded between individuals. To understand the evolution of high TR diversity, it is informative to visualize a phylogenetic tree. To do this, we need to measure the edit distance between pairs of complex TRs by considering duplication and contraction of units created by replication slippage. However, traditional rigorous algorithms for this purpose are computationally expensive. RESULTS: We here propose an efficient heuristic algorithm to estimate the edit distance with duplication and contraction of units (EDDC, for short). We select a set of frequent units that occur in given complex TRs, encode each unit as a single symbol, compress a TR into an optimal series of unit symbols that partially matches the original TR with the minimum Levenshtein distance, and estimate the EDDC between a pair of complex TRs from their compressed forms. Using substantial synthetic benchmark datasets, we demonstrate that the estimated EDDC is highly correlated with the accurate EDDC, with a Pearson correlation coefficient of >0.983, while the heuristic algorithm achieves orders of magnitude performance speedup. AVAILABILITY AND IMPLEMENTATION: The software program hEDDC that implements the proposed algorithm is available at https://github.com/Ricky-pon/hEDDC (DOI: 10.5281/zenodo.14732958).

Algorithms↗

Improving storage efficiency of vector quantization codebook for physiological quasi-periodic signals.

A quasi-periodic signal is a periodic signal with period and amplitude variations. The electrocardiogram (ECG) and several physiological signals can be treated as quasi-periodic. Vector quantization (VQ) is a valuable and universal tool for signal compression. However, the periodicity of a quasi-periodic signal causes data redundancy in the VQ codebook, where many codevectors are highly correlated. This paper explores the codebook (CB) redundancy in order to increase storage efficiency for physiological quasi-periodic signals. A quantitative CB redundancy measure and two redundancy reducing algorithms are proposed. Both algorithms use a mixed CB structure containing one and two-dimensional CBs. The first algorithm is applied to a CB directly, and the second one uses an LBG-like training algorithm to obtain a storage-efficient CB from a set of training vectors. With the MIT/BIH ECG database, the experimental results show that both algorithms can reduce the CB redundancy effectively with essentially no loss of signal quality. For comparison, the mean-shape VQ (MSVQ) proposed by Cárdenas-Barrera and Lorenzo-Ginori for ECG compression is implemented and the resulting average percent of the root-mean-square difference (PRD) is 10.78%. By using the first algorithm, the CB storage space is reduced by 40% and the resulting average PRD is 10.87%. The second algorithm can reduce the CB storage space by 75% and the average PRD is 10.27%, which is even better than the original MSVQ.

Algorithms↗

Calcified cephalohematoma: classification, indications for surgery and techniques.

While calcified cephalohematoma is eminently correctable, a clear description of indications for surgery and surgical techniques are currently lacking in the literature. In this paper we propose a simple classification and an algorithm for the management of cephalohematomas. Three patients were treated for large calcified parietal cephalohematomas. Craniectomy and cranioplasty were performed with excellent outcome. Cranioplasty was performed with the cap radial craniectomy technique in two patients and the flip-over bull's-eye technique in one patient. The literature was reviewed on this entity and an algorithm based on the timing of presentation, extent of calcification and type of calcified cephalohematoma is proposed. Aspiration and compressive dressings can be used for early, incompletely calcified cephalohematomas. Calcified cephalohematoma causing significant distortion of the calvarium requires surgical correction and is classified as Types 1 or 2 depending on the contour of the inner lamella. Type 1, with a normal contoured inner lamella, can be corrected by ostectomy of the outer lamella. Type 2 calcified cephalohematoma has a depressed inner lamella. Elevation of the inner lamella is necessary and the cap radial craniectomy technique can be used. We describe a novel technique, the flip-over bull's-eye techniques as an alternative technique for Type 2 lesions in selected patients. In conclusion, calcified cephalohematomas can safely be treated surgically with excellent outcome. It is hoped that this algorithm will serve as a useful and logical guide in decision making for the management of this condition.

Algorithms↗

A joint source-channel distortion model for JPEG compressed images.

The need for efficient joint source-channel coding (JSCC) is growing as new multimedia services are introduced in commercial wireless communication systems. An important component of practical JSCC schemes is a distortion model that can predict the quality of compressed digital multimedia such as images and videos. The usual approach in the JSCC literature for quantifying the distortion due to quantization and channel errors is to estimate it for each image using the statistics of the image for a given signal-to-noise ratio (SNR). This is not an efficient approach in the design of real-time systems because of the computational complexity. A more useful and practical approach would be to design JSCC techniques that minimize average distortion for a large set of images based on some distortion model rather than carrying out per-image optimizations. However, models for estimating average distortion due to quantization and channel bit errors in a combined fashion for a large set of images are not available for practical image or video coding standards employing entropy coding and differential coding. This paper presents a statistical model for estimating the distortion introduced in progressive JPEG compressed images due to quantization and channel bit errors in a joint manner. Statistical modeling of important compression techniques such as Huffman coding, differential pulse-coding modulation, and run-length coding are included in the model. Examples show that the distortion in terms of peak signal-to-noise ratio (PSNR) can be predicted within a 2-dB maximum error over a variety of compression ratios and bit-error rates. To illustrate the utility of the proposed model, we present an unequal power allocation scheme as a simple application of our model. Results show that it gives a PSNR gain of around 6.5 dB at low SNRs, as compared to equal power allocation.

Algorithms↗

Multilevel and motion model-based ultrasonic speckle tracking algorithms.

A multilevel motion model-based approach to ultrasonic speckle tracking has been developed that addresses the inherent trade-offs associated with traditional single-level block matching (SLBM) methods. The multilevel block matching (MLBM) algorithm uses variable matching block and search window sizes in a coarse-to-fine scheme, preserving the relative immunity to noise associated with the use of a large matching block while preserving the motion field detail associated with the use of a small matching block. To decrease further the sensitivity of the multilevel approach to noise, speckle decorrelation and false matches, a smooth motion model-based block matching (SMBM) algorithm has been implemented that takes into account the spatial inertia of soft tissue elements. The new algorithms were compared to SLBM through a series of experiments involving manual translation of soft tissue phantoms, motion field computer simulations of rotation, compression and shear deformation, and an experiment involving contraction of human forearm muscles. Measures of tracking accuracy included mean squared tracking error, peak signal-to-noise ratio (PSNR) and blinded observations of optical flow. Measures of tracking efficiency included the number of sum squared difference calculations and the computation time. In the phantom translation experiments, the SMBM algorithm successfully matched the accuracy of SLBM using both large and small matching blocks while significantly reducing the number of computations and computation time when a large matching block was used. For the computer simulations, SMBM yielded better tracking accuracies and spatial resolution when compared with SLBM using a large matching block. For the muscle experiment, SMBM outperformed SLBM both in terms of PSNR and observations of optical flow. We believe that the smooth motion model-based MLBM approach represents a meaningful development in ultrasonic soft tissue motion measurement.

Algorithms↗

Information theoretical evaluation of parametric models of gain control in blowfly photoreceptor cells.

Models are developed and evaluated that are able to describe the response of blowfly photoreceptor cells to natural time series of intensities. Evaluation of the models is performed using an information theoretical technique that evaluates the performance of the models in terms of a coherence function and a derived coherence rate (in bit/s). Performance is gauged against a maximum expected coherence rate determined from the repeatability of the response to the same stimulus. The best model performs close to this maximum performance, and consists of a cascade of two divisive feedback loops followed by a static nonlinearity. The first feedback loop is fast, effectively compressing fast and large transients in the stimulus. The second feedback loop also contains slow components, and is responsible for slow adaptation in the photoreceptor in response to large steps in intensity. Any remaining peaks that would drive the photoreceptor out of its dynamic range are handled by the final compressive nonlinearity.

Adaptation, Ocular↗

Correlation between drug release kinetics from proteineous matrices and protein folding: elasticity and compressibility study.

Naproxen sodium (NS) release mechanism from proteineous matrices based on egg albumin (EA) and bovine serum albumin (BSA) was investigated by several physico-chemical methods. The gel strength, modulus of elasticity and erosion properties of the matrices were studied and correlated with drug release kinetics. The results revealed that NS release rate from EA and BSA matrices was markedly different, indicating the significant role of protein nature and conformation on matrix behavior. Unexpectedly it was found that incorporation of NS to EA matrix increased gel strength and modulus of elasticity and decreased matrix erosion. This effect was dependent on NS concentration in the matrix. In contrast to EA, BSA behaved as a non-gelling matrix and was unable to retard drug release because of its high solubility. The influence of NS on protein folding and compressibility in protein solutions was studied using densitometric and ultrasonic techniques. Adiabatic compressibility measurements revealed that NS caused unfolding of EA, an effect which led to a decrease in EA intrinsic compressibility and the exposure of atomic side groups buried in protein interior. Unfolding of EA led to an increase of modulus of elasticity in solution (measured by ultrasonic velocimetry technique) which is in correlation with the modulus of elasticity measurements of gelled tablets (measured by Instron). In concentrated EA solutions, the results showed a large increase in EA compressibility and ultrasonic absorption in the presence of NS indicating a strong aggregation of the denatured state of EA. Regarding BSA, the results suggested that NS affected the packing of the protein interior, transforming it to a molten globule intermediate state, an effect that led to an increase in BSA compressibility. At high BSA concentrations, aggregation of the molten globule state was observed as indicated by an increase of BSA compressibility and ultrasonic absorption values.

Algorithms↗

Development of computerised procedures for the characterisation of the tableting properties with eccentric machines: extended Heckel analysis.

Heckel plots are a suitable and valuable method for analysis of powder compaction with very small amounts of powder. The determination is based upon a non-linear transformation of compression data and thus the signal errors that might be introduced into the analysis might be enlarged and become critical. The method of determination of true density affects the results dramatically as does the accuracy of the powder height determination. The porosity should be corrected for compression of the solid fraction. The accuracy of the powder height detection is the most demanding parameter. The statements are proven by simulations based on real data and analytic calculation. According to these highly corrected Heckel plots, the shape of the plots during the compression phase gives the information about fragmentation and plasticity and additionally about the time dependency of the compression behaviour within one compression on an eccentric press.

Algorithms↗

Medical image compression by discrete cosine transform spectral similarity strategy.

Due to the bandwidth and storage limitations, medical images must be compressed before transmission and storage. However, the compression will reduce the image fidelity, especially when the images are compressed at lower bit rates. The reconstructed images suffer from blocking artifacts and the image quality will be severely degraded under the circumstance of high compression ratios. In this paper, we present a strategy to increase the compression ratio with simple computational burden and excellent decoded quality. We regard the discrete cosine transform as a bandpass filter to decompose a sub-block into equal-sized bands. After a band gathering operation, a high similarity property among bands is found. By the utilization of similarity property, the bit rate of compression can be greatly reduced. Meanwhile, the characteristics of the original image are not sacrificed. Thus, it can avoid the misdiagnosis of diseases for doctors. Simulations are carried to different kind of medical images to demonstrate that the proposed method achieves better performance when compared to other existing transform coding scheme as the JPEG in terms of bit rate and quality. For the case of angiogram image, its peak signal-to-noise-ratio gain is 13.5 dB at the same bit rate of 0.15 bits per pixel when comparing to the JPEG compression. As to the other kind of medical images, their benefits are not so obvious as an angiogram image; however, the gains for them are still from 4-8 dB at high compression ratios. Two doctors from the Department of Radiology, National Cheng Kung University Hospital, Tainan, Taiwan, R.O.C., and Chang Gung Medical Hospital, Kaoshuing, Taiwan, R.O.C., are invited to verify the decoded image quality; the diagnoses of all the test images are correct when the compression ratios are below 20.

Algorithms↗

Variable density linear acoustic inverse problem.

The linear acoustic inverse problem is solved simultaneously for density (rho) and compressibility (kappa) using the basic ideas of diffraction tomography (DT). The key to solving this problem is to utilize frequency diversity to obtain the required independent measurements. The receivers are assumed to be in the far field of the object, and plane wave incidence is also assumed. The Born approximation is used to arrive at a relationship between the measured pressure field and two terms related to the spatial Fourier transform of the two unknowns, rho and kappa. The term involving compressibility corresponds to monopole scattering and that for density to dipole scattering. Measurements at several frequencies are used and a least squares problem is solved to reconstruct rho and kappa at the same time. It is observed that the low spatial frequencies in the spectra of rho and kappa produce inaccuracies in the results. Hence, a regularization method is devised to remove this problem. Several results are shown. Low contrast objects for which the above analysis holds are used to show that good reconstructions are obtained for both density and compressibility after regularization is applied.

Acoustics↗

[Progress in technique of computer for three dimensional reconstruction from biological tissue series slices images].

The development of the technique of computer processing images and biotechnology from late 80's to early 90's has rovided the possibility of displaying three dimensional images of biological tissues truly. Now the technique of computer for three dimensional reconstruction is more and more widely used in the biological territory. This paper introduces the progress in the technique of computer for three dimensional reconstruction from biological tissue series slices images. Emphasis is laid on registration, reconstruction & display, image data compressing and image automatic segmentation.

Algorithms↗

MR image classification algorithms for neurosurgical and stereotactic radiosurgical trajectory planning and volumetric analysis.

Neurosurgical and stereotactic radiosurgical trajectory planning involves a phase of image data acquisition followed by localization of tissues to be avoided or crossed during the procedure. Success of the procedure is often assessed during follow-up by performing volumetric analysis of tissues of interest. Both localization and volumetric analysis can be facilitated by classifying the input data into different tissue types. This study compares classification results based on four different input image data: (1) MR data obtained with one TR and TE parameter combination, (2) MR data acquired with eight combinations of TR and TE parameters, (3) input data compressed into four principal components, and (4) the input data (3) together with first- and second-order texture features. The algorithms (a) to reduce the dimensionality using principal components, (b) to generate texture features, (c) to determine feature usefulness in classification using the Wilk's lambda criterion, and (d) to classify the input set are described. Classification results are found to be poor for input data 1 and much improved (qualitatively and quantatively) for input data 2. Input data 3 produces classification results (quantitatively and qualitatively) similar to that of 2. Input data 4 is found to produce quantitative results similar to those of 2 and 3, but the qualitative results show enhanced classification of some tissues and distortion of others.

Algorithms↗