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 397 records · Page 22Linked to original sources

Wavelet compression and segmentation of digital mammograms.

An initial evaluation of Haar wavelets is presented in this study for the compression of mammographic images. Fifteen mammograms with 105 microns/pixel resolution and varying dynamic range (10 and 12 bits per pixel) containing clustered microcalcifications were compressed with two different rates. The quality and content of the compressed reconstructed images was evaluated by an expert mammographer. The visualization of the cluster was on the average good but degraded with increasing compression because of the discontinuities introduced by these types of wavelets as the compression rate increases. However, the artifacts in the decoded images were seen as totally artificial and were not misinterpreted by the radiologist as calcifications. The classification of the parenchymal densities did not change significantly but the morphology of the calcifications was increasingly distorted as the compression rate increased leading to lower estimates of the suspiciousness of the cluster and higher uncertainties in the diagnosis. The uncompressed and two sets of compressed images were also processed by a wavelet method to extract the calcifications. Despite the fact that the segmentation algorithm generated several false-positive signals in highly compressed images, all true clusters were successfully segmented indicating that the compression process preserved the features of interest. Our preliminary results indicated that wavelets could be used to achieve high compression rates of mammographic images without losing small details such as microcalcification clusters as well as detect the calcifications from either the uncompressed or compressed reconstructed data. Further research and application of multiresolution analysis to digital mammography is continuing.

Algorithms↗

[Study on EEG signals data compression and spikes recognition with wavelet neural network].

A novel method of EEG signals compression representation and epileptiform spikes recognition based on wavelet neural network and its algorithm is presented in this paper. Wavelet network not only can compress data effectively but also can recover original signal. In addition the characteristics of the spikes and the spike-slow rhythm are detected automatically from the time-frequency isoline of EEG signal. This method can be generalized in the field of the electrophysiological signal processing and time-frequency analyzing.

Electroencephalography↗

Thickness correction of mammographic images by means of a global parameter model of the compressed breast.

Peripheral enhancement and tilt correction of unprocessed digital mammograms was achieved with a new reversible algorithm. This method has two major advantages for image visualization. First, the display dynamic range can be relatively small, and second, adjustment of the overall luminance to inspect details is not required in most cases. The correction is useful for preprocessing in computer-aided detection/diagnosis algorithms. The method is based on knowledge of the three-dimensional compressed breast shape to equalize thickness by adding virtual tissue, which results in intensity equalization for the mammographic image. Previously described methods implicitly estimate the contribution of thickness variations to image intensity, usually by nonparametric methods. The proposed method employs a global parametic breast shape model, which is advantageous for visualization and CAD.

Breast↗

Quality assessment of DSA, ultrasound and CT digital images compressed with the JPEG protocol.

Digital diagnostic images from subtraction angiography, computer tomography and ultrasound grabbed at 640 x 560 pixel and 320 x 280 pixel, eight-bit resolution were compressed at seven different levels with the 'lossy' JPEG algorithm in order to decrease the computer magnetic memory space required for their storage. After reconstruction, the deformations caused by the process were assessed (i) qualitatively: a perception test was performed twice, by five radiologists, on a total of 14 images compressed at various levels and (ii) quantitatively: the average grey level value per pixel was calculated at each compression level from each system's residual images obtained by subtracting the compressed image from the original and taking the absolute value of the result. It was concluded that images compressed at a ratio of about 10:1 were indistinguishable from the originals and hence could be considered acceptable for clinical use.

Algorithms↗

Toward computerized morphometric facilities: a review of 58 software packages for computer-aided three-dimensional reconstruction, quantification, and picture generation from parallel serial sections.

This review gives an inventory of 58 computer-aided three-dimensional reconstruction applications in the domain of biomedical research. It is devoted to the formulation of a set of recommendations thought to be necessary for improved performance of software packages in this field. These recommendations can be used to select packages and to guide future developments of existing reconstruction systems. The survey is restricted to three-dimensional reconstructions based upon a series of parallel sections of an object. Subjects treated are programming languages, resolution and sampling, input preparation, realignment, local deformation of slices, numerical quantifications, topological complexity, internal representation, display complexity (hidden surfaces, shading, smoothing), structure extraction, descriptive elements, database, data compression, time efficiency of systems and algorithms, hardware configuration, input devices, input media, interactive aids, display devices, and output devices. Information for this survey comes from articles that appeared between 1965 and 1985.

Computers↗

Optimisation of the predictive ability of artificial neural network (ANN) models: a comparison of three ANN programs and four classes of training algorithm.

The purpose of this study was to determine whether artificial neural network (ANN) programs implementing different backpropagation algorithms and default settings are capable of generating equivalent highly predictive models. Three ANN packages were used: INForm, CAD/Chem and MATLAB. Twenty variants of gradient descent, conjugate gradient, quasi-Newton and Bayesian regularization algorithms were used to train networks containing a single hidden layer of 3-12 nodes. All INForm and CAD/Chem models trained satisfactorily for tensile strength, disintegration time and percentage dissolution at 15, 30, 45 and 60 min. Similarly, acceptable training was obtained for MATLAB models using Bayesian regularization. Training of MATLAB models with other algorithms was erratic. This effect was attributed to a tendency for the MATLAB implementation of the algorithms to attenuate training in local minima of the error surface. Predictive models for tablet capping and friability could not be generated. The most predictive models from each ANN package varied with respect to the optimum network architecture and training algorithm. No significant differences were found in the predictive ability of these models. It is concluded that comparable models are obtainable from different ANN programs provided that both the network architecture and training algorithm are optimised. A broad strategy for optimisation of the predictive ability of an ANN model is proposed.

Algorithms↗

NMR and Bayesian regularized neural network regression for impurity determination of 4-aminophenol.

A method for the determination of 4-aminophenol as an impurity in paracetamol (N-(4-hydroxyphenyl)-acetamide) by proton nuclear magnetic resonance ((1)H-NMR) spectroscopy has been developed. The (13)C-satellite from the protons in the ortho position from the hydroxyl group in paracetamol was used as an internal standard, although these peaks interfered with the peaks from the protons in 4-aminophenol. Because of interference in the spectra and non-linearity over a wide calibration range, a Bayesian regularized neural network model was used for calibration. Various kinds of data preprocessing were examined: zero filling, multiplication by a negative exponential function (line broadening), followed by Fourier transformation of the free induction decay (FID). The NMR spectral data were automatically phased and shift-adjusted by means of a genetic algorithm. Multiplicative scatter correction and data compression by wavelets and sequential zeroing of weights variable selection were performed to obtain an optimal calibration model. Neither zero filling of the FID nor line broadening improved the calibration models with regard to error of prediction, so these processes were excluded in the final model. The generated Bayesian regularized network model was evaluated with an independent test set. Four different models with different test sets were constructed to explore the quality of the calibration. The mean error of the optimal calibration model was 25.3 x 10(-6) weight of 4-aminophenol per weight paracetamol. The method is characterized by being relative fast, simple and sufficient sensitive for typical pharmaceutical impurity determinations.

Acetaminophen↗

Failed tarsal tunnel syndrome surgery.

Failed tarsal tunnel syndrome surgeries are better prevented than treated. Outcomes for revision procedures are significantly worse than for primaries. Failures should be treated with conservative measures first, then surgery for refractory cases. An adequate release must be ensured, and associatedpathologies must be addressed. One should consider containment procedures for adhesive neuritis and PNS for intraneural or intractable pain.

Algorithms↗

Fast motion estimation using bidirectional gradient methods.

Gradient-based motion estimation methods (GMs) are considered to be in the heart of state-of-the-art registration algorithms, being able to account for both pixel and subpixel registration and to handle various motion models (translation, rotation, affine, and projective). These methods estimate the motion between two images based on the local changes in the image intensities while assuming image smoothness. This paper offers two main contributions. The first is enhancement of the GM technique by introducing two new bidirectional formulations of the GM. These improve the convergence properties for large motions. The second is that we present an analytical convergence analysis of the GM and its properties. Experimental results demonstrate the applicability of these algorithms to real images.

Algorithms↗

Invertible temporal subband/wavelet filter banks with half-pixel-accurate motion compensation.

Three-dimensional (3-D) subband/wavelet coding with motion compensation has been demonstrated to be an efficient technique for video coding applications in some recent research works. When motion compensation is performed with half-pixel accuracy, images need to be interpolated in both temporal subband analysis and synthesis stages. The resulting subband filter banks developed in these former algorithms were not invertible due to image interpolation. In this paper, an invertible temporal analysis/synthesis system with half-pixel-accurate motion compensation is presented. We look at temporal decomposition of image sequences as a kind of down-conversion of the sampling lattices. The earlier motion-compensated (MC) interlaced/progressive scan conversion scheme is extended for temporal subband analysis/synthesis. The proposed subband/wavelet filter banks allow perfect reconstruction of the decomposed video signal while retaining high energy compaction of subband transforms. The invertible filter banks are then utilized in our 3-D subband video coder. This video coding system does not contain the temporal DPCM loop employed in the conventional hybrid coder and the earlier MC 3-D subband coders. The experimental results show a significant PSNR improvement by the proposed method. The generalization of our algorithm for MC temporal filtering at arbitrary subpixel accuracy is also discussed.

Algorithms↗

Error concealment for shape in MPEG-4 object-based video coding.

In asynchronus transfer mode networks, cell loss or channel errors can cause data to be dropped in the channel. When digital images/videos are transmitted over these networks, one must be able to reconstruct the missing data so that the impact of the errors is minimized. In this paper, we present an error-concealment technique for shape in MPEG-4 object-based video coding. This method, which is based on using global motion estimation and compensation techniques for boundary recovery, consists of three steps: (1) boundary extraction from shape; (2) boundary patching using global motion compensation; and (3) boundary filling to reconstruct the shape of the damaged video object planes. Global motion parameters are inserted as part of the USER_DATA field in the compressed stream and are utilized in reconstructing the damaged boundaries of compressed video object planes.

Algorithms↗

Performance analysis of motion-compensated de-interlacing systems.

A lot of research has been conducted on motion-compensated (MC) de-interlacing, but there are very few publications that discuss the performances of de-interlacing quantatively. The various methods are compared through their performance on known video sequences. Linear system analysis of interlaced video and de-interlacer are proposed in. It is well established that the performance of the MC methods outperform the fixed or motion-adaptive methods when the motion vectors used are reliable and true to the scene content. Being an open-loop process the performance of the MC de-interlacers degrade drastically when there are motion vector errors. In this paper, a linear system analysis of MC video upconversion systems is presented and the effects of motion vector accuracy on system performance are analyzed. We investigate the various factors that contribute to the motion vector inaccuracy, such as incorrect motion modelling, acceleration between the frames, and insufficient interpolation kernel.

Algorithms↗

Video compression using spatiotemporal regularity flow.

We propose a new framework in wavelet video coding to improve the compression rate by exploiting the spatiotemporal regularity of the data. A sequence of images creates a spatiotemporal volume. This volume is said to be regular along the directions in which the pixels vary the least, hence the entropy is the lowest. The wavelet decomposition of regularized data results in a fewer number of significant coefficients, thus yielding a higher compression rate. The directions of regularity of an image sequence depend on both its motion content and spatial structure. We propose the representation of these directions by a 3-D vector field, which we refer to as the spatiotemporal regularity flow (SPREF). SPREF uses splines to approximate the directions of regularity. The compactness of the spline representation results in a low storage overhead for SPREF, which is a desired property in compression applications. Once SPREF directions are known, they can be converted into actual paths along which the data is regular. Directional decomposition of the data along these paths can be further improved by using a special class of wavelet basis called the 3-D orthonormal bandelet basis. SPREF -based video compression not only removes the temporal redundancy, but it also compensates for the spatial redundancy. Our experiments on several standard video sequences demonstrate that the proposed method results in higher compression rates as compared to the standard wavelet based compression.

Algorithms↗

Non-Hertzian approach to analyzing mechanical properties of endothelial cells probed by atomic force microscopy.

Detailed measurements of cell material properties are required for understanding how cells respond to their mechanical environment. Atomic force microscopy (AFM) is an increasingly popular measurement technique that uniquely combines subcellular mechanical testing with high-resolution imaging. However, the standard method of analyzing AFM indentation data is based on a simplified "Hertz" theory that requires unrealistic assumptions about cell indentation experiments. The objective of this study was to utilize an alternative "pointwise modulus" approach, that relaxes several of these assumptions, to examine subcellular mechanics of cultured human aortic endothelial cells (HAECs). Data from indentations in 2- to 5-microm square regions of cytoplasm reveal at least two mechanically distinct populations of cellular material. Indentations colocalized with prominent linear structures in AFM images exhibited depth-dependent variation of the apparent pointwise elastic modulus that was not observed at adjacent locations devoid of such structures. The average pointwise modulus at an arbitrary indentation depth of 200 nm was 5.6+/-3.5 kPa and 1.5+/-0.76 kPa (mean+/-SD, n=7) for these two material populations, respectively. The linear structures in AFM images were identified by fluorescence microscopy as bundles of f-actin, or stress fibers. After treatment with 4 microM cytochalasin B, HAECs behaved like a homogeneous linear elastic material with an apparent modulus of 0.89+/-0.46 kPa. These findings reveal complex mechanical behavior specifically associated with actin stress fibers that is not accurately described using the standard Hertz analysis, and may impact how HAECs interact with their mechanical environment.

Algorithms↗

Area weighted convolutional interpolation for data reprojection in single photon emission computed tomography.

A data reprojection algorithm has been developed for use in single photon emission computed tomography on an array processor equipped computer system. The algorithm makes use of an accurate representation of pixel activity (uniform square pixel model of intensity distribution), and is rapidly performed due to the efficient handling of an array-based algorithm and the fast Fourier transform on parallel processing hardware. The algorithm consists of using a pixel driven nearest-neighbor projection operation to an array of subdivided projection bins. The subdivided project bin array is then convolved with the angle-dependent projection of the area of a uniform square pixel and compressed to original bin size. The new algorithm has thus been named the area weighted convolution (AWC) method of interpolation. When compared to nearest-neighbor and linear interpolation algorithms, the new AWC algorithm was found to be more accurate, having an accuracy approaching that of the line length algorithm. It also yielded an easier and more efficient implementation on parallel hardware than line length or linear interpolation, with faster execution times than either.

Biometry↗

A method for experimental characterization of the noise performance of elastographic systems.

Characterization of the noise performance of the elastographic system is necessary to evaluate the accuracy and precision of the estimated strain. The elastographic system includes the ultrasonic scanner, the computer controlled compression device and the strain estimation algorithm. In this paper, we present a method of characterizing the elastographic system experimentally using a uniformly elastic homogenous tissue-mimicking phantom. The strain response of the elastographic system is evaluated by characterizing the accuracy and precision of the strain estimates for a large range of input strains. The experimental results obtained follow the theoretical predictions obtained using the Strain Filter (SF) concept for the cross-correlation based strain estimator. In this paper, we illustrate the application of the Experimental Strain Response (ESR) to characterize strain estimation at the focus of the transducer and the axis of symmetry of the phantom.

Elasticity↗

Application of artificial neural network to computer-aided diagnosis of coronary artery disease in myocardial SPECT bull's-eye images.

We have developed a computerized system that can aid in the radiologist's diagnosis in the detection and classification of coronary artery diseases. The technique employs a neural network to analyze 201Tl myocardial SPECT bull's-eye images. This multi-layer feed-forward neural network with a backpropagation algorithm has 256 input units (pattern: compressed 16 x 16-matrix images), 5-140 units in a single hidden layer, and eight output units (diagnosis: one normal and seven different types of abnormalities). The neural network was taught using pairs of training (learning) input data (bull's-eye "EXTENT" image) and desired output data ("correct" diagnosis). The effects of the numbers of hidden units and learning iterations in the network on the recognition performance were examined. In our initial stage, the results show that the recognition performance of the neural network is better than that of the radiology resident but worse than that of the experienced radiologist. Our study also demonstrates that the result produced in the neural network depends on the variety of the training examples used. The preliminary study suggests that the neural network approach is useful for the computer-aided diagnosis of coronary artery diseases in myocardial SPECT bull's-eye images.

Coronary Disease↗

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↗