The primary advantage of TreeZip is its use of semantic compression, which allows us to uniquely store tree relationship information. Phylogenetic trees are stored in a format known as a Newick representation, which u...
详细信息
ISBN:
(纸本)9781424464258;9780769539942
The primary advantage of TreeZip is its use of semantic compression, which allows us to uniquely store tree relationship information. Phylogenetic trees are stored in a format known as a Newick representation, which uses nested parentheses to represent the evolutionary relationships (or subtrees) within a phylogenetic tree. TreeZip uses two universal hashing functions in order to represent compactly all of the shared evolutionary relationships in the tree collection. In our previous work, we have used successively universal hash functions in our HashCS and HashRF algorithms that build consensus trees and topological distance matrices, respectively. Once the hash table is constructed, the TreeZip then writes the compressed file depicting the information contained in the collection of phylogenetic trees.
A motion estimation algorithm based on Phase-Only Correlation (POC) function is proposed. Motion estimation is one of the key tasks in several applications such as video encoding. Motion estimation is the process of f...
详细信息
A motion estimation algorithm based on Phase-Only Correlation (POC) function is proposed. Motion estimation is one of the key tasks in several applications such as video encoding. Motion estimation is the process of finding the vertical and horizontal displacement of a block. The accuracy of this process depends on the search method and matching criteria. The proposed method calculates POC on the entire *** gives us a good estimated of the displacement that occurs within the frame. The size of the peaks depends on the size of the area that is moving towards the direction represented by them. We select a set of peaks that can be coded in a lookup table. Then, Sum of Absolute Difference (SAD) is calculated for each vector within the table. The vector with the lowest SAD for the block is selected as the motion vector. The search method based on POC provides better results compared with Full Search.
Analysis of variable bit-rate video data has shown that long range dependence persists across a wide variety of codecs. While codecs are generally lossy, one may conjecture, as a partial explanation for this fact, tha...
详细信息
Analysis of variable bit-rate video data has shown that long range dependence persists across a wide variety of codecs. While codecs are generally lossy, one may conjecture, as a partial explanation for this fact, that there exist information sources for which any lossless code results in a bit-rate process that eventually dominates a long range dependent random process. We prove this to be true for discrete time long range dependent renewal processes under a mild technical assumption.
This paper presents the power-performance trade off of three different cache compression algorithms. Cache compression improves performance, since the compressed data increases the effective cache capacity by reducing...
详细信息
ISBN:
(纸本)9781424474547
This paper presents the power-performance trade off of three different cache compression algorithms. Cache compression improves performance, since the compressed data increases the effective cache capacity by reducing the cache misses. The unused memory cells can be put into sleep mode to save static power. The increased performance and saved power due to cache compression must be more than the delay and power consumption added due to CODEC (Compressor and Decompressor) block respectively. Among the studied algorithms, powerdelay characteristic of Frequent Pattern compression (FPC) is found to be the most suitable for cache compression.
The development of space telemetry technology has brought forward the need for large capacity memory of any solid-state recorder;data compression therefore, becomes more and more important. The compression feasibility...
详细信息
The development of space telemetry technology has brought forward the need for large capacity memory of any solid-state recorder;data compression therefore, becomes more and more important. The compression feasibility and potentiality of telemetry data are examined by analyzing the statistical characteristics of actual telemetry data recovered from recorders. Aiming at the disadvantage of present data formats in data compression for multi-channel telemetry data acquisition systems, this introduces a data packet structure, and a real-time compression algorithm for low complex hardware design. The principles and implementations of data package compression are described. Simulation results show that this technology can meet the requirements of multi-channel real-time data compression with a high compression ratio and a fast compression speed, which possesses great application value.
Summary form only given. We implemented parallel algorithms for vector quantization (VQ) compression on a shared-memory parallel environment and evaluated the effectiveness of the parallel algorithms. On such a system...
详细信息
Summary form only given. We implemented parallel algorithms for vector quantization (VQ) compression on a shared-memory parallel environment and evaluated the effectiveness of the parallel algorithms. On such a system, we evaluate two parallel algorithms for the codebook generation of the VQ compression: parallel LBG and parallel tPNN and find that the parallel tPNN is superior in terms of space complexity, whereas the parallel LBG is superior in terms of time complexity and parallelism
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study the performance attained by these algor...
详细信息
ISBN:
(纸本)9783540958901
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study the performance attained by these algorithms and show they are incomparable with both pushdown compressors and the Lempel-Ziv compression algorithm.
This paper presents two new algorithms for point compression for elliptic curves defined over F 2m , m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational advantages over previous methods...
详细信息
This paper presents two new algorithms for point compression for elliptic curves defined over F 2m , m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational advantages over previous methods. The second algorithm is based on the λ representation of an elliptic point. The proposed algorithms require m bits to compress an elliptic point and can be used for all random binary curves recommended by NIST.
In order to implement the real-time video compression system the compression algorithm should be improved and also need a reasonable control framework which brings no additional overhead and efficient to use of the ha...
详细信息
ISBN:
(纸本)9780769535012
In order to implement the real-time video compression system the compression algorithm should be improved and also need a reasonable control framework which brings no additional overhead and efficient to use of the hardware resources. With the perspective of improve the degree of parallelism of the on-chip peripherals and the core, this paper analyzed the disadvantages of the ping-pong buffers pipeline mechanism at first, and the introduced a improved control framework based on dual-core DSP polling control and ping-pong buffers pipeline to avoid that disadvantages. A H.264 based video encoder used this control framework was implemented on the platform of ADSP-BF561, and the experimental results show that the framework can meet the video compression system's real-time capability and reliability requirements by reducing the coding time falling the frame loss frequency and improving the systems work efficiency.
Several popular lossless image compression algorithms were evaluated for the application of compressing medical infrared images. Lossless JPEG, JPEG-LS, JPEG2000, PNG, and CALIC were tested on an image dataset of 380+...
详细信息
Several popular lossless image compression algorithms were evaluated for the application of compressing medical infrared images. Lossless JPEG, JPEG-LS, JPEG2000, PNG, and CALIC were tested on an image dataset of 380+ thermal images. The results show that JPEG-LS is the algorithm with the best performance, both in terms of compression ratio and compression speed
暂无评论