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

2008 IEEE International Symposium on Circuits and Systems (ISCAS 2008), vol.9

作者： Jithendra K. Paruchuri Sen-ching Samson Cheung Center for Visualization and Virtual Environments and Department of ECE University of Kentucky Lexington KY USA

From copyright protection to error concealment, video data hiding has found usage in a great number of applications. Recently proposed applications such as privacy data preservation require huge amount of information to be hidden inside a compressed video bitstream. Since data hiding disturbs the underlying statistical patterns of the source data, it adversely affects the performance of compression which are designed based on the statistical properties of the data. As such, it is imperative to design a data hiding scheme that is compatible with the compression algorithm and at the same time, introduces as little perceptual distortion as possible. In this paper, we propose a novel compression-domain video data-hiding algorithm that determines the optimal embedding strategy to minimize both the output perceptual distortion and the output bit rate. The hidden data is embedded into selective Discrete Cosine Transform (DCT) coefficients which are found in most video compression standards. The coefficients are selected based on minimizing a cost function that combines both distortion and bit rate via a user-controlled weighting. Two methods are proposed - exhaustive search and fast Lagrangian approximation. While the former produces optimal results, the latter approach is significantly faster and amenable to real-time implementation.

关键词： Data encapsulation Video compression Bit rate Discrete cosine transforms Copyright protection Data privacy Algorithm design and analysis compression algorithms Cost function Rate distortion theory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Embedded compression Algorithm Using Adjusted Binary Code Method

An Efficient Embedded Compression Algorithm Using Adjusted B...

引用

2008 IEEE International Symposium on Circuits and Systems (ISCAS 2008), vol.8

作者： Yu-Xuan Lee Tsung-Han Tsai DSP VLSI Lab Department of Electronics Engineering National Central University Taoyuan Taiwan

Both computation-intensive and bandwidth-intensive are primary characterizes in closed-loop video coding systems. With the rapid progress of semiconductor industry, the commutation-intensive issue can be properly handled by parallelism or pipeline processing. Therefore, bandwidth-intensive issue becomes more and more important in video coding. The embedded compression (EC) technology is widely applied to reduce frame memory size and bandwidth requirement. In this paper, an efficient EC algorithm, including ABC-based recompression, side-clipping mechanism and average-based prediction, is proposed. With proposed EC algorithm, the compression ratio (CR) of 50percent can be guaranteed with minor PSNR degradation of 4.02percent on average. Although EC is an additional function in video coding system, the extra encoding computation load is just 2.4percent on average. Consequently, the proposed EC algorithm can be exploited to reduce the frame memory and bandwidth requirement in video coding systems.

关键词： compression algorithms Binary codes Video coding Bandwidth Electronics industry Parallel processing Pipeline processing Chromium PSNR Degradation

来源：评论

学校读者我要写书评

暂无评论

Explicit learning curves for transduction and application to clustering and compression algorithms

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2004年第0期22卷 117-142页

作者： Derbeko, P El-Yaniv, R Meir, R Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

Inductive learning is based on inferring a general rule from a finite data set and using it to label new data. In transduction one attempts to solve the problem of using a labeled training set to label a set of unlabeled points, which are given to the learner prior to learning. Although transduction seems at the outset to be an easier task than induction, there have not been many provably useful algorithms for transduction. Moreover, the precise relation between induction and transduction has not yet been determined. The main theoretical developments related to transduction were presented by Vapnik more than twenty years ago. One of Vapnik's basic results is a rather tight error bound for transductive classification based on an exact computation of the hypergeometric tail. While tight, this bound is given implicitly via a computational routine. Our first contribution is a somewhat looser but explicit characterization of a slightly extended PAC-Bayesian version of Vapnik's transductive bound. This characterization is obtained using concentration inequalities for the tail of sums of random variables obtained by sampling without replacement. We then derive error bounds for compression schemes such as (transductive) support vector machines and for transduction algorithms based on clustering. The main observation used for deriving these new error bounds and algorithms is that the unlabeled test points, which in the transductive setting are known in advance, can be used in order to construct useful data dependent prior distributions over the hypothesis space.

关键词： compression algorithms Support Vector Network Dataset Bound algorithms test points OBSERVATIONAL LEARNING Learning Curve Transduction Cluster Analysis

来源：评论

学校读者我要写书评

暂无评论

algorithms and Hardware Structures for Unobtrusive Real-Time compression of Instruction and Data Address Traces

Algorithms and Hardware Structures for Unobtrusive Real-Time...

引用

Data compression Conference (DCC)

作者： Milena Milenkovic Aleksandar Milenkovic Martin Burtscher IBM Austin TX USA Electrical and Computer Engineering Department University of Alabama Huntsville USA Computer Systems Laboratory Cornell University Ithaca NY USA

Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software developers for program optimization, performance tuning, and debugging. Such traces are typically very large and need to be compressed to reduce the storage, processing, and communication bandwidth requirements. However, preexisting general-purpose and trace-specific compression algorithms are designed for software implementation and are not suitable for runtime compression. Compressing program execution traces at runtime in hardware can deliver insights into the behavior of the system under test without any negative interference with normal program execution. Traditional debugging tools, on the other hand, have to stop the program frequently to examine the state of the processor. Moreover, software developers often do not have access to the entire history of computation that led to an erroneous state. In addition, stepping through a program is a tedious task and may interact with other system components in such a way that the original errors disappear, thus preventing any useful insight. The need for unobtrusive tracing is further underscored by the development of computer systems that feature multiple processing cores on a single chip. In this paper, we introduce a set of algorithms for compressing instruction and data address traces that can easily be implemented in an on-chip trace compression module and describe the corresponding hardware structures. The proposed algorithms are analytically and experimentally evaluated. Our results show that very small hardware structures suffice to achieve a compression ratio similar to that of a software implementation of gzip while being orders of magnitude faster. A hardware structure with slightly over 2 KB of state achieves a compression ratio of 125.9 for instruction address traces, whereas gzip achieves a compression ratio of 87.4. For data addr

关键词： Hardware Algorithm design and analysis Runtime Computer aided instruction Computer architecture Software debugging Software performance Design optimization Bandwidth compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Guided quaternary reaching method for wavelet-based image compression

Guided quaternary reaching method for wavelet-based image co...

引用

DCC 2007: 2007 Data compression Conference

作者： Xiteng, Liu University of South Carolina Industrial Mathematics Institute Columbia SC 29208 United States

No abstract available

ISBN: (纸本)0769527914

No abstract available

关键词： Image coding Transform coding Quantization Wavelet coefficients Partitioning algorithms Mathematics Algorithm design and analysis compression algorithms PSNR Image quality

来源：评论

学校读者我要写书评

暂无评论

compression and Coding algorithms (A. Moffat and A. Turpin;2002) [book review]

引用

IEEE Transactions on Information Theory 2005年第1期51卷 422-422页

作者： John C. Kieffer

This textbook is aimed at computer science students. The authors perform compression experiments throughout the text which are of two types: data sequencing and archival data filing. The book has good discussions of l... 详细信息

关键词： compression algorithms Entropy Image coding Pixel Data compression Computer science Arithmetic Source coding Electrical engineering Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Long distance redundancy reduction in thin client computing

Long distance redundancy reduction in thin client computing

引用

6th IEEE/ACIS International Conference on Computer and Information Science in conjunction with 1st IEEE/ACIS International Workshop on e-Activity

作者： Yang, Sun Tiow, Tay Teng Natl Univ Singapore ECE Dept Singapore 117548 Singapore

ISBN: (纸本)9780769528410

An efficient way to improve the performance of a thin client system is to reduce the redundant screen update data sent across networks. While various optimization efforts have been made in this way, these optimization techniques cannot efficiently reduce long distance redundancies that may contain lots of network traffic. Long distance redundancies can be potentially reduced by a LZ compression algorithm with a large history buffer. However, a flat extension of the history buffer is not flexible and has scalability issue. In this paper, we present a different way to extend the history buffer and a history extension scheme based on it, aiming at minimizing long distance redundancies. We empirically studied the effectiveness of our scheme on some screen updates generated by one of the most bandwidth-effcient thin client system, Microsoft Terminal Service. The results show that this scheme can reduce tip to 9.39-23.3% network traffic for the tested data with a history buffer of 512K bytes. This scheme costs only a little additional computation and memory resources.

关键词： History Telecommunication traffic Network servers compression algorithms Costs Mice Encoding Distributed computing Computer networks Scalability

来源：评论

学校读者我要写书评

暂无评论

Parameterized lossy compression of order-independent data

Parameterized lossy compression of order-independent data

引用

IEEE International Conference on Electro-Information Technology

作者： Drew Colthorp Gregory Wolffe Atomic Object Grand Rapids MI USA School of Computing & Information Systems Grand Valley State University Allendale MI USA

When dealing with extremely large quantities of data, it is sometimes necessary to make concessions in order to compress the data to a manageable size, a technique known as lossy compression. One example of such a concession is perfect knowledge of the order in which each data element was recorded. When sampling a random variable, it is often the case that the values measured are more important than the order in which they appear. We have designed a lossy compression scheme that capitalizes on this fact by representing the order in which a sequence of values was measured with less precision than the values themselves. That is, the compressed data is very accurate and efficiently compressed when order is disregarded. Our algorithm works by encoding the measured values as a non-decreasing sequence and their order of appearance as indices referencing contiguous subsequences or slices of the value list. By changing the criteria used to determine a slice, the recorded order may be made more or less accurate, increasing or decreasing compression ratios respectively. Moreover, values in special ranges can be treated specially; for instance, statistical outliers might be represented exactly, whereas mundane values might be recorded with less precision.

关键词： Random variables Loss measurement Pulse modulation Sea measurements Management information systems Sampling methods Encoding Dictionaries Modulation coding compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Highly Efficient VQ-Based Normal Map compression using Quality Estimation Model

Highly Efficient VQ-Based Normal Map Compression using Quali...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： T. Yamasaki K. Aizawa Department of Information and Communication Engineering University of Tokyo Japan

Normal maps play an important role in computer 3D graphics to express pseudo roughness of the surface with a small amount of polygon data. In this paper, a highly efficient normal map compression algorithm is proposed based on an estimation model to predict the quality of the images rendered with the compressed normal maps. The optimal encoding is achieved by minimizing the predicted mean square error (MSE) employing vector quantization (VQ). In addition, encoding and decoding time is fast enough for practical usage. Experimental results demonstrate that the algorithm proposed in this paper yields better compression performance than the other algorithms in the literatures.

关键词： Image coding Encoding Computer graphics Rough surfaces Surface roughness compression algorithms Predictive models Rendering (computer graphics) Mean square error methods Vector quantization

来源：评论

学校读者我要写书评

暂无评论

On using lossless compression of debug data in embedded logic analysis

On using lossless compression of debug data in embedded logi...

引用

IEEE International Test Conference

作者： Ehab Anis Nicola Nicolici Department of Electrical and Computer Engineering McMaster University Hamilton ONT Canada

The capacity of on-chip trace buffers employed for embedded logic analysis limits the observation window of a debug experiment. To increase the debug observation window, we propose a novel architecture for embedded logic analysis based on lossless compression. The proposed architecture is particularly useful for in-field debugging of custom circuits that have sources of nondeterministic behavior such as asynchronous interfaces. In order to measure the tradeoff between the area overhead and the increase in the observation window, we also introduce a new compression ratio metric. We use this metric to quantify the performance gain of three lossless compression algorithms suitable for embedded logic analysis.

关键词： Logic Computer bugs Silicon Circuit testing compression algorithms Debugging Algorithm design and analysis Manufacturing Voltage Performance gain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：