PubMed · 14413883
The source did not provide an abstract. Follow the original record for more information.
Explore connections, maps & timelines
E LANGE. 1959-11-19. [Late peripheral paralysis. Compression].. https://pubmed.ncbi.nlm.nih.gov/14413883/
Cite the original work for its findings. Save a collection to share your selection of sources.
KEEP EXPLORING
SUMMARY: FASTA is a widely used text-based format for storing nucleotide and protein sequences. The existing FASTA compressors usually focus on (slightly) improving the compression ratio, not on practical performance. We present FFC, a scalable FASTA compressor that achieves average compression speeds 4.7× and 11.4× higher than two high-performance compressors, zstd and NAF, respectively, across a benchmark set of seven single genomes. It also delivers average decompression speeds 3.5× and 2.7× higher than zstd and NAF, respectively. Although a chunk-based zstd variant with parallel decompression, pzstd, almost matches FFC speed, its compression ratio is on average by 23% worse than FFC's. For the experiment, a 14-core workstation and a RAM disk (to reduce the impact of I/O) were used. AVAILABILITY AND IMPLEMENTATION: FFC is freely available at github.com/kowallus/ffc and also as a Zenodo repository at 10.5281/zenodo.18892353, and the used datasets at 10.5281/zenodo.18873744.
Nowadays, applications dealing with volumetric datasets, Medical applications being a typical representative, have become possible even on low cost computers due to a rapid increase of computer memory and processing power. However, even today, dealing with volumetric datasets creates two considerable problems: slow visualization and large file sizes. While recently, due to significant progress in graphics hardware, real-time or near real-time volume visualization has become possible, volume compression still remains a problematic issue. This paper introduces a new method for lossless compression of volumetric datasets. It is based on quadtree encoding. The method consists of three steps: during initialization, so-called division quadtree is built. The smallest unit of the division quadtree is called basic macro-block. During the processing phase, Boolean intersection is built on pairs of quadtrees, and the differences are stored. In the last phase, the variable length encoding is applied to reduce the entropy among the differences. Proposed method supports progressive visualization, what is especially important when a transfer trough the internet is needed. To test the efficiency of this method it was compared to popular octree encoding scheme. The results proved that data coherence is exploited more sufficiently using proposed quadtree approach. Additional advantage of this approach is that the algorithm does not need a lot of memory space. Only two quadtrees of two consecutive slices need be loaded in the memory at the same time. This feature makes this algorithm extremely attractive for possible hardware implementation. This paper introduces a new method for the compression of volumetric datasets. It is based on quadtree encoding. This method consists of three steps: during initialization, a so-called division quadtree is built. The smallest, unit of the division quadtree is called a basic macro-block. A Boolean intersection is built on pairs of quadtrees during the processing phase and the differences are stored. In the last phase, variable length encoding is applied to reduce entropy among the differences. This method has been compared with the popular octree-based method and gives, in general, better compression results. In addition, this method can be realized using small on-board memory.
The analysis of texture in video-stored echocardiographic images is an established method to characterize myocardial pathologies. We investigated whether or not texture parameters calculated from video-stored images and those derived from the joint photographic expert group (JPEG) format compressed data are equivalent to those calculated from uncompressed digital images. Texture parameters were calculated using uncompressed digital data, images stored on videotape, and three forms of compressed digital data (baseline JPEG, JPEG 2000 and lossless JPEG 2000). Video storage heavily affected most texture parameters. Although first-order texture parameters derived from JPEG-compressed images were generally equivalent to those derived from the uncompressed data, several second-order parameters differed significantly. We conclude that texture of video-stored images is not comparable to that of digitally-stored images and that JPEG compression changes important second-order texture parameters. This observation should be taken into account when analyzing texture of modern image data (uncompressed or compressed) and comparing the results with earlier studies utilizing video-stored data.