SEARCH · PubMed Health

Results for “Data Compression”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original 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

PubMed2005

Source coding by efficient selection of ground-state clusters.

We analyze the geometrical structure of clusters of ground states which appear in many frustrated systems over random graphs. Focusing on the regime of connectivities where the number of clusters is exponential in the size of the problems, we identify an appropriate generalization of the survey propagation equations efficiently exploring the geometry. The possibility of selecting different clusters has also computational consequences. As a proof of concept here we show how a well-known physical system can be used to perform nontrivial data compression, for which we introduce a unique compression scheme. Performances are optimized when the number of well-separated clusters is maximal in the underlying physical model.

Journal Article↗

PubMed2002

Language trees and zipping.

In this Letter we present a very general method for extracting information from a generic string of characters, e.g., a text, a DNA sequence, or a time series. Based on data-compression techniques, its key point is the computation of a suitable measure of the remoteness of two bodies of knowledge. We present the implementation of the method to linguistic motivated problems, featuring highly accurate results for language recognition, authorship attribution, and language classification.

Algorithms↗

PubMed2005

Lower bound on the number of Toffoli gates in a classical reversible circuit through quantum information concepts.

The question of finding a lower bound on the number of Toffoli gates in a classical reversible circuit is addressed. A method based on quantum information concepts is proposed. The method involves solely concepts from quantum information--there is no need for an actual physical quantum computer. The method is illustrated in the example of classical Shannon data compression.

Journal Article↗

PubMed2001

Multichannel ECG compression using multichannel adaptive vector quantization.

Adaptive vector quantization (AVQ) is a recently proposed approach for electrocardiogram (ECG) compression. The adaptability of the approach can be used to control the quality of reconstructed signals. However, like most of other ECG compression methods, AVQ only deals with the single-channel ECG, and for the multichannel (MC) ECG, coding ECG signals on a channel by channel basis is not efficient, because the correlation across channels is not exploited. To exploit this correlation, an MC version of AVQ is proposed. In the proposed approach, the AVQ index from each channel is collected to form a new input vector. The vector is then vector quantized adaptively using one additional codebook called index codebook. Both the MIT/BIH database and a clinical Holter database are tested. The experimental results show that, for exactly the same quality of reconstructed signals, the MC-AVQ performs better than single-channel AVQ in terms of bit rate. A theoretical analysis supporting this result is also demonstrated in this paper. For the same and relatively good visual quality, the average compressed data rate/channel is reduced from 293.5 b/s using the single-channel AVQ to 238.2 b/s using the MC-AVQ in the MIT/BIH case.

Algorithms↗

PubMed1999

Feature extraction and quantification of the variability of dynamic performance profiles due to the different sagittal lift characteristics.

Investigation of manual material handling (MMH) tasks, such as lifting, requires the quantification of the various kinematic and kinetic parameters of performance for assessment of the functional capacity and/or task demand profiles. Traditional statistical descriptive analyses usually involve computing the summary statistics (maximum, minimum, mean, and/or range) of the resulting performance parameters over the cycle duration (i.e., lifting/lowering cycle). Consequently, the significant information content of the time-varying signals is diminished, limiting the sensitivity of subsequent hypothesis testing procedures. The present study developed a methodology for representing and quantifying performance data variability of the kinematic and kinetic motion profiles due to the different lift characteristics (load, mode, and speed) during MMH tasks while capturing the temporal characteristics. Using a database of motion profiles from a manual lifting experiment, the Karhunen-Loeve Expansion (KLE) feature extraction technique was shown to be quite effective for representing the various motion profiles. The number of basis vectors (eigenvectors) and corresponding coefficients needed for accurate representation were substantially smaller than the original data set, resulting in data compression. Moreover, the effects of lift characteristics were investigated using analysis of variance techniques that recognize the vectorial constitution of the waveforms. The application of these techniques will enable the quantification of highly phasic profiles and enhance the ability to document the effect of intervening measures such as educational or physical training/exercise on the kinematic and kinetic patterns of performance. Additionally, the differential influence of lift characteristics on the variability of performance during different phases of lifting and lowering provides added resolution in the analysis of MMH tasks.

Adult↗

PubMed2004

A mixed factors model for dimension reduction and extraction of a group structure in gene expression data.

When we cluster tissue samples on the basis of genes, the number of observations to be grouped is much smaller than the dimension of feature vector. In such a case, the applicability of conventional model-based clustering is limited since the high dimensionality of feature vector leads to overfitting during the density estimation process. To overcome such difficulty, we attempt a methodological extension of the factor analysis. Our approach enables us not only to prevent from the occurrence of overfitting, but also to handle the issues of clustering, data compression and extracting a set of genes to be relevant to explain the group structure. The potential usefulness are demonstrated with the application to the leukemia dataset.

Algorithms↗

PubMed2006

Interpretation of the Lempel-Ziv complexity measure in the context of biomedical signal analysis.

Lempel-Ziv complexity (LZ) and derived LZ algorithms have been extensively used to solve information theoretic problems such as coding and lossless data compression. In recent years, LZ has been widely used in biomedical applications to estimate the complexity of discrete-time signals. Despite its popularity as a complexity measure for biosignal analysis, the question of LZ interpretability and its relationship to other signal parameters and to other metrics has not been previously addressed. We have carried out an investigation aimed at gaining a better understanding of the LZ complexity itself, especially regarding its interpretability as a biomedical signal analysis technique. Our results indicate that LZ is particularly useful as a scalar metric to estimate the bandwidth of random processes and the harmonic variability in quasi-periodic signals.

Algorithms↗

PubMed2005

Fast algorithm for distortion-based error protection of embedded image codes.

We consider a joint source-channel coding system that protects an embedded bitstream using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly decoded source bits. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then, we propose a local search (LS) algorithm that starts from a rate-based optimal solution and converges in linear time to a local minimum of the expected distortion. Experimental results for a binary symmetric channel show that our LS algorithm is near optimal, whereas its complexity is much lower than that of the previous best solution.

Algorithms↗

PubMed2006

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↗

PubMed2006

Adaptive MAP error concealment for dispersively packetized wavelet-coded images.

In this paper, we present an adaptive maximum a posteriori (MAP) error concealment algorithm for dispersively packetized wavelet-coded images. We model the subbands of a wavelet-coded image as Markov random fields, and use the edge characteristics in a particular subband, and regularity properties of subband/wavelet samples across scales, to adapt the potential functions locally. The resulting adaptive MAP estimation gives PSNR advantages of up to 0.7 dB compared to the competing algorithms. The advantage is most evident near the edges, which helps improve the visual quality of the reconstructed images.

Algorithms↗

PubMed2006

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↗

PubMed2006

Source-optimized irregular repeat accumulate codes with inherent unequal error protection capabilities and their application to scalable image transmission.

The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing powerful irregular repeat accumulate (IRA) codes that are optimized for the multimedia source and to exploiting the inherent irregularity in IRA codes for UEP. Using the end-to-end distortion due to the first error bit in channel decoding as the cost function, which is readily given by the operational distortion-rate function of embedded source codes, we incorporate this cost function into the channel code design process via density evolution and obtain IRA codes that minimize the average cost function instead of the usual probability of error. Because the resulting IRA codes have inherent UEP capabilities due to irregularity, the new IRA code design effectively integrates channel code optimization and UEP rate assignments, resulting in source-optimized channel coding or joint source-channel coding. We simulate our source-optimized IRA codes for transporting SPIHT-coded images over a binary symmetric channel with crossover probability p. When p = 0.03 and the channel code length is long (e.g., with one codeword for the whole 512 x 512 image), we are able to operate at only 9.38% away from the channel capacity with code length 132380 bits, achieving the best published results in terms of average peak signal-to-noise ratio (PSNR). Compared to conventional IRA code design (that minimizes the probability of error) with the same code rate, the performance gain in average PSNR from using our proposed source-optimized IRA code design is 0.8759 dB when p = 0.1 and the code length is 12800 bits. As predicted by Shannon's separation principle, we observe that this performance gain diminishes as the code length increases.

Algorithms↗

PubMed2004

High-performance computing service over the internet for intraoperative image processing.

This paper presents a framework for a cluster system that is suited for high-resolution image processing over the Internet during surgery. The system realizes high-performance computing (HPC) assisted surgery, which allows surgeons to utilize HPC resources remote from the operating room. One application available in the system is an intraoperative estimator for the range of motion (ROM) adjustment in total hip replacement (THR) surgery. In order to perform this computation-intensive estimation during surgery, we parallelize the ROM estimator on a cluster of 64 PCs, each with two CPUs. Acceleration techniques such as dynamic load balancing and data compression methods are incorporated into the system. The system also provides a remote-access service over the Internet with a secure execution environment. We applied the system to an actual THR surgery performed at Osaka University Hospital and confirmed that it realizes intraoperative ROM estimation without degrading the resolution of images and limiting the area for estimations.

Arthroplasty, Replacement, Hip↗

PubMed2006

Random multispace quantization as an analytic mechanism for BioHashing of biometric and random identity inputs.

Biometric analysis for identity verification is becoming a widespread reality. Such implementations necessitate large-scale capture and storage of biometric data, which raises serious issues in terms of data privacy and (if such data is compromised) identity theft. These problems stem from the essential permanence of biometric data, which (unlike secret passwords or physical tokens) cannot be refreshed or reissued if compromised. Our previously presented biometric-hash framework prescribes the integration of external (password or token-derived) randomness with user-specific biometrics, resulting in bitstring outputs with security characteristics (i.e., noninvertibility) comparable to cryptographic ciphers or hashes. The resultant BioHashes are hence cancellable, i.e., straightforwardly revoked and reissued (via refreshed password or reissued token) if compromised. BioHashing furthermore enhances recognition effectiveness, which is explained in this paper as arising from the Random Multispace Quantization (RMQ) of biometric and external random inputs.

Artificial Intelligence↗

PubMedDate not supplied

Boolean operations with implicit and parametric representation of primitives using R-functions.

We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a Constructive Solid Geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition are used to refine an intermediary mesh around the intersection curves. The output is both an implicit equation and a mesh representing its solution. For the resulting object, an implicit equation with guaranteed differential properties is obtained by simple combinations of the primitives' implicit equations using R-functions. Depending on the chosen R-function, this equation is continuous and can be differentiable everywhere. The primitives' parametric representations are used to directly polygonize the resulting surface by generating vertices that belong exactly to the zero-set of the resulting implicit equation. The proposed approach has many potential applications, ranging from mechanical engineering to shape recognition and data compression. Examples of complex objects are presented and commented on to show the potential of our approach for shape modeling.

Algorithms↗

PubMed1995

A new computer network system for communicating perinatal decision support information via a telephone line.

OBJECTIVE: For fetal monitoring and assessment of high risk mother and fetus at regional hospitals, we developed a new computer network system. METHODS: The system incorporates a notebook-type personal computer (PC-9801nv) at regional hospital for communication in with 3 servers (IBM5580-YOC) connected via 2 Ethernet LANs to 2 host computers (IBM3080, IBM3174) and 5 workstations (IBM5521 V2b), and transmits the compressed data by telephone. When the data arrive, the doctor in perinatal center can immediately display and interpret the data on his workstation and give appropriate advice to the doctor at the regional hospital. RESULTS: The rate of reliable data transmission was 100%. Each 1 hour recording session and characteristic perinatal information was transmitted in less than 2 minutes. Regional medical institutions can easily access the center, and thereby can receive both simplified automatic diagnosis by fetal cardiotocography and pregnancy-risk evaluation. CONCLUSIONS: Because this system uses telephone circuits, it can be accessed from all regions of the country. Thus, our system is useful for perinatal management of high risk mother and fetus.

Adult↗

PubMed1993

Remote control software.

Any of these remote control packages will accomplish the task of controlling another PC from a distant machine. Since all of the programs are easy to use, perform the same functions, and provide excellent security, there is no one clear winner. If your aim is to control Windows programs remotely, then Carbon Copy for Windows is the fastest software. It falls short in running DOS based programs and has greater hardware requirements because it is a Windows application. Norton pcAnywhere is a reliable program that rivals Carbon Copy for Windows' speed, even when controlling a Windows program remotely. Its support for DOS is better. Close-Up is the easiest to install, will run DOS programs without problem, and can run Windows programs as well. Under Windows, DOS programs can be executed in a window or as a full screen application. However, its speed ratings when working in Windows have been among the slowest. Carbon Copy for the Mac brings most of the features of the Windows version of this program to the Macintosh environment. The software allows users to control remote Macintosh computers, and to perform file transfers in the background. It does not permit a PC to control a Mac or a Mac to control a PC. List prices for these programs are $179 to $199 for packages with host and remote software, but street prices range from approximately $100 to $120. A 9600 baud modem with data compression (yielding a net speed of about 14,400 bits/sec) and error correction costs approximately $200 to $300.(ABSTRACT TRUNCATED AT 250 WORDS)

Computer Systems↗

PubMed1995

Subjective evaluation of four low-complexity audio coding schemes.

In this study the subjective performance of four low-complexity audio data compression methods are compared, operating at nominal bit rates of 2, 3, 4, and 5 bits per sample, applied to four 20-kHz bandwidth, 16-bits per sample digitized musical signals. The simple compression schemes compared were elementary differential pulse-code modulation (DPCM), noise feedback coding DPCM (NFC-DPCM), adaptive quantizer DPCM (DPCM-AQB), and a recently proposed method known as recursively indexed quantizer DPCM (RIQ-DPCM). Pairs consisting of a reconstructed signal and a reference signal were presented in a two-interval preference experiment. The reference signals were processed for specified levels of modulated noise reference unit (MNRU) in order to estimate the equality threshold rating (ETR) of the reconstructed audio stimuli. The subjective MNRU values were found to increase by 2-5 dB for each increment in bits per sample. The DPCM-AQB scores were found to be 8-10 dB higher than for DPCM and NFC-DPCM. RIQ-DPCM was rated highest, exceeding the DPCM-AQB results by 2-5 dB in all tests. Objective measurements of segmental signal-to-noise ratio (SNRSEG) for the reconstructed signals predicted a performance level 2-5 dB lower than was actually found in the subjective results, particularly for SNRSEG values below 25 dB.

Adult↗