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

38th Annual Conference on IEEE-Industrial-Electronics-Society (IECON )

作者： Kelkar, Supriya Rajkamal Cummins Coll Engn Women Pune Maharashtra India Devi Ahilya Vishwa Vidyalaya Sch Elect Indore India

ISBN: (纸本)9781467324212

The present day automotives have variety of attractive features. Incorporating these features is possible with more electronics or embedded systems inside the vehicle. Controller Area Network (CAN) protocol offers low cost solution for communication between these embedded systems. These embedded systems communicate on CAN bus via message passing. With limited speed and bandwidth offered by CAN, there are limitations in communication. One of the solutions to overcome these limitations is the use of Data-Reduction (DR) algorithms or techniques. These algorithms make it possible to send fewer amount of data in the given time, thus reducing the bandwidth per message. This paper develops an alternative approach to data reduction technique called Quotient Remainder compression (QRC) algorithm. It provides double or at least equal range to the variation in the parameter as compared to the Enhanced Data Reduction (EDR) algorithm. The compression ratio of QRC is comparable to the earlier algorithms.

关键词： compression algorithms Data Reduction Automotive Applications Controller Area Network Protocol (CAN)

来源：评论

学校读者我要写书评

暂无评论

Hybrid Pixel Encoding: An Effective Display Frame compression Algorithm for HD Video Decoder

Hybrid Pixel Encoding: An Effective Display Frame Compressio...

引用

15th IEEE International Conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Li, Yifu Wang, Wenxiang Zhang, Guangfei Loongson Technol Corp Ltd Beijing 100190 Peoples R China Grad Univ Chinese Acad Sci Beijing 100149 Peoples R China Chinese Acad Sci ICT State Key Lab Comp Architect Beijing 100190 Peoples R China

ISBN: (纸本)9781467351652;9780769549149

High definition (HD) video decoder processes a great amount of data within a bounded time and thus requires high memory bandwidth. The memory bandwidth will dominate system performance, especially in embedded systems. In this paper, we propose a lossless hybrid display frame compression algorithm called HPE (Hybrid Pixel Encoding) for HD video decoder considering high compression performance and real time operation. The algorithm combines dictionary coding and run length coding to achieve a low compression ratio. We integrate the proposed design into an H. 264 decoder. Experimental results show that the proposed algorithm gains 67.7% of data reduction ratio on average when decoding 1080-HD video. It is much more effective than all previous works.

关键词： high definition video decoders memory bandwidth low compression ratio compression algorithms Embedded systems deceleration rate System performance pixel

来源：评论

学校读者我要写书评

暂无评论

Tiled Image Container for Web Compatible Compound Image compression

Tiled Image Container for Web Compatible Compound Image Comp...

引用

8th International Conference on Signal Image Technology and Internet Based Systems (SITIS)

作者： Kuruvilla, Ashok Mathew Adobe Syst Inc San Jose CA 95110 USA

ISBN: (纸本)9780769549118

Encoding images containing mixed content in web compatible formats like PNG, GIF and JPEG poses challenges in maintaining the quality along with good compression. In this paper, we describe a method for improving the compression of web compatible compound images while retaining high quality. The proposed method is based on the principle that the compression ratio of a given image depends upon both the image content and the compression algorithm used. Therefore, encoding various tiled regions in a given image with the algorithm appropriate to the content in the region improves the overall compression of the image. Further optimizations like sharing of indexed colors between the various tiles in the same image and removal of duplicate tiles improve the compression. This method would support both lossy and lossless compression. The resulting encoded data can be rendered by a web browser supporting CSS background-cropping or HTML5 canvas APIs.

关键词： compression algorithms Web and internet services Image quality

来源：评论

学校读者我要写书评

暂无评论

Interactive compression algorithms for Streaming Media Over High Speed Networks

Interactive Compression Algorithms for Streaming Media Over ...

引用

International Conference on Telecommunications and Networking/International Conference on Industrial Electronics, Technology and Automation

作者： Psannis, Kostas E. Univ Macedonia Dept Technol Management Thessaloniki Greece

ISBN: (纸本)9781402087363

This paper presents interactive compression algorithms for streaming media over high speed networks. An MPEG coded media sequence is typically partitioned into small intervals called GoP (Group Of Pictures). This structure allows a simple realization of forward (normal)-pay operation but imposes several additional constraints on the other interactive functions. Implementation of the rewind operations requires that the decoder either decodes the whole GoP and store it, or it decodes the GoP up to the current frame to be displayed. Both of these techniques lead either to the requirement for large storage at the client machine (to store a fully decoded GoP) or massive decoding processing power (to full), decode a GoP at required displayed frame rate). Neither of these options is desirable. Furthermore, Fast Play (Fast Forward/Jump Forward) functions of MPEG coded video present are problematic. When a P-/B-frame is requested, all the related previous P-/I-frames need to be sent over the network. This is likely to lead in considerable increase in communication bandwidth and decoding power compared to the normal-play mode. Several interactive algorithms are detailed with respect to server load /network bandwidth and decoder complexity. Finally an extensive comparative study has been carried out in order to determine the trade offs of the proposed approaches.

关键词： compression algorithms Interactive Video VCR functionality Streaming Interactive Media

来源：评论

学校读者我要写书评

暂无评论

ADAPTING BOYER-MOORE-LIKE algorithms FOR SEARCHING HUFFMAN ENCODED TEXTS

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2012年第2期23卷 343-356页

作者： Cantone, Domenico Faro, Simone Giaquinta, Emanuele Univ Catania Dipartimento Matemat & Informat Viale A Doria 6 I-95125 Catania Italy

In this paper we propose an efficient approach to the compressed string matching problem on Huffman encoded texts, based on the BOYER-MOORE strategy. Once a candidate valid shift has been located, a subsequent verification phase checks whether the shift is codeword aligned by taking advantage of the skeleton tree data structure. Our approach leads to algorithms that exhibit a sublinear behavior on the average, as shown by extensive experimentation.

关键词： String matching compression algorithms Huffman coding Boyer-Moore algorithm text processing information retrieval

来源：评论

学校读者我要写书评

暂无评论

CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy

CLUE: Achieving Fast Update over Compressed Table for Parall...

引用

32nd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Yang, Tong Duan, Ruian Lu, Jianyuan Zhang, Shenjiang Dai, Huichen Liu, Bin Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781457702952

The sizes of routing table in backbone routers continue to keep a rapid growth and some of them currently increase up to 400K entries [1]. An effective solution to deflate the large table is the routing table compression. Meanwhile, there is an increasingly urgent demand for fast routing update mainly due to the change of network topology and new emerging Internet functionalities. Furthermore, the Internet link transmission speed has scaled up to 100Gbps commercially and towards 400Gbps Ethernet for laboratory experiments, resulting in a raring need of ultra-fast routing lookup. To achieve high performance, backbone routers must gracefully handle the three issues simultaneously: routing table compression, fast routing Lookup, and fast incremental UpdatE (CLUE), while previous works often only concentrate on one of the three dimensions. To address these issues, we propose a complete set of solutions-CLUE, by improving previous works and adding a novel incremental update mechanism. CLUE consists of three parts: a routing table compression algorithm, an improved parallel lookup mechanism, and a new fast incremental update mechanism. The routing table compression algorithm is based on ONRTC algorithm [2], a base for fast TCAM parallel lookup and fast update of TCAM. The second part is the improvement of the logical caching scheme for dynamic load balancing parallel lookup mechanism [3]. The third one is the conjunction of the trie, TCAM and redundant prefixes update algorithm. We analyze the performance of CLUE by mathematical proof, and draw the conclusion that speedup factor is proportional to the hit rate of redundant prefixes in the worst case, which is also confirmed by experimental results. Large-scale experimental results show that, compared with the mechanism in [3], CLUE only needs about 71% TCAM entries, 4.29% update time, and 3/4 dynamic redundant prefixes for the same throughput when using four TCAMs. In addition, CLUE has another advantage over the mechanis

关键词： route list backbone router Telecommunications Access Method hit rate Fasting refresh time speedup factor Redundant formal proof control surfaces compression algorithms

来源：评论

学校读者我要写书评

暂无评论

An Adaptive, Scalable, and Portable Technique for Speeding Up MPI-Based Applications

引用

18th International Conference on Euro-Par Parallel Processing

作者： Filgueira, Rosa Atkinson, Malcolm Nunez, Alberto Fernandez, Javier Univ Edinburgh Sch Informat Edinburgh EH8 9AB Midlothian Scotland Univ Complutense Madrid Dept Sistemas Informat Computac Madrid 28040 Spain Univ Carlos III Madrid Dept Arquitectura Comp Leganes 3028911 Spain

ISBN: (纸本)9783642328206

This paper presents a portable optimization for MPI communications, called PRAcTICaL-MPI (Portable Adaptive compression Library- MPI). PRAcTICaL-MPI reduces the data volume exchanged among processes by using lossless compression and offers two main advantages. Firstly, it is independent of the MPI implementation and the application used. Secondly, it allows for turning the compression on and off and selecting the most appropriate compression algorithm at runtime, depending on the characteristics of each message and on network performance. We have validated PRAcTICaL-MPI in different MPI implementations and HPC clusters. The evaluation shows that compressing MPI messages with the best algorithm and only when it is worthwhile, we obtain a great reduction in the overall execution time for many of the scenarios considered.

关键词： MPI Library Parallel techniques High-Performance Computing compression algorithms Adaptive systems Portable optimizations

来源：评论

学校读者我要写书评

暂无评论

Systematic Approaches for PI System ™ Data compression Tuning

引用

IFAC Proceedings Volumes 2012年第15期45卷 309-313页

作者： Rodrigo P. Silveira Jorge O. Trierweiler Marcelo Farenzena Herbert C. Teixeira Departamento de Engenharia Química Escola de Engenharia Universidade Federal do Rio Grande do Sul Brazil (Tel: +55 51 3308-4167) Centro de Pesquisas e Desenvolvimento Leopoldo Américo M. de Mello (CENPES) PETROBRAS Brazil

The consolidation of automation in the process industry has brought a challenge: translate the large volume of data in useful information. The algorithms for plant data compression emerge as an alternative to reduce the space demanded by such information. On the other hand, they should preserve the important features that data hold. PI ™ ( Plant Information , OSIsoft ® ) is a virtual tool structured to automate the collection, historization and displaying data of companies. Nevertheless, the efficiency of the compression algorithm used in this system is often not satisfactory, because of poor tuning. This paper presents two methodologies to automate the tuning of process parameters for data compression of PI ™ , based on a representative dataset extracted from the measurements. The applicability of the proposed techniques is corroborated by several case studies.

关键词： data compression data storage compression algorithms piecewise linear global optimization

来源：评论

学校读者我要写书评

暂无评论

A New Chaos-Based Image-Encryption and compression Algorithm

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2012年第unknown期2012卷 179693.1-179693.11页

作者： Al-Maadeed, Somaya Al-Ali, Afnan Abdalla, Turki Qatar Univ Dept Comp Sci & Engn POB 2713 Doha Qatar Univ Basrah Coll Engn Dept Comp Engn Basrah Iraq

We propose a new and efficient method to develop secure image-encryption techniques. The new algorithm combines two techniques: encryption and compression. In this technique, a wavelet transform was used to decompose the image and decorrelate its pixels into approximation and detail components. The more important component (the approximation component) is encrypted using a chaos-based encryption algorithm. This algorithm produces a cipher of the test image that has good diffusion and confusion properties. The remaining components (the detail components) are compressed using a wavelet transform. This proposed algorithm was verified to provide a high security level. A complete specification for the new algorithm is provided. Several test images are used to demonstrate the validity of the proposed algorithm. The results of several experiments show that the proposed algorithm for image cryptosystems provides an efficient and secure approach to real-time image encryption and transmission.

关键词： Secure compression algorithms Security level approximation pixel encryption algorithm images algorithms cryptography Imagery (Psychotherapy) wavelet transforms Image

来源：评论

学校读者我要写书评

暂无评论

Tiled Image Container for Web Compatible Compound Image compression

Tiled Image Container for Web Compatible Compound Image Comp...

引用

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Ashok Mathew Kuruvilla Adobe Systems Inc.

Encoding images containing mixed content in web compatible formats like PNG, GIF and JPEG poses challenges in maintaining the quality along with good compression. In this paper, we describe a method for improving the compression of web compatible compound images while retaining high quality. The proposed method is based on the principle that the compression ratio of a given image depends upon both the image content and the compression algorithm used. Therefore, encoding various tiled regions in a given image with the algorithm appropriate to the content in the region improves the overall compression of the image. Further optimizations like sharing of indexed colors between the various tiles in the same image and removal of duplicate tiles improve the compression. This method would support both lossy and loss less compression. The resulting encoded data can be rendered by a web browser supporting CSS background-cropping or HTML5 canvas APIs.

关键词： Tiles Image coding Image color analysis Transform coding compression algorithms Compounds Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：