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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,861 篇 会议
218 篇 期刊文献
3 篇 学位论文

馆藏范围

2,082 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

547 篇 工学
- 276 篇 计算机科学与技术...
- 264 篇 电气工程
- 132 篇 信息与通信工程
- 84 篇 软件工程
- 40 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 29 篇 仪器科学与技术
- 23 篇 生物医学工程（可授...
- 16 篇 机械工程
- 12 篇 测绘科学与技术
- 8 篇 网络空间安全
- 7 篇 生物工程
- 6 篇 航空宇航科学与技...
- 5 篇 交通运输工程
- 4 篇 光学工程
- 3 篇 土木工程
67 篇 理学
- 22 篇 数学
- 19 篇 系统科学
- 11 篇 物理学
- 9 篇 地球物理学
- 7 篇 生物学
- 2 篇 天文学
- 2 篇 地理学
- 2 篇 海洋科学
61 篇 医学
- 51 篇 临床医学
- 9 篇 基础医学(可授医学...
- 5 篇 特种医学
36 篇 管理学
- 35 篇 管理科学与工程(可...
12 篇 文学
- 12 篇 新闻传播学
5 篇 农学
- 4 篇 作物学
3 篇 艺术学
2 篇 军事学
1 篇 经济学

主题

2,082 篇 compression algo...
649 篇 image coding
492 篇 data compression
284 篇 encoding
219 篇 transform coding
218 篇 decoding
203 篇 algorithm design...
164 篇 dictionaries
155 篇 bandwidth
148 篇 video compressio...
142 篇 computer science
141 篇 hardware
130 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
100 篇 costs
99 篇 quantization
99 篇 discrete cosine ...
96 篇 pixel

机构

9 篇 hewlett packard ...
6 篇 school of electr...
5 篇 department of co...
5 篇 technion israel ...
5 篇 department of el...
5 篇 david samoff res...
5 篇 microsoft resear...
5 篇 institute of com...
4 篇 information syst...
4 篇 faculty of scien...
4 篇 university of ca...
4 篇 school of inform...
4 篇 univ las palmas ...
4 篇 institute of sig...
4 篇 department of el...
4 篇 xerox corporatio...
4 篇 department of el...
4 篇 department of co...
4 篇 department of co...
4 篇 department of el...

作者

9 篇 a. mukherjee
8 篇 en-hui yang
7 篇 w. wolf
6 篇 m. vetterli
6 篇 radu rădescu
6 篇 h. lekatsas
5 篇 chulhee lee
5 篇 k. sayood
5 篇 p.l. dragotti
5 篇 xiaolin wu
5 篇 martin burtscher
5 篇 barrios yubal
5 篇 a. ortega
5 篇 n. chaddha
5 篇 sarmiento robert...
5 篇 yuan xie
5 篇 d. kirovski
4 篇 beatrice arvinti
4 篇 jan platos
4 篇 s. dandapat

语言

2,054 篇 英文
14 篇 中文
13 篇 其他

检索条件"主题词=Compression Algorithms"

共 2082 条记录，以下是1881-1890 订阅

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

详细简洁

排序：

A pyramid algorithm for fast fractal image compression

A pyramid algorithm for fast fractal image compression

引用

IEEE International Conference on Image Processing

作者： H. Lin A.N. Venetsanopoulos Department of Electrical and Computer Engineering University of Toronto Toronto ONT Canada University of Toronto Toronto ON CA Dept. of Electr. & Comput. Eng. Toronto Univ. Ont. Canada

We present a fast fractal image encoding algorithm which is based on a refinement of the fractal code from an initial coarse level of the pyramid. The pyramid search algorithm is quasi-optimal in terms of minimizing the mean square error. Assuming that the distribution of the matching error is described by an independent, identically distributed (i.i.d.) Laplacian random process, we derive the threshold sequence for the objective function in each pyramidal level. The computational efficiency depends on the depth of the pyramid and the search step size and could be improved up to two orders of magnitude compared with the full search of the original image.

关键词： Fractals Image coding Image resolution Electronic mail Mean square error methods Laplace equations Random processes Computational efficiency Redundancy compression algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved hierarchical lossless text compression algorithm

An improved hierarchical lossless text compression algorithm

引用

Data compression Conference (DCC)

作者： Chia-Yuan Teng D.L. Neuhoff Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Several improvements to the Bugajski-Russo N-gram algorithm are proposed. When applied to English text these result in an algorithm with comparable complexity and approximately 10 to 30% less rate than the commonly us... 详细信息

关键词： compression algorithms Dictionaries Encoding Hydrogen

来源：评论

学校读者我要写书评

暂无评论

Extending Huffman coding for multilingual text compression

Extending Huffman coding for multilingual text compression

引用

Data compression Conference (DCC)

作者： Chi-Hung Chi Chi-Kwun Kan Kwok-Shing Cheng Ling Wong Department of Computer Science Chinese University of Hong Kong Sha Tin Hong Kong China

ISBN: (纸本)0818670126

Summary form only given. We propose two new algorithms that are based on the 16-bit or 32-bit sampling character set and on the unique features of languages with a large number of distinct characters to improve the data compression ratios for multilingual text documents. We choose Chinese language using 16 bit character sampling as the representative language in our study. The first approach, called the static Chinese Huffman coding, introduces the concept of a single Chinese character in the Huffman tree. Experimental results showed that the improvement in compression ratio obtained. The second approach, called the dictionary-based Chinese Huffman coding, includes the concept of Chinese words in the Huffman coding.

关键词： Huffman coding Sampling methods Natural languages compression algorithms Data compression Dictionaries Computer science

来源：评论

学校读者我要写书评

暂无评论

Modeling word occurrences for the compression of concordances

Modeling word occurrences for the compression of concordance...

引用

Data compression Conference (DCC)

作者： A. Bookstein S.T. Klein T. Raita P. Lankinen C.W. Sze Center for Information and Language Studies University of Chicago Chicago IL USA Department of Mathematics & CS Bar-llan University Ramat-Gan Israel Department of Computer Science University of Turku Turku Finland Department of Computer Science University of Chicago Chicago IL

Summary form only given. Effective compression of a text-based information retrieval system involves compression not only the text itself, but also of the concordance by which one accesses that text and which occupies an amount of storage comparable to the text itself. The concordance can be a rather complicated data structure, especially if it permits hierarchical access to the database. But one or more components of the hierarchy can usually be conceptualized as a bit-map. We conceptualize our bit-map as being generated as follows. At any bit-map site we are in one of two states: a cluster state (C), or a between-cluster state (B). In a given state, we generate a bit-map-value of zero or one and, governed by the transition probabilities of the model, enter a new state as we move to the next bit-map site. Such a model has been referred to as a hidden Markov model in the literature. Unfortunately, this model is analytically difficult to use. To approximate it, we introduce several traditional Markov models with four states each, B and C as above, and two transitional states. We present the models, show how they are connected, and state the formal compression algorithm based on these models. We also include some experimental results.

关键词： Hidden Markov models Computer science Databases Information retrieval Data structures compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Subband coding methods for seismic data compression

Subband coding methods for seismic data compression

引用

Data compression Conference (DCC)

作者： A. Kiely F. Pollara Jet Propulsion Laboratory California Institute of Technology Pasadena CA USA

Summary form only given. A typical seismic analysis scenario involves collection of data by an array of seismometers, transmission over a channel offering limited data rate, and storage of data for analysis. Seismic data analysis is performed for monitoring earthquakes and for planetary exploration as in the planned study of seismic events on Mars. Seismic data compression systems are required to cope with the transmission of vast amounts of data over constrained channels and must be able to accurately reproduce occasional high energy seismic events. We propose a compression algorithm that includes three stages: a decorrelation stage based on subband coding, a quantization stage that introduces a controlled amount of distortion to allow for high compression ratios, and a lossless entropy coding stage based on a simple but efficient block-adaptive arithmetic coding method. Adaptivity to the non-stationary behavior of the waveform is achieved by partitioning the data into blocks which are encoded separately. The compression ratio of the proposed scheme can be set to meet prescribed fidelity requirements, i.e. the waveform can be reproduced with sufficient fidelity for accurate interpretation and analysis. The distortions incurred by this compression scheme are currently being evaluated by several seismologists. Encoding is done with high efficiency due to the low overhead required to specify the parameters of the arithmetic encoder. Rate-distortion performance results on seismic waveforms are presented for various filter banks and numbers of levels of decomposition.

关键词： Data compression Data analysis Arithmetic Monitoring Earthquakes Mars compression algorithms Decorrelation Quantization Entropy coding

来源：评论

学校读者我要写书评

暂无评论

An efficient data compression scheme based on semi-adaptive Huffman coding for moderately large Chinese text files

An efficient data compression scheme based on semi-adaptive ...

引用

IEEE Singapore International Conference on Networks

作者： Ghim Hwee Ong Shell Ying Huang Department of Information Systems &Computer Science Faculty of Science National University of Singapore Singapore Division of Computer Engineering School of Applied Science Nanyang Technological University Singapore

ISBN: (纸本)0780325796

This paper presents a data compression scheme for Chinese text files. Due to the skewness of the distribution of Chinese ideograms, the Huffman coding method is adopted. By storing the Huffman tree in the coding table and representing the Huffman tree using the Zaks sequence, the algorithm produces significant improvement on the compression results. The proposed method is evaluated by comparing its performance with three well-known compression algorithms and an algorithm specially designed to compress the coding table. This algorithm should also be applicable to other ideogram-based or oriental language texts. Also, it has the potential to reduce the dictionary size in a bigram or trigram-based semi-adaptive compression scheme for English texts.

关键词： Data compression Huffman coding Encoding Natural languages Frequency compression algorithms Information systems Computer science Algorithm design and analysis Dictionaries

来源：评论

学校读者我要写书评

暂无评论

An investigation of effective compression ratios for the proposed synchronous data compression proto

An investigation of effective compression ratios for the pro...

引用

Data compression Conference (DCC)

作者： R.R. Little Department of Computer Science College of Engineering Mississippi State University MS USA

来源：评论

学校读者我要写书评

暂无评论

Finite state methods for compression and manipulation of images

Finite state methods for compression and manipulation of ima...

引用

Data compression Conference (DCC)

作者： K. Culik J. Kari Department of Computer Science University of South Carolina Columbia SC USA Academy of Finland Finland Mathematics Department University of Turku Turku Finland

Weighted finite automata (WFA) is a tool for specifying real functions and in particular grayscale images. The image compression software based on this algorithm is competitive with other methods in compression of typical grayscale images. It performs particularly well for high compression rates, for color images, and compared to other methods it has several additional advantages. This paper mainly deals with image manipulation. Weighted finite transducers (WFT) can be used to specify the widest variety of image transformations (linear operators on grayness functions). The authors briefly introduce WFA and WFT and give some examples of image transformations specified by WFT.

关键词： Image coding Image resolution Automata Gray-scale Inference algorithms Color Pixel Computer science Software algorithms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel DCT and FTC based hybrid still image compression algorithm

A novel DCT and FTC based hybrid still image compression alg...

引用

URSI International Symposium on Signals, Systems, and Electronics (ISSSE)

作者： Jiangtao Wen Xuelong Zhu Computer and Information Division Department of Electronic Engineering Tsinghua University Beijing China

ISBN: (纸本)0780325168

A novel discrete cosine transform (DCT) and fractal transform coding (FTC) hybrid image compression algorithm is proposed which dramatically improves the speed of the FTC coding and JPEG's ability of preserving image details at high compression ratios. The overall subjective quality of the whole JPEG decoded image is also heightened.

关键词： Discrete cosine transforms Image coding Pixel Transform coding Frequency Fractals Information technology Image resolution Iterative decoding compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time image compression using SIMD architectures

Real-time image compression using SIMD architectures

引用

Computer Architectures for Machine Perception (CAMP)

作者： P. Moravie H. Essafi C. Lambert-Nebout J.-L. Basille Commissariat à I'Energie Atomique L.E.T.I. Gif-sur-Yvette France Centre Spatial de Toulouse Toulouse France ENSEEIHT Toulouse France

Today, in the digitized satellite image domain, the need for high-dimension images is increasing considerably. To transmit or to store such images (more than 6000/spl times/6000 pixels), we need to reduce their data volume, and so we have to use image compression techniques. In most cases, these operations have to be processed in real time. The large amount of computations required by classical image compression algorithms prohibits the use of common sequential processors. To solve this problem, CEA (in collaboration with CNES) has tried to define the best-suited architecture for image compression. In order to achieve this aim, we developed and evaluated a new parallel image compression algorithm for general-purpose parallel computers using data-parallelism. This paper presents this new parallel image compression algorithm. We present implementation results on several parallel computers. We also examine load balancing and data mapping problems. We end by defining optimal characteristics of the parallel machine for real-time image compression.

关键词： Image coding Discrete wavelet transforms Continuous wavelet transforms Algorithm design and analysis Concurrent computing Wavelet transforms Fourier transforms Computer architecture compression algorithms Parallel machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共209页 << < 185 186 187 188 189 190 191 192 193 194 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：