检索结果-内蒙古大学图书馆

Data compression Conference (DCC)

作者： Suzanne J. Matthews Seung-Jin Sul Tiffani L. Williams Department of Computer Science & Engineering Texas A and M University USA

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.

关键词： Phylogeny compression algorithms Data compression Computer science Data engineering Organisms History Standards development Testing Robustness

来源：评论

学校读者我要写书评

暂无评论

POC-guided are matching algorithm for video encoding

POC-guided are matching algorithm for video encoding

引用

Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Ruth M. Aguilar-Ponce J. Luis Tecpanecatl-Xihuitl Alfonso Alba-Cadena Edga Arce-Santana School of Science Autonomous University of San Luis Potosí San Luis Potosi Mexico

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.

关键词： Encoding Motion estimation Search methods Video compression Fourier transforms Video sequences PSNR Table lookup compression algorithms Portable computers

来源：评论

学校读者我要写书评

暂无评论

Compressing a long range dependent renewal process

Compressing a long range dependent renewal process

引用

IEEE International Symposium on Information Theory

作者： Barlas Oǧuz Venkat Anantharam Department of Electrical Engineering and Computer Sciences University of California Berkeley Berkeley CA USA

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.

关键词： Codecs Source coding Entropy Video compression Random processes Information resources Random variables compression algorithms Counting circuits

来源：评论

学校读者我要写书评

暂无评论

On Power and Performance Tradeoff of L2 Cache compression

On Power and Performance Tradeoff of L2 Cache Compression

引用

IEEE Asia Pacific Conference on Circuits and Systems

作者： Chandrika Jena Tim Mason Tom Chen Dept. of ECE Colorado State University

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.

关键词： Delay Codecs Decoding Encoding Transistors compression algorithms Shift registers

来源：评论

学校读者我要写书评

暂无评论

Multi-Channel Data Structure and Real-Time compression Algorithm Research

引用

IEEE AEROSPACE AND ELECTRONIC SYSTEMS MAGAZINE 2009年第11期24卷 28-35页

作者： Ren, Yongfeng Liu, Xiaohua Xu, Wenqiang Zhang, Wendong N Univ China Natl Key Lab Elect Measurement Technol Key Lab Instrumentat Sci & Dynam Measurement Minist Educ Taiyuan 030051 Peoples R China

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.

关键词： Telemetry compression algorithms Hardware Data compression Encoding Real time systems

来源：评论

学校读者我要写书评

暂无评论

VQ compression algorithms on a shared-memory multiprocessor system

VQ compression algorithms on a shared-memory multiprocessor ...

引用

Data compression Conference (DCC)

作者： A. Wakatani Konan University Japan

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

关键词： compression algorithms Parallel algorithms Parallel processing Multimedia systems Cache memory Data compression

来源：评论

学校读者我要写书评

暂无评论

Polylog Space compression Is Incomparable with Lempel-Ziv and Pushdown compression

Polylog Space Compression Is Incomparable with Lempel-Ziv an...

引用

35th Conference on Current Trends in Theory and Practice of Computer Science

作者： Mayordomo, Elvira Moser, Philippe Univ Zaragoza Dept Informat & Ingn Sistemas Maria de Luna 1 Zaragoza 50018 Spain Natl Univ Ireland Maynooth Dept Comp Sci Maynooth Kildare Ireland

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

关键词： compression algorithms plogon computational complexity data stream algorithms Lempel-Ziv algorithm pushdown compression

来源：评论

学校读者我要写书评

暂无评论

New Point compression algorithms for Binary Curves

New Point Compression Algorithms for Binary Curves

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： J. Lopez R. Dahab Institute of Computing State University of Campinas-UNICAMP Sao Paulo Brazil

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.

关键词： compression algorithms Elliptic curves Elliptic curve cryptography Equations NIST Public key ISO standards Standards organizations Public key cryptography Internet

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Real-time Video compression System Control Framework

Design and Implementation of Real-time Video Compression Sys...

引用

WRI International Conference on Communications and Mobile Computing

作者： Li Xiaoli Liu Chao Wang Qiang Ding Wenrui Beijing Univ Aeronaut & Astronaut Sch Comp Sci & Technol Beijing 100191 Peoples R China Beijing Univ Aeronaut & Astronaut Sch Elect & Informat Engn Beijing 100191 Peoples R China

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.

关键词： Table tennis compression system real-time video Frameworks compression algorithms hardware resource parallelism Standing Orders

来源：评论

学校读者我要写书评

暂无评论

An evaluation of lossless compression algorithms for medical infrared images

An evaluation of lossless compression algorithms for medical...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： G. Schaefer R. Starosolski Shao Ying Zhu School of Computing and Informatics Nottingham Trent University Nottingham UK Institute of Computer Science Silesian University of Technology Gliwice Poland Applied Computing University of Derby Derby UK

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

关键词： compression algorithms Biomedical imaging Infrared imaging Image coding Medical diagnostic imaging Transform coding Cameras Leg Humans Skin

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：