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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,862 篇 会议
217 篇 期刊文献
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

2,080 篇 compression algo...
647 篇 image coding
493 篇 data compression
284 篇 encoding
219 篇 transform coding
218 篇 decoding
203 篇 algorithm design...
164 篇 dictionaries
155 篇 bandwidth
147 篇 video compressio...
142 篇 computer science
141 篇 hardware
131 篇 testing
119 篇 entropy
112 篇 wavelet transfor...
108 篇 bit rate
99 篇 costs
99 篇 quantization
98 篇 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 篇 中文
12 篇 其他

检索条件"主题词=compression algorithms"

共 2080 条记录，以下是1611-1620 订阅

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

详细简洁

排序：

Evaluation of lossless compression methods for gray scale document images

Evaluation of lossless compression methods for gray scale do...

引用

IEEE International Conference on Image Processing

作者： A.E. Savakis Department of Computer Engineering Rochester Institute of Technology Rochester NY USA

ISBN: (纸本)0780362977

A comparative study of lossless compression algorithms is presented. The following algorithms are considered: UNIX compress, gzip, LZW, CCITT Group 3 and Group 4, JBIG, old lossless JPEG, JPEG-LS based on LOCO, CALIC, FELICS, S+P Transform, and PNG. In cases where the algorithm under consideration may only be applied to binary data, the bit planes of the gray scale image are separated, with and without Gray encoding, and the compression is applied to individual bit planes. Testing is done using a set of document images obtained by gray scale scanning of prints of the eight standard CCITT images and a set of nine gray scale pictorial images. The results show that the highest compression is obtained using the CALIC and JPEG-LS algorithms.

关键词： Image coding compression algorithms Transform coding Propagation losses Pixel Image resolution Pulse modulation Testing Graphics Performance loss

来源：评论

学校读者我要写书评

暂无评论

A low-complexity frame memory compression algorithm and its implementation for MPEG-2 video decoder

A low-complexity frame memory compression algorithm and its ...

引用

IEEE Asia-Pacific Conference on ASIC (AP-ASIC)

作者： Tae Young Lee Yong Sik Kim Sungjae Jang Hoon Yoo Jechang Jeong AV Team SP BU System IC Division Hyundai Electronics Industries Company Limited Seoul South Korea Department of Electronic Communications Engineering Hanyang University Seoul South Korea

An algorithm and its implementation to compress video frame data to be stored in external memory are proposed, thereby enabling a reduction of memory requirements and bandwidth. To support random access capability, frames are organized as 1/spl times/8 fixed-length segments, which are used as compression units. For both compression efficiency and low complexity, modified Hadamard transform (MHT) and Golomb-Rice (GR) coding are utilized. The compression ratio is fixed at 50% and objective and subjective video quality assessments are performed. Efficient ASIC implementation including Golomb-Rice encoding/decoding is also proposed to reduce the total compression/decompression latency time.

关键词： compression algorithms Video compression Bandwidth Error correction Error correction codes Quality assessment Application specific integrated circuits Encoding Decoding Delay

来源：评论

学校读者我要写书评

暂无评论

compression method for real-time systems of remote sensing

Compression method for real-time systems of remote sensing

引用

International Conference on Pattern Recognition

作者： M. Gashnikov N. Glumov V. Sergeyev Imabe Processing Systems Institute USA

ISBN: (纸本)0769507506

In this paper the method of image compression is presented. It is designed for data processing in real-time systems of remote sensing. In the midpoint there are compression algorithm based on component transformation with pixel interpolation and algorithm of stabilization of encoded image forming speed, which provide high compression ratio, stable speed of an output data flow and controlled error of image reconstruction.

关键词： Real time systems Remote sensing Image coding Process design Data processing compression algorithms Pixel Interpolation Error correction Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Definability and compression

Definability and compression

引用

Annual Symposium on Logic in Computer Science

作者： F. Afrati H. Leiss M. de Rougemont National and Technical University of Athens Athens Greece CIS Universität Munchen Munchen Germany Universite Paris-II and LRI Bâtiment 490 Orsay France

A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K' as output. Given a property P on the class K defined in a logic /spl Lscr/, we study the definability of property P on the class K'. We consider two compression schemas on unary ordered structures (words), compression by runlength encoding and the classical Lempel-Ziv. First-order properties of strings are first-order on runlength compressed strings, but this fails for images, i.e. 2-dimensional strings. We present simple first-order properties of strings which are not first-order definable on strings compressed with the Lempel-Ziv compression schema. We show that all properties of strings that are first-order definable on strings are definable on Lempel-Ziv compressed strings in FO(TC), the extension of first-order logic with the transitive closure operator. We define a subclass /spl Fscr/ of the first-order properties of strings such that if L is defined by a property in /spl Fscr/, it is also first-order definable on the Lempel-Ziv compressed strings. Monadic second-order properties of strings are dyadic second order definable on Lempel-Ziv compressed strings.

关键词： Image coding Logic Encoding Computational Intelligence Society compression algorithms Data structures Boolean functions Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Wavelet transform footprints: catching singularities for compression and denoising

Wavelet transform footprints: catching singularities for com...

引用

IEEE International Conference on Image Processing

作者： P.L. Dragotti M. Vetterli Laboratoire de Communications Audiovisuelles Swiss Federal Institute of Technology Lausanne Switzerland EECS Department University of California Berkeley CA USA

Wavelets have been widely used for signal compression, image compression being a prime example, and for signal denoising. What makes wavelets such an attractive tool is their capability of representing both transient and stationary behaviors of a signal with few coefficients. We consider the problem of compressing and denoising a particular class of functions: piecewise polynomial signals. We show the limit of usual wavelet coders and present an alternative compression algorithm. The main innovation of the algorithm is that it tries to efficiently compress the significant coefficients of the wavelet decomposition rather then the zero coefficients as in usual coders. The proposed algorithm can potentially be extended to more general signals and represents an effective solution to problems like signal denoising and image compression.

关键词： Wavelet transforms Noise reduction Image coding Polynomials compression algorithms Technological innovation Signal denoising Fourier series Rate-distortion Wavelet domain

来源：评论

学校读者我要写书评

暂无评论

URL forwarding and compression in adaptive Web caching

URL forwarding and compression in adaptive Web caching

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： B.S. Michel K. Nikoloudakis P. Reiher Lixia Zhang University of California Los Angeles USA

Web caching is generally acknowledged as an important service for alleviating focused overloads when certain WWW servers' contents suddenly become popular. Cooperative caching systems are more effective than independent caches due to the larger collective backing store that cooperation creates. One such system currently being developed at UCLA, adaptive Web caching (AWC), uses an application-level forwarding table to locate the nearest copy of a requested URL's contents. This paper describes one specific design in AWC, a simple URL table compression algorithm allowing efficient content information-sharing among neighboring caches. The compression algorithm is based on a hierarchical URL decomposition to aggregate URL sharing common prefixes and an incremental hashing function to minimize collisions between prefixes. The algorithm's collision rate is derived analytically and verified by five sets of Web trace data. The results demonstrate that the collision rate is bounded and has little impact on page fetching latency. Finally, this compression method is compared to the summary cache method.

关键词： Uniform resource locators Web server Algorithm design and analysis compression algorithms Internet Topology Routing protocols Cooperative caching Aggregates Delay

来源：评论

学校读者我要写书评

暂无评论

Multichannel image compression by bijection mappings onto zero-trees

Multichannel image compression by bijection mappings onto ze...

引用

IEEE International Conference on Image Processing

作者： J.L. Paredes G.R. Arce L.E. Russo Department of Electrical and Computer Engineering University of Delaware Newark DE USA Signal Processing Technology Sanders A Lockheed Martin Company Nashua NH USA

A new approach to multispectral image compression is introduced where the intra- and cross-band correlations are jointly exploited in a surprisingly simple yet very effective manner. The proposed compression algorithm maps the multispectral image set into a virtual 2-dimensional array and applies a scalar image coding algorithm to the virtual array. Thus, the spatial correlation and the spectral correlation of the multispectral data set are jointly exploited. Based on the statistical characteristics of the multispectral data, the bijection mapping is optimized to minimize the distortion introduced by the compression algorithm. At high compression rates, the new algorithm outperforms traditional compression algorithms whenever the cross-band correlation is high and it yields comparable performance at low compression rates.

关键词： Image coding Multispectral imaging Signal processing algorithms compression algorithms Decorrelation Data processing Transform coding Bit rate Collaboration Laboratories

来源：评论

学校读者我要写书评

暂无评论

Implementing the context tree weighting method for text compression

Implementing the context tree weighting method for text comp...

引用

Data compression Conference (DCC)

作者： K. Sadakane T. Okazaki H. Imai Department of Information Science University of Tokyo Bunkyo Tokyo Japan

The context tree weighting method is a universal compression algorithm for FSMX sources. Though we expect that it will have a good compression ratio in practice, it is difficult to implement it and in many cases the implementation is only for estimating compression ratio. Though Willems and Tjalkens (1997) showed a practical implementation using not block probabilities but conditional probabilities, it is used for only binary alphabet sequences. We extend the method for multi-alphabet sequences and show a simple implementation using PPM techniques. We also propose a method to optimize a parameter of the context tree weighting for binary alphabet case. Experimental results on texts and DNA sequences show that the performance of PPM can be improved by combining the context tree weighting and that DNA sequences can be compressed in less than 2.0 bpc.

关键词： Sequences DNA compression algorithms Optimization methods

来源：评论

学校读者我要写书评

暂无评论

compression of SMIL documents

Compression of SMIL documents

引用

Data compression Conference (DCC)

作者： Chia-Yuan Teng Nokia Mobile Phones Limited San Diego CA USA

ISBN: (纸本)0769505929

Summary form only given. The World Wide Web Consortium (W3C) standard synchronized multimedia integration language (SMIL) is an HTML-like mark-up language to describe temporal behavior and presentation layout for multimedia objects. SMIL is widely used in today's Internet. Many video clips send SMIL documents to clients before transmitting video and audio streams. Data compression is a process to reduce the number of bits in a representation of data. It can save storage space and reduce bandwidth requirement. Data compression technologies may be classified into two categories: lossless and lossy. The compression technology that can recover data perfectly from the compressed bits is called lossless compression. The one that cannot is called lossy compression. There are many lossless data compression algorithms, such as Ziv-Lempel methods, that have been developed in recent years. However, SMIL document compression performance with such methods is not very impressive because they do not exploit the special format of the SMIL document. As a result, the rate to compress a SMIL document is almost the same as that to compress English text, i.e., 2-4 bits/char. For better compression, a method based on a new parsing technology is proposed. The proposed compression algorithm contains two major procedures: parsing and coding. Parsing is a procedure to segment a SMIL document into non-overlapping phrases (a string of consecutive characters). Coding is a procedure to assign a codeword to the phrase. Both the phrase and codeword are of variable length.

关键词： Streaming media Data compression Space technology Video compression World Wide Web Mobile handsets Web sites Internet Bandwidth compression algorithms

来源：评论

学校读者我要写书评

暂无评论

A spatially coherent discrete wavelet transform - accessing the localization property for data compression

A spatially coherent discrete wavelet transform - accessing ...

引用

Data compression Conference (DCC)

作者： K. Mukherjee A. Mukherjee School of Electrical Engineering and Computer Science University of Central Florida Orlando FL USA

Summary form only given. Wavelets intrinsically give us the capability of localized signal decomposition and analysis in space and frequency. We present the recursive merge filter (RMF) discrete wavelet transform (DWT) algorithm, that organizes intermediate coefficients with respect to both space and frequency. This allows close coupling and pipelining with the encoder, fine grained coding, and "cheap growing" of larger DWT from smaller ones in a constant number of filter operations. The RMF algorithm computes the DWT of an array of length N in a bottom-up fashion, by successively "merging" two smaller DWT (four in 2D), and applying the wavelet filter only on the "smooth" or DC coefficients.

关键词： Discrete wavelet transforms Spatial coherence Filters Wavelet analysis Frequency Data compression Computer science Signal resolution Signal analysis compression algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 158 159 160 161 162 163 164 165 166 167 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：