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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,590 篇 会议
923 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,524 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,650 篇 工学
- 1,194 篇 电气工程
- 963 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 171 篇 软件工程
- 100 篇 电子科学与技术（可...
- 66 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
345 篇 理学
- 256 篇 数学
- 57 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 地球物理学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

5,524 篇 source coding
1,261 篇 decoding
640 篇 codes
602 篇 channel coding
417 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
230 篇 software
229 篇 training
223 篇 computational mo...
212 篇 semantics
203 篇 video coding
197 篇 encoding
191 篇 quantization
185 篇 distortion
184 篇 redundancy
182 篇 information theo...
181 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
24 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 stanford univ de...
18 篇 univ calif berke...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
14 篇 georgia inst tec...
13 篇 department of el...
13 篇 department of el...
12 篇 ibm thomas j. wa...
12 篇 university of ca...
12 篇 department of el...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
18 篇 k. rose
18 篇 jun chen
18 篇 michelle effros
17 篇 yasutada oohama
16 篇 skoglund mikael
15 篇 chao tian
14 篇 k. zeger
14 篇 b. girod
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,471 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

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

共 5524 条记录，以下是431-440 订阅

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

详细简洁

排序：

Reliability vs. efficiency in distributed source coding for field-gathering sensor networks

Reliability vs. efficiency in distributed source coding for ...

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： D. Marco D.L. Neuhoff EECS Department University of Michigan Ann Arbor MI USA

The tradeoff between reliability and efficiency in distributed source coding for field-gathering sensor networks is examined. In the considered networks, sensors measure some underlying random field, quantize their measurements, encode the quantized values into bits and transmit these directly, or via relays, to a collector that reconstructs the field. The bits from one sensor's encoder are regarded as a packet. The minimum achievable coding rate can be attained if the sensors are ordered and each applies Slepian-Wolf distributed coding to its data assuming the decoder knows the data from all prior sensors. However, with such a coding scheme, losing even one sensor's packet would cause decoding failure for all subsequent sensors' values. Therefore, one might consider other ways of applying Slepian-Wolf coding, where in trade for increased coding rate, fewer sensor values are lost when a packet is lost. In this paper, the tradeoff between efficiency, i.e. coding rate, and reliability, characterized by a loss factor, is considered for several different Slepian-Wolf based coding schemes as a function of the packet error probability and the size of the network.

关键词： Intelligent networks source coding Decoding Relays Permission Sensor phenomena and characterization Error probability Aggregates Sensor systems Reliability theory

来源：评论

学校读者我要写书评

暂无评论

Image Authentication and Tampering Localization using Distributed source coding

Image Authentication and Tampering Localization using Distri...

引用

IEEE Workshop on Multimedia Signal Processing

作者： Yao-Chung Lin David Varodayan Bernd Girod Information Systems Laboratory University of Stanford Stanford CA USA

ISBN: (纸本)9781424412730

Media authentication is important in content delivery via untrusted intermediaries, such as peer-to-peer (P2P) file sharing. Many differently encoded versions of a media file might exist. Our previous work applied distributed source coding to distinguish the legitimate diversity of encoded images from tampering. An authentication decoder was supplied with a Slepian-Wolf encoded lossy version of the image as authentication data. Distributed source coding provided the desired robustness against legitimate encoding variations, while detecting illegitimate modification. We augment the decoder to localize tampering in an image already deemed to be unauthentic. The localization decoder requires only incremental localization data beyond the authentication data since we use rate-adaptive distributed source codes. Both decoders perform joint bitplane decoding, rather than conditional bitplane decoding. Our results demonstrate that tampered image blocks can be identified with high probability using authentication plus localization data of only a few hundred bytes for a 512times512 image.

关键词： Authentication source coding Decoding Image coding Watermarking Cryptography Peer to peer computing Data mining Transform coding Information systems

来源：评论

学校读者我要写书评

暂无评论

Trade-off of lossless source coding error exponents

Trade-off of lossless source coding error exponents

引用

IEEE International Symposium on Information Theory

作者： Cheng Chang Anant Sahai HP Laboratories Palo Alto USA Wireless Foundations Center Department of Electrical Engineering and Computer Science University of California USA

ISBN: (纸本)9781424422562

We consider the lossless encoding of two simultaneous sources. The encoder may choose to discriminate against one source and hence the error exponents for the two sources can be different. The goal of this paper is to understand the region of achievable error-exponent pairs for lossless source coding. In the fixed-block-length case, the error exponent region is completely characterized and is found to be relatively trivial. However, in the streaming context, it is shown that there exists a non-trivial trade-off between the two error exponents. Both an inner bound and an outer bound are given for that case, but they do not match. The outer bound comes from a multi-stream version of the uncertainty-focusing bound.

关键词： source coding Delay Decoding Encoding Error probability Real time systems Channel coding

来源：评论

学校读者我要写书评

暂无评论

SEARCHING IN ONE BILLION VECTORS: RE-RANK WITH source coding

SEARCHING IN ONE BILLION VECTORS: RE-RANK WITH SOURCE CODING

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Herve Jegou Romain Tavenard Matthijs Douze Laurent Amsaleg INRIA Rennes Bretagne Atlantique France University of Rennes-1 France INRIA Grenoble France IRISA CNRS France

Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that re-ranks the neighbor hypotheses obtained by these compressed-domain indexing methods. In contrast to the usual post-verification scheme, which performs exact distance calculation on the short-list of hypotheses, the estimated distances are refined based on short quantization codes, to avoid reading the full vectors from disk. We have released a new public dataset of one billion 128-dimensional vectors and proposed an experimental setup to evaluate high dimensional indexing algorithms on a realistic scale. Experiments show that our method accurately and efficiently re-ranks the neighbor hypotheses using little memory compared to the full vectors representation.

关键词： Indexing Approximation methods source coding Quantization Artificial neural networks Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Linear source coding over rings and applications

Linear source coding over rings and applications

引用

IEEE Swedish Communication Technologies Workshop (Swe-CTW)

作者： Sheng Huang Mikael Skoglund School of Electrical Engineering KTH Royal Institute of Technology Stockholm Sweden

This paper studies linear coding (LC) techniques in the setting of computing functions of correlated memoryless sources. Instead of linear mappings over finite fields, we consider using linear mappings over finite rings as encoders. It is shown that generally the region c×R, where c ≥ 1 is a constant and R is the Slepian-Wolf (SW) region, is achievable with LC over ring (LCoR) when the function to compute is the identity function. c = 1 if the ring used is a field. Hence, LCoR could be suboptimal in terms of achieving the best coding rates (the SW region) for computing the identity function. In spite of that, the ring version shows several advantages. It is demonstrated that there exists a function that is neither linear nor can be linearized over any finite field. Thus, LC over field (LCoF) does not apply directly for computing such a function unless the polynomial approach [1], [2] is used. On the contrary, such a function is linear over some ring. Using LCoR, an achievable region containing the SW region can be obtained for computing this function. In addition, the alphabet sizes of the encoders are strictly smaller than using LCoF. More interestingly, LCoF is not useful if some special requirement is imposed.

关键词： Decoding Polynomials Modules (abstract algebra) Zinc source coding Random variables

来源：评论

学校读者我要写书评

暂无评论

Sequential random binning for streaming distributed source coding

Sequential random binning for streaming distributed source c...

引用

IEEE International Symposium on Information Theory

作者： S.C. Draper Cheng Chang A. Sahai Department of EECS University of California Berkeley CA USA

Random binning arguments underlie many results in information theory. In this paper we introduce and analyze a novel type of causal random binning "sequential" binning. This binning is used to get streaming Slepian-Wolf codes with an "anytime" character. At the decoder, the probability of estimation error on any particular symbol goes to zero exponentially fast with delay. In the non-distributed context, we show equivalent results for fixed-rate streaming entropy coding. Because of space constraints, we present full derivations only for the latter, stating the results for the distributed problem. We give bounds on error exponents for both universal and maximum-likelihood decoders

关键词： source coding Maximum likelihood decoding Entropy coding Block codes Statistics Probability Information theory Estimation error Delay estimation Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Turbo source coding: a noise-robust approach to data compression

Turbo source coding: a noise-robust approach to data compres...

引用

Data Compression Conference (DCC)

作者： P. Mitran J. Bajcsy Department of Electrical and Computer Engineering McGill University QUE Canada

Summary form only given. All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have previously proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression purposes. The work presented here extends these results and also considers the case when decompression must be done from compressed data corrupted by additive white Gaussian noise (AWGN).

关键词： source coding Noise robustness Data compression Additive white noise AWGN Huffman coding Iterative algorithms Arithmetic Gaussian noise Concatenated codes

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Multirate Interaction in Distributed source coding and Wireless Sensor Network

Energy Efficient Multirate Interaction in Distributed Source...

引用

IEEE Conference on Wireless Communications and Networking

作者： Wei Wang Dongming Peng Honggang Wang Hamid Sharif Hsiao-Hwa Chen University of Nebraska Lincoln USA National Sun Yat-Sen University Taiwan

Distributed source coding (DSC) based signal processing applications involve data transmissions at multirates in wireless sensor network (WSN). In this paper, we propose a novel cross layer approach in WSN to achieve energy efficiency using multirates desirable for the DSC based signal processing applications and current network conditions. Our approach can be summarized into two parts: first, energy efficient multirate MAC-PHY supporting DSC applications; and second, rate oriented interaction of MAC-PHY and DSC applications. Multirate MAC-PHY utilizes desirable bit error rate (BER), channel attenuation, corresponding modulation schemes, and multirate requirements, to determine the minimum desirable transmission power. Rate oriented interaction provides optimal transmission rates feedback to interact with DSC applications, making DSC applications adaptively adjust information coding rate according to network conditions. This interactive approach achieves further energy saving significantly by making the DSC application aware of WSN conditions. Besides DSC, this work can be easily extended to other multirate signal processing applications in WSN.

关键词： Energy efficiency source coding Wireless sensor networks Signal processing Cross layer design Bit error rate Signal processing algorithms Power control Multiaccess communication Multiple access interference

来源：评论

学校读者我要写书评

暂无评论

Fixed binning schemes: an operational duality between channel and source coding problems with side information

Fixed binning schemes: an operational duality between channe...

引用

IEEE International Symposium on Information Theory

作者： H. Wang P. Viswanath Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL USA

In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.

关键词： source coding Channel coding Decoding Distortion measurement Probability distribution Error probability Random variables Codes

来源：评论

学校读者我要写书评

暂无评论

Nonasymptotic noisy lossy source coding

Nonasymptotic noisy lossy source coding

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Victoria Kostina Sergio Verdú Dept. of Electrical Engineering Princeton University NJ USA

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is asymptotically equivalent to a noiseless lossy source coding problem with a modified distortion function, nonasymptotically there is a difference in how fast their minimum achievable coding rates approach the rate-distortion function, providing yet another example where at finite blocklengths one must put aside traditional asymptotic thinking.

关键词： Noise measurement Distortion measurement source coding Decoding Rate-distortion Noise

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：