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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1601-1610 订阅

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

详细简洁

排序：

A modification to the Huffman coding of JPEG's baseline compression algorithm

A modification to the Huffman coding of JPEG's baseline comp...

引用

Data compression Conference (DCC)

作者： G. Lakhani Texas Tech University USA

Summary form only given. In a DCT block of a compressed image, the density of non-zero AC coefficients and their size decrease as the block is scanned in the zigzag order. This paper presents a minor modification to the Huffman coding phase of the JPEG baseline algorithm to exploit this redundancy for further compression. Our encoder divides each block into two roughly equal halves (bands) and codes each band using a separate code table. It moves the EOB (end-of-block) marker to the middle of the sequence of non-zero AC coefficients and then replaces it by one of two split markers, whose selection depends on whether the number of non-zero AC coefficients is even or odd. No marker is needed at the end of a block. The major difference between this approach and the spectral selection method of the JPEG progressive mode is that the band boundary is flexible in our approach (i.e., it can vary from block to block).

关键词： Huffman coding Transform coding compression algorithms Image coding Discrete cosine transforms ISO standards Decoding Airplanes Gold

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant FFT data compression

Fault-tolerant FFT data compression

引用

Pacific Rim International Symposium on Dependable Computing

作者： G.R. Redinbo R. Manomohan Department of Electrical and Computer Engineering University of California Davis CA USA Internet Software Systems Hewlett Packard Cupertino CA USA

Transform coefficients carry important data characteristics but can also be compressed significantly in many remote sensing applications. Failures in the several computing facilities that execute lossy compression algorithms and support the transmission of Fourier transform data can corrupt the values beyond recovery at the final destination. Various methods for including fault tolerance at the data processing level are exemplified by describing a protected system that computes the FFT, truncates small coefficients and compresses the remaining nonzero coefficients using lossless arithmetic coding. Algorithmic checks within the FFT and arithmetic encoding and decoding operations are augmented with additional features between and across several subsystems involved in compressing and transmitting the FFT data. End-to-end error detection is achieved in this manner.

关键词： Fault tolerance Data compression Arithmetic Remote sensing Propagation losses compression algorithms Fourier transforms Fault tolerant systems Data processing Protection

来源：评论

学校读者我要写书评

暂无评论

Matching criteria in fractal image compression

Matching criteria in fractal image compression

引用

Midwest Symposium on Circuits and Systems (MWSCAS)

作者： M. Elsherif M. Rashwan A. Elsayad Electronic Research Institute Egypt Faculty of Engineering Cairo University Egypt

Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. One of the most efficient fractal methods is based on iterated function systems (IFS). The basic principle is that an image can be reconstructed by using the self-similarities in the image itself. When encoding an image, the algorithm partitions the image into a number of square blocks (domain blocks). After this there is a new partition into smaller blocks (range blocks). For every range block the best matching domain block is searched among all domain blocks by performing a set of transformations on the blocks. The compression is obtained by storing only the descriptions of these transformations. While rapid compression algorithm exists, the compression process is extremely time consuming. A crucial point in the encoding procedure is to be able to determine the "best matching" domain block for every range block. So, the matching criterion or the distortion measure represents an important part in the encoding process. This paper investigates the collage theorem upon which is built the fractal image compression method in order to determine the best matching measure for fractal compression. The results prove that the linear correlation coefficient gets the best reconstruction image quality in addition to rapid convergence in the decoding. However, different matching criteria are employed between image partitions.

关键词： Fractals Image coding Image reconstruction Distortion measurement Image recognition Layout Shape Geometry Partitioning algorithms compression algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid compression of video with graphics in DVT communication systems

Hybrid compression of video with graphics in DVT communicati...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： M. van der Schaar P.H.N. de With Philips Research Briarcliff USA

A new cost-effective and "near-lossless" quality compression system for images containing both video and graphics is presented. The scheme can be used successfully in two distinct architectures: for professional video distribution from content provider to broadcaster, and for local memory reduction in a consumer DTV receiver.

关键词： Video compression Graphics Digital TV Image coding Image quality Algorithm design and analysis compression algorithms Decoding Interference Transform coding

来源：评论

学校读者我要写书评

暂无评论

IPv6 header compression algorithm supporting mobility in wireless networks

IPv6 header compression algorithm supporting mobility in wir...

引用

IEEE Southeastcon

作者： J.D. Lim H.P. Stern Samsung Telecommunications America Inc. Richardson TX USA Department of Electrical and Computer Engineering University of Alabama Tuscaloosa AL USA

This paper proposes a new compression algorithm supporting IPv6 mobility in wireless communications, called the IPv6 header compression algorithm. The idea of the algorithm is to provide an effective compression rate to support the mobility and the spectral efficiency required in wireless networks. The data link layer and the physical layer based on the OSI model are thus considered. To support the mobility it is assumed that any change of other fields in an IPv6 header except care-of-address disconnects the call. The address assignment method and LZW coding delivers significant compression of the long IPv6 header for the initial connection. After the initial communication, the algorithm provides compression through comparator coding and LZW coding. The algorithm's performance is evaluated using both analytic techniques and computer simulation.

关键词： compression algorithms Intelligent networks Wireless networks Time division multiple access Payloads Wireless communication Physical layer Internet Protocols Routing

来源：评论

学校读者我要写书评

暂无评论

Fingerprint image compression

Fingerprint image compression

引用

IEEE Workshop on Neural Networks for Signal Processing

作者： G.A. Khuwaja A.S. Tolba Physics Department Kuwait University Safat Kuwait

Storage of fingerprint image databases needs allocation of huge secondary storage devices. To reduce the increasing demand on storage space, efficient data compression techniques are badly needed. In addition to that, the exchange of fingerprint images between governmental agencies could be done fast. The compression algorithm must also preserve the original information in the original image. This research work focuses on finding the best parameters at the very beginning stage of selecting the wavelet packet filter bank. The experiments performed on 38 different filter banks lead us to the conclusion that the Coif5 filter bank results in 60% saving in storage space compared to the currently used standard Bior7.9. Statistical significance of the compression results indicated that we are 95% confident that the average number of non-zero coefficients lies in the range 5.33/spl plusmn/0.431 in the case of Coif5 and 8.53/spl plusmn/1.2 in the case of the Bior7.9. Objective image quality measures such as the mean square error, the peak signal-to-noise ratio were used to measure the reconstructed image quality. These measures showed a relative improvement in image quality compared to that achieved by the current standard while achieving a higher compression rate.

关键词： Fingerprint recognition Image matching Image coding Image storage Filter bank Image quality Image databases Data compression compression algorithms Wavelet packets

来源：评论

学校读者我要写书评

暂无评论

Topology preserving compression of 2D vector fields

Topology preserving compression of 2D vector fields

引用

IEEE Conference on Visualization

作者： S.K. Lodha J.C. Renteria K.M. Roskin Department of Computer Science University of California Santa Cruz CA USA

We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different types of global and local error metrics including the earth mover's distance metric to measure the degradation in topology as well as weighted magnitude and angular errors. As a result, we obtain precise error bounds in the compressed vector fields. Experiments with both analytic and simulated data sets are presented. Results indicate that one can obtain significant compression with low errors without losing topology information.

关键词： Topology Visualization Clustering algorithms Computer errors compression algorithms Earth Degradation Data analysis Analytical models Streaming media

来源：评论

学校读者我要写书评

暂无评论

Image compression using derivative information with Distance Transforms

Image compression using derivative information with Distance...

引用

European Signal Processing Conference (EUSIPCO)

作者： Leena Ikonen Ville Kyrki Pekka J. Toivanen Heikki Kälviäinen Dept. of Information Technology Lappeenranta University of Technology P.O. Box 20 53851 Lappeenranta Finland

In this paper, a new image compression method is presented using the Distance Transform on Curved Space (DTOCS) and derivative information in finding positions for control points. In previous work it has been shown that the control points are not in exactly optimal positions. This paper presents theoretical considerations according to which the new method enhances the decompressed image quality particularly in the areas of rapid changes. The obtained results shown verify the correctness of the theoretical considerations. The reconstructed image quality is clearly better measured by error criteria. Also visually the difference is significant.

关键词： Image coding Transforms compression algorithms Airplanes Image quality Equations Noise

来源：评论

学校读者我要写书评

暂无评论

Optimal refinement/significance map tradeoffs in SPIHT-based image compression

Optimal refinement/significance map tradeoffs in SPIHT-based...

引用

Asilomar Conference on Signals, Systems & Computers

作者： C.D. Creusere Klipsch School of Electrical and Computer Engineering New Mexico State University USA

ISBN: (纸本)0780365143

A rate-distortion-optimal embedded image compression algorithm is one in which each bit is generated by the encoder in such a way that the reconstruction error of the decoded image is reduced as much as possible when that bit is received. Popular embedded algorithms like set partitioning in hierarchical trees (SPIHT) use heuristic techniques to approximately achieve such optimality. Two other approaches have been developed recently that are rigorously optimized for rate-distortion within their respective algorithmic frameworks. In this work, we address the question of optimality within the framework of SPIHT, focusing specifically on the ordering of refinement and significance map information within the bit stream. From our experimental results, we conclude that SPIHT is almost optimal with respect to its ordering of these passes.

关键词： Image coding Decoding Rate-distortion Wavelet transforms Streaming media Image reconstruction Partitioning algorithms compression algorithms Computational complexity Bit rate

来源：评论

学校读者我要写书评

暂无评论

A new compression method for compressed matching

A new compression method for compressed matching

引用

Data compression Conference (DCC)

作者： S.T. Klein D. Shapira Department of Mathematics & CS Bar Ilan University and College of Judea and Samaria Israel Department of Mathematics & CS Bar-llan University Ramat-Gan Israel

A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without dec... 详细信息

关键词： Pattern matching Decoding Encoding Educational institutions compression algorithms Internet Reservoirs Microcomputers Arithmetic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：