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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

259 篇 期刊文献
218 篇 会议
15 篇 学位论文
1 篇 资讯

馆藏范围

493 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

444 篇 工学
- 269 篇 电气工程
- 235 篇 计算机科学与技术...
- 86 篇 信息与通信工程
- 54 篇 软件工程
- 31 篇 电子科学与技术（可...
- 17 篇 控制科学与工程
- 15 篇 机械工程
- 13 篇 仪器科学与技术
- 10 篇 测绘科学与技术
- 8 篇 材料科学与工程（可...
- 8 篇 生物医学工程（可授...
- 6 篇 力学（可授工学、理...
- 4 篇 交通运输工程
- 3 篇 网络空间安全
- 2 篇 航空宇航科学与技...
- 2 篇 环境科学与工程（可...
112 篇 理学
- 53 篇 物理学
- 48 篇 数学
- 6 篇 生物学
- 5 篇 地球物理学
- 3 篇 化学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 地理学
75 篇 医学
- 67 篇 临床医学
- 6 篇 特种医学
- 5 篇 基础医学(可授医学...
12 篇 管理学
- 10 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
4 篇 文学
- 2 篇 外国语言文学
1 篇 经济学
1 篇 农学
1 篇 艺术学

主题

493 篇 arithmetic codin...
67 篇 data compression
44 篇 compression
35 篇 huffman coding
31 篇 lossless compres...
26 篇 entropy coding
23 篇 image compressio...
20 篇 cabac
16 篇 context modeling
15 篇 image coding
14 篇 source coding
13 篇 video coding
13 篇 jpeg2000
12 篇 wavelet transfor...
12 篇 redundancy
12 篇 entropy
11 篇 compression rati...
11 篇 encoding
11 篇 quantization
10 篇 distributed sour...

机构

12 篇 brno university ...
8 篇 univ waterloo de...
5 篇 univ sci & techn...
4 篇 natl cheng kung ...
3 篇 univ melbourne d...
3 篇 zhejiang univ co...
3 篇 chongqing univ c...
3 篇 tsinghua univ de...
3 篇 microsoft res as...
3 篇 univ minnesota d...
3 篇 wuhan univ techn...
3 篇 hong kong univ s...
3 篇 city univ hong k...
3 篇 purdue univ dept...
2 篇 univ stuttgart i...
2 篇 princeton univ d...
2 篇 chaoyang univ te...
2 篇 cnr iroe nello c...
2 篇 shanghai jiao to...
2 篇 astar inst infoc...

作者

7 篇 yang eh
6 篇 grangetto marco
6 篇 wong kwok-wo
5 篇 liu dong
5 篇 magli enrico
5 篇 zhou jiantao
5 篇 zhou junwei
5 篇 moffat a
5 篇 shapira dana
5 篇 klein shmuel t.
5 篇 wu feng
5 篇 chen jianyong
5 篇 sze vivienne
4 篇 vitter js
4 篇 lin qiuzhen
4 篇 howard pg
4 篇 baronti s
4 篇 alparone l
4 篇 olmo gabriella
4 篇 masmoudi atef

语言

463 篇 英文
26 篇 其他
4 篇 中文

检索条件"主题词=arithmetic coding"

共 493 条记录，以下是381-390 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Review on Lossless Compression Techniques

Review on Lossless Compression Techniques

引用

International Conference on Computer Vision and Machine Learning (ICCVML)

作者： Kotha, Harika Devi Tummanapally, Madhumitha Upadhyay, Vikash Kumar ICFAI Fdn Higher Educ FST Dept ECE Hyderabad India

In the present world data compression is used in every field. Through data compression the bits required to represent a message will be reduced. By compressing the given data, we can save the storage capacity, files are transferred at high speed, storage hardware is decreased so that its cost is also decreased, and storage bandwidth is decreased. There are many methods to compress the data. But in this paper, we are discussing about Huffman coding and arithmetic coding. For various input streams we are comparing adaptive Huffman coding and arithmetic coding and we will observe which technique will be more efficient to compress the data.

关键词： Compression Huffman coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

An adaptable binary entropy coder

An adaptable binary entropy coder

引用

Data Compression Conference (DCC 2001)

作者： Kiely, A Klimesh, M CALTECH Jet Prop Lab Pasadena CA 91109 USA

ISBN: (纸本)0769510310

We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. The encoding is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy, and admits a simple and fast decoder. We discuss code design and performance estimation methods, as well as practical encoding and decoding algorithms.

关键词： Binary entropy coding ENCODER Statistical analysis decoding algorithm Source code Entropy coding arithmetic coding Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Color Image Compression Based on Wavelet Transform and Support Vector Regression WSVR for Color Image Compression 1

Color Image Compression Based on Wavelet Transform and Suppo...

引用

Conference on First International Image Processing, Applications and Systems

作者： Zikiou, Nadia Lahdir, Mourad Ameur, Soltane Univ Mouloud Mammeri UMMTO Dept Elect LAMPA Tizi Ouzou Algeria

ISBN: (纸本)9781479970698

Recent years have seen tremendous increase in the production, transportation and storage of color images. A new method for loss less image compression of color images is presented in this paper. This method is based on wavelet transform and support vector machines (SVM). The wavelet transform is applied to the luminance (Y) and chrominance (Cb, Cr) components of the original color image. Then SVM regression dependence could learn from training data and compression achieved using less training point (support vector) to represent the original data and eliminate redundancy. In addition, an effective entropy coder based on run-length and arithmetic encoders is used to encode vector and weight support. Our compression algorithm is applied to a test set of images of size 1024 * 1024 encoded on 24 bits. To evaluate our results, we calculated the peak signal noise ratio (PSNR) and their ratios datasets compression (CR). Experimental results show that the performance of the compression algorithm to achieve much improvement.

关键词： Color Image compression Wavelet Transform Support Vector Regression (SVR) Run-length arithmetic coding PSNR

来源：评论

学校读者我要写书评

暂无评论

Image Compression Using Two Dimensional Spherical Coder in Wavelet Lifting

Image Compression Using Two Dimensional Spherical Coder in W...

引用

1st International Conference on Computer Science, Engineering and Information Technology (CCSEIT 2011)

作者： Panimalar, S. Anisha, R. Gomathi, M. Manonmaniam Sundaranar Univ Tirunelveli India

ISBN: (纸本)9783642240423;9783642240430

In recent years, many wavelet coders that use various spatially adaptive coding technique to compress the image. Level of flexibility and the coding efficiency are two crucial issues in spatially adaptive methods. So in this paper "spherical coder" is introduced. The objective of this paper is to combine the spherical tree with the wavelet lifting technique and compare the performance of the spherical tree between the different coding technique such as arithmetic, Huffman and run length. The Comparison is made by using PSNR and Compression Ratio (CR). It is shown the Spherical tree in wavelet lifting with the arithmetic coder gives high CR value.

关键词： Discrete Wavelet Transform Wavelet Lifting Shperical Coder arithmetic coding Run length coding Huffman coding

来源：评论

学校读者我要写书评

暂无评论

A Memory Efficient and Continuous-valued Compact EDA for Large Scale Problems 12

A Memory Efficient and Continuous-valued Compact EDA for Lar...

引用

14th International Conference on Genetic and Evolutionary Computation Conference (GECCO)

作者： Rojas-Galeano, Sergio Rodriguez, Nestor Dist Univ Bogota Sch Engn Bogota Colombia

ISBN: (纸本)9781450311779

This paper considers large-scale OneMax and RoyalRoad optimization problems with up to 10(7) binary variables within a compact Estimation of Distribution Algorithms (EDA) framework. Building upon the compact Genetic Algorithm (cGA), the continuous domain Population-Based Incremental Learning algorithm (PBILc) and the arithmetic-coding EDA, we define a novel method that is able to compactly solve regular and noisy versions of these problems with minimal memory requirements, regardless of problem or population size. This feature allows the algorithm to be run in a conventional desktop machine. Issues regarding probability model sampling, arbitrary precision of the arithmetic-coding decompressing scheme, incremental fitness function evaluation and updating rules for compact learning, are presented and discussed.

关键词： EDA compact GA large scale optimization arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of arithmetic and Huffman Coder Applied to EZW Codec

Performance Comparison of Arithmetic and Huffman Coder Appli...

引用

2nd International Conference on Power, Control and Embedded Systems (ICPCES)

作者： Singh, Reena Srivastava, V. K.

ISBN: (纸本)9781467310499;9781467310475

In this paper, a performance comparison of an embedded zero tree wavelet (EZW) based codec is done on the basis of Huffman and arithmetic coding. The sub-band decomposition coefficients are coded into multilayer bit stream and then it is entropy coded using Huffman and arithmetic code. The comparison results shows that the arithmetic coded bit stream results in improved bit rate than Huffman coding at the same threshold.

关键词： Image compression embedded zero tree wavelets wavelet transform arithmetic coding Huffman coding

来源：评论

学校读者我要写书评

暂无评论

A COMPARISON OF CABAC THROUGHPUT FOR HEVC/H.265 VS. AVC/H.264

A COMPARISON OF CABAC THROUGHPUT FOR HEVC/H.265 VS. AVC/H.26...

引用

IEEE Workshop on Signal Processing Systems (SiPS)

作者： Sze, Vivienne Budagavi, Madhukar MIT Cambridge MA 02139 USA Texas Instruments Inc Cambridge MA USA

ISBN: (纸本)9781467362382

The CABAC entropy coding engine is a well known throughput bottleneck in the AVC/H.264 video codec. It was redesigned to achieve higher throughput for the latest video coding standard HEVC/H.265. Various improvements were made including reduction in context coded bins, reduction in total bins and grouping of bypass bins. This paper discusses and quantifies the impact of these techniques and introduces a new metric called Bjontegaard delta cycles (BD-cycle) to compare the CABAC throughput of HEVC vs. AVC. BD-cycle uses the Bjontegaard delta measurement method to compute the average difference between the cycles vs. bit-rate curves of HEVC and AVC. This metric is useful for estimating the throughput of an HEVC CABAC engine from an existing AVC CABAC design for a given bit-rate. Under the common conditions set by the JCT-VC standardization body, HEVC CABAC has an average BD-cycle reduction of 31.1% for all intra, 24.3% for low delay, and 25.9% for random access, when processing up to 8 bypass bins per cycle.

关键词： HEVC H.265 AVC H.264 CABAC throughput arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Comparison of Minimum Spanning Tree reordering with Bias-Adjusted reordering for lossless compression of 3D ultraspectral sounder data

Comparison of Minimum Spanning Tree reordering with Bias-Adj...

引用

Conference on Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII

作者： Ahuja, Alok Huang, Bormin Goldberg, Mitchell D. Univ Wisconsin CIMSS Madison WI USA NOAA Natl Environm Satellite Data & Informat Serv Silver Spring MD 20910 USA

ISBN: (纸本)0819462896

The ultraspectral sounder data features strong correlations in disjoint spectral regions due to the same type of absorbing gases. This paper compares the compression performance of two robust data preprocessing schemes, namely Bias-Adjusted reordering (BAR) and Minimum Spanning Tree (MST) reordering, in the context of entropy coding. Both schemes can take advantage of the strong correlations for achieving higher compression gains. The compression methods consist of the BAR or MST preprocessing schemes followed by linear prediction with context-free or context-based arithmetic coding (AC). Compression experiments on the NASA AIRS ultraspectral sounder data. set show that MST without bias-adjustment produces lower compression ratios than BAR and bias-adjusted MST for both context-free and context-based AC. Bias-adjusted MST outperforms BAR for context-free arithmetic coding, whereas BAR outperforms MST for context-based arithmetic coding. BAR with context-based AC yields the highest average compression ratios in comparison to MST with context-free or context-based AC.

关键词： ultraspectral sounder data compression bias-adjusted reordering minimum spanning tree arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

A Fast, Efficiency-Preserving System for Simultaneous Compression & Encryption

A Fast, Efficiency-Preserving System for Simultaneous Compre...

引用

Conference on Mobile Multimedia/Image Processing, Security, and Applications 2011

作者： Metzler, Richard E. L. Agaian, Sos S. Univ Texas San Antonio Dept Elect & Comp Engn San Antonio TX 78249 USA

ISBN: (纸本)9780819486370

Methods for embedment of stream cipher rules into compressive Elias-type entropy coders are presented. Such systems have the ability to simultaneously compress and encrypt input data;thereby providing a fast and secure means for data compression. Procedures for maintaining compressive performance are articulated with focus on further compression optimizations. Furthermore, a novel method is proposed which exploits the compression process to hide cipherstream information in the case of a known plaintext attack. Simulations were performed on images from a variety of classes in order to grade and compare the compressive and computational costs of the novel system relative to traditional compression-followed-by-encryption methods.

关键词： Compression encryption stream cipher security arithmetic coding range coding Elias coding concryption

来源：评论

学校读者我要写书评

暂无评论

SQUISH: Near-Optimal Compression for Archival of Relational Datasets 16

SQUISH: Near-Optimal Compression for Archival of Relational ...

引用

22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)

作者： Gao, Yihan Parameswaran, Aditya Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9781450342322

Relational datasets are being generated at an alarmingly rapid rate across organizations and industries. Compressing these datasets could significantly reduce storage and archival costs. Traditional compression algorithms, e.g., gzip, are suboptimal for compressing relational datasets since they ignore the table structure and relationships between attributes. We study compression algorithms that leverage the relational structure to compress datasets to a much greater extent. We develop SQUISH, a system that uses a combination of Bayesian Networks and arithmetic coding to capture multiple kinds of dependencies among attributes and achieve near-entropy compression rate. SQUISH also supports user-defined attributes: users can instantiate new data types by simply implementing five functions for a new class interface. We prove the asymptotic optimality of our compression algorithm and conduct experiments to show the effectiveness of our system: SQUISH achieves a reduction of over 50% in storage size relative to systems developed in prior work on a variety of real datasets.

关键词： arithmetic coding bayesian network lossy compression data compression

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共50页 << < 35 36 37 38 39 40 41 42 43 44 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：