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

IEEE International Conference on Image Processing

作者： Wenxian Yang Jianfei Cai Jianmin Zheng School of Computer Engineering Nanyang Technological University Singapore

Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. The commonly used solutions, including hard clipping or linear scaling, result in either detail loss or global contrast reduction. Directly applying the existing high dynamic range (HDR) compression algorithms cannot achieve pleasant visual quality either. In our previous work, we proposed a gamut fitting algorithm by formulating gamut fitting as an energy-minimization problem and used the cubic polynomial in the Bernstein-Bézier form to compute the optimal mapping curve. Despite the good performance achieved, the problem of the previous algorithm lies in the necessity of fine tuning the weighting parameter in the proposed energy function. In this paper, we further improve our previous method by using piecewise mapping curves with multiple Bernstein polynomials to find the optimal mapping curve. The proposed approach can be regarded as a post-process to enhance the visual quality of the resulting images from image composition applications. The performance of the proposed method is compared with our previous method and the state-of-the-art HDR compression algorithms.

关键词： Pixel Polynomials Visualization Dynamic range Image coding compression algorithms Tuning

来源：评论

学校读者我要写书评

暂无评论

BPE Acceleration Technique for S/W Update for Mobile Phones

BPE Acceleration Technique for S/W Update for Mobile Phones

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Ryozo Kiyohara Satoshi Mii Information Technology Research and Development Center Mitsubishi Electric Corporation Limited Kamakura Japan Nagoya Works Mitsubishi Electric Corporation Limited Nagoya Japan

ISBN: (纸本)9781424466955;9780769540184

Recently, the size of the software on embedded devices, e.g., mobile phones, has been increasing rapidly. Complex processes in large scale software, such as event handlers, require bugs to be fixed after shipment. NAND flash memory devices are adopted in such devices in order to reduce the cost. The program code in a NAND flash memory is loaded to RAM using demand paging technologies. In many cases, compressed program code is stored in the NAND flash memory and loaded by extracting the program code because the loading time for the uncompressed code is larger than the total time for loading and extracting the compressed code with some compression algorithms. Byte-Pair-Encoding (BPE) is a suitable algorithm for this purpose. The compression rate for BPE is slightly less than GZIP and the extraction speed is very fast. However, the compression speed is very slow. Software updating functions require the compression of program code on a device and have to compress quickly. This paper discusses the software update functions employed for such embedded devices, and proposes a BPE compression speed acceleration technique for software updating. The results obtained from an evaluation show that the proposed method is effective in compressing program code.

关键词： Acceleration Mobile handsets Embedded software Random access memory Large-scale systems Software debugging Computer bugs Costs Read-write memory compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Segment-Parallel Predictor for FPGA-Based Hardware Compressor and Decompressor of Floating-Point Data Streams to Enhance Memory I/O Bandwidth

Segment-Parallel Predictor for FPGA-Based Hardware Compresso...

引用

Data compression Conference (DCC)

作者： Kentaro Sano Kazuya Katahira Satoru Yamamoto Graduate School of Information Sciences University of Tohoku Sendai Japan

ISBN: (纸本)9781424464258;9780769539942

This paper presents segment-parallel prediction for high-throughput compression and decompression of floating-point data streams on an FPGA-based LBM accelerator. In order to enhance the actual memory I/O bandwidth of the accelerator, we focus on the prediction-based compression of floating-point data streams. Although hardware implementation is essential to high-throughput compression, the feedback loop in the decompressor is a bottleneck due to sequential predictions necessary for bit reconstruction. We introduce a segment-parallel approach to the 1D polynomial predictor to achieve the required throughput for decompression. We evaluate the compression ratio of the segment-parallel cubic prediction with various encoders of prediction difference.

关键词： Hardware Bandwidth Arithmetic Field programmable gate arrays Throughput Computational fluid dynamics Concurrent computing Parallel processing compression algorithms Feedback loop

来源：评论

学校读者我要写书评

暂无评论

TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees

TreeZip: A New Algorithm for Compressing Large Collections o...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：