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

2014 International Conference on Vehicle,Mechanical and Electrical Engineering(ICVMEE 2014)

作者： Yi Liu ZhiJun Cen Jia Liu School of Jilin Agricultural University

Analyzes the basic principles of H.264 video compression algorithm,such as integer DCT,multiple reference frame motion estimation,intra prediction,inter prediction;describes the characteristics of embedded systems,propose a feasible method of video signal optimization,by comparing with the experimental results,the influence of the H.264 coding bit rate bottleneck optimization function obtains a good *** methods and ideas have practical significance,and it provides a strong reference for other development of video systems.

关键词： H264 Embedded compression algorithms Video

来源：评论

学校读者我要写书评

暂无评论

Graph-Cut-based compression Algorithm for Compressed-Sensed Image Acquisition

Graph-Cut-based Compression Algorithm for Compressed-Sensed ...

引用

Signal Processing and Communications Applications Conference

作者： Julide Gulen Alaydin Seden Hazal Gulen Maria Trocan Behcet Ugur Toreyin Cankaya University Institut Superieur d'Electronique de Paris

ISBN: (纸本)9781479948734

The purpose of the paper is to find the best quantizer allocation for compressed-sensed acquired images, by using a graph-cut quantizer allocation method. The compressed sensed acquisition is realized in a block-based manner, using a random projection matrix, and on the obtained block measurements a graph-cut-based quantizer allocation method is applied, in order to further reduce the bitrate associated to the measurements. Finally, the quantized measurements are reconstructed using a Smooth Projected Landweber recovery method. The proposed compression method for compressed sensed acquisition shows better results when compared to JPEG2000.

关键词： Bit rate quantizer JPEG compression algorithms image samples COMPRESSED

来源：评论

学校读者我要写书评

暂无评论

A compression Framework for Triangulated 3-D Meshes

A Compression Framework for Triangulated 3-D Meshes

引用

10th Annual Conference of the IEEE-India-Council (INDICON)

作者： Sheker, C. Gupta, Sumana Indian Inst Technol Dept Elect Engn Kanpur 208016 Uttar Pradesh India

ISBN: (纸本)9781479922741;9781479922758

In 3-D animations and graphics, triangulated meshes play an important role to build 3-D surfaces of simple objects as well as complex objects. Generally meshes require a huge amount of data for storage and transmission. Consequently, compression of 3-D meshes. In this paper geometry and connectivity data are compressed seperately. Although connectivity data is compressed independently, the geometry compression uses connectivity data. For geometry data, we propose a compression technique using projection and connectivity guided prediction. The 3D mesh is transformed into two 2D images and standard image processing techniques are applied to obtain compression. We used JPEG coding for compression of images. For connectivity data, we present a new compression algorithm, based on the idea of making strips. The algorithm first encodes the connectivity information of mesh into a output text file which is half in size compared to the original mesh size. This is done by using recursion and stack operations. These text files can be further compressed into rar file or strip file resulting in faster transmission and rendering of complex graphical objects.

关键词： Text files Meshes compression algorithms image processing techniques Three Dimensions triangularization compression Stack operations connectivity two dimentional images

来源：评论

学校读者我要写书评

暂无评论

A Simple Desktop compression and Streaming System

A Simple Desktop Compression and Streaming System

引用

15th IEEE International Symposium on Multimedia (ISM)

作者： Hadzic, Ilija Woithe, Hans C. Carroll, Martin D. Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)9780769551401

We present a compression algorithm and a streaming protocol designed for streaming of computer-desktop graphics. The encoder has low memory requirements and can be broken into a large number of independent contexts with a high degree of data locality. The encoder also uses only simple arithmetic, which makes it amenable to hardware or highly parallel software implementation. The decoder is trivial and requires no memory, which makes it suitable for use on devices with limited computing capabilities. The streaming protocol runs over UDP and has its own unique error recovery mechanism specifically designed for interactive applications.

关键词： Computer graphics compression algorithms Video codecs Streaming media Transport protocols

来源：评论

学校读者我要写书评

暂无评论

Edge Mining the Internet of Things

引用

IEEE SENSORS JOURNAL 2013年第10期13卷 3816-3825页

作者： Gaura, Elena I. Brusey, James Allen, Michael Wilkins, Ross Goldsmith, Dan Rednic, Ramona Coventry Univ Dept Syst Engn Cogent Comp Coventry CVL 5FB W Midlands England

This paper examines the benefits of edge mining-data mining that takes place on the wireless, battery-powered, and smart sensing devices that sit at the edge points of the Internet of Things. Through local data reduction and transformation, edge mining can quantifiably reduce the number of packets that must be sent, reducing energy usage, and remote storage requirements. In addition, edge mining has the potential to reduce the risk in personal privacy through embedding of information requirements at the sensing point, limiting inappropriate use. The benefits of edge mining are examined with respect to three specific algorithms: linear Spanish inquisition protocol (L-SIP), ClassAct, and bare necessities (BN), which are all instantiations of general SIP. In general, the benefits provided by edge mining are related to the predictability of data streams and availability of precise information requirements;results show that L-SIP typically reduces packet transmission by around 95% (20-fold), BN reduces packet transmission by 99.98% (5000-fold), and ClassAct reduces packet transmission by 99.6% (250-fold). Although energy reduction is not as radical because of other overheads, minimization of these overheads can lead up to a 10-fold battery life extension for L-SIP, for example. These results demonstrate the importance of edge mining to the feasibility of many IoT applications.

关键词： compression algorithms data compression wireless sensor networks body sensor networks

来源：评论

学校读者我要写书评

暂无评论

A new complexity measure for time series analysis and classification

引用

EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS 2013年第3-4期222卷 847-860页

作者： Nagaraj, Nithin Balasubramanian, Karthi Dey, Sutirth Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Kollam 690525 Kerala India Indian Inst Sci Educ & Res Div Biol Pune 411021 Maharashtra India Natl Inst Adv Studies Sch Nat Sci & Engn Adjunct Fac Bangalore 560012 Karnataka India

Complexity measures are used in a number of applications including extraction of information from data such as ecological time series, detection of non-random structure in biomedical signals, testing of random number generators, language recognition and authorship attribution etc. Different complexity measures proposed in the literature like Shannon entropy, Relative entropy, Lempel-Ziv, Kolmogrov and Algorithmic complexity are mostly ineffective in analyzing short sequences that are further corrupted with noise. To address this problem, we propose a new complexity measure ETC and define it as the "Effort To Compress" the input sequence by a lossless compression algorithm. Here, we employ the lossless compression algorithm known as Non-Sequential Recursive Pair Substitution (NSRPS) and define ETC as the number of iterations needed for NSRPS to transform the input sequence to a constant sequence. We demonstrate the utility of ETC in two applications. ETC is shown to have better correlation with Lyapunov exponent than Shannon entropy even with relatively short and noisy time series. The measure also has a greater rate of success in automatic identification and classification of short noisy sequences, compared to entropy and a popular measure based on Lempel-Ziv compression (implemented by Gzip).

关键词： complexity ETC classification Input sequence Complexity compression algorithms entropy time series analysis Algorithmic complexity Electron transport chain Lempel-Ziv Time series European territorial cooperation Automatic toll collection

来源：评论

学校读者我要写书评

暂无评论

ODC: Frame for definition of Dense codes

引用

EUROPEAN JOURNAL OF COMBINATORICS 2013年第1期34卷 52-68页

作者： Prochazka, Petr Holub, Jan Czech Tech Univ Dept Theoret Comp Sci FIT Prague 16000 6 Czech Republic

Natural language compression has made great progress in the last two decades. The main step in this evolution was the introduction of word-based compression by Moffat. Another improvement came with so-called Dense codes, which proved to be very fast in compression and decompression while keeping a good compression ratio and direct search capability. Many variants of the Dense codes have been described, each of them using its own definition. In this paper, we present a generalized concept of dense coding called Open Dense Code (ODC), which aims to be a frame for the definition of many other dense code schemas. ODC underlines common features of the dense code schemas but at the same time allows one to express the divergences of each of them. Using the frame of ODC, we present two new word-based statistical compression algorithms based on the dense coding idea: Two Byte Dense Code (TBDC) and Self-Tuning Dense Code (STDC). Our algorithms improve the compression ratio and are considerate to smaller files, which are very often omitted by other compressors. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： compression ratio compression algorithms Dense Codes compression

来源：评论

学校读者我要写书评

暂无评论

On the Use of compression algorithms for Network Anomaly Detection

On the Use of Compression Algorithms for Network Anomaly Det...

引用

IEEE International Conference on Communications

作者： Christian Callegari Stefano Giordano Michele Pagano Department of Information Engineering University of Pisa Italy

In the last few years, the number and impact of security attacks over the Internet have been continuously increasing. Since it seems impossible to guarantee complete protection to a system by means of the "classical" prevention mechanisms, the use of Intrusion Detection Systems has emerged as a key element in network security. In this paper we address the problem considering some techniques for detecting network anomalies. Our approach is based on the use of different compression algorithms for detecting anomalies in the network traffic running over TCP. In more detail we take into account the use of three different compression algorithms, based on distinct approaches, namely: Huffman coding, Dynamic Markov Coding, and Lempel-Ziv-Welch algorithm. The proposed methods are based on the consideration that the entropy represents a lower bound to the compression rate that we can obtain, and that the more redundant the data are and the better we can compress them. The performance analysis, presented in this paper, demonstrates the effectiveness of the proposed methods.

关键词： compression algorithms Intrusion detection Image coding Data security Protection Huffman coding Entropy Internet Cryptography Communications Society

来源：评论

学校读者我要写书评

暂无评论

On the use of compression algorithms for the classification of IP flows

On the use of compression algorithms for the classification ...

引用

International Symposium on Performance Evaluation of Computer & Telecommunication Systems SPECTS

作者： D. Adami C. Callegari S. Giordano M. Pagano F. Russo Department of Information Engineering University of Pisa Italy

In the last few years, the classification of IP traffic flows according to application level protocols has emerged as a key issue for the design and development of multiservice IP networks. Several proposals have been made to address this problem and to enhance such systems, but to the best of our knowledge none of them is suitable for reliably identifying the application that generated the IP traffic. This paper introduces a new approach, based on the use of compression algorithms, which can be used to classify applications running over TCP. Three different compression algorithms are taken into consideration and applied to real traffic traces, so as to demonstrate the effectiveness of the proposed method and to evaluate the performance.

关键词： compression algorithms Telecommunication traffic Entropy Protocols IP networks TCPIP Resource management Electronic mail Communication system traffic control Traffic control

来源：评论

学校读者我要写书评

暂无评论

Power Aware Transformation of Bandlimited Signals

Power Aware Transformation of Bandlimited Signals

引用

IEEE 26th International System-on-Chip Conference (SOCC)

作者： Krishnamoorthy, Prakash Tekumalla, Ramesh LSI Corp APAC SOC Design Allentown PA 18109 USA LSI Corp APAC SOC Dev Allentown PA 18109 USA

ISBN: (纸本)9781479911660

This work presents an universal, lossless, linear, low complexity data transformation algorithm based on the sampling theorem that significantly reduces the complexity of operations in data processing systems. While many lossy and lossless compression methods are in existence, the data compressed by such methods cannot be directly processed by signal processing systems without decompression due to the non linear nature of most data compression algorithms. If there were linear compression method in existence, then compressed data could directly be passed to digital signal processing systems. Doing so significantly reduces the complexity of signal processing operations including additional benefits in the form of reduced power dissipation, improved signal integrity and better bandwidth utilization. This approach can be used in applications for the storage and retrieval of data from storage mediums such as read channels, system and processor interconnects including memory buses. System level simulations show that this method not only reduces the amount of data, but also improves performance due to improved signal integrity and significant reduction in power dissipation (upto 15% reduction) associated with the processing of multimedia content.

关键词： bandlimited signals Signal Processing Worksystem Signal integrity Power dissipation compression algorithms Data compression lossless compression signal processing Complexity Decompression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：