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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
920 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

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

日期分布

学科分类号

1,647 篇 工学
- 1,193 篇 电气工程
- 961 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 169 篇 软件工程
- 100 篇 电子科学与技术（可...
- 64 篇 控制科学与工程
- 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,521 篇 source coding
1,261 篇 decoding
639 篇 codes
602 篇 channel coding
418 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
227 篇 software
227 篇 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,468 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

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

共 5521 条记录，以下是251-260 订阅

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

详细简洁

排序：

source coding for a multihop network

Source coding for a multihop network

引用

Data Compression Conference (DCC)

作者： Wei-Hsin Gu M. Effros California Institute of Technology USA

Summary form only given. In this paper, we bound the rate-distortion region for a four-node network. The results are the first known expansion of rate-distortion theory from single-hop networks (every source has a direct connection to each of its destinations), to multihop networks, which allow intermediate nodes. While single-hop network source coding solutions may be applied in multihop networks, such applications require explicit rate allocation for each source-destination pair, and the resulting solutions may be suboptimal. We therefore tackle the multihop network source coding problem directly using a diamond network.

关键词： source coding Spread spectrum communication Decoding Rate-distortion Random variables Data compression

来源：评论

学校读者我要写书评

暂无评论

source coding with Unreliable Side Information in the Finite Blocklength Regime

Source Coding with Unreliable Side Information in the Finite...

引用

IEEE International Symposium on Information Theory

作者： Siming Sun Michelle Effros Department of Electrical Engineering California Institute of Technology Pasadena CA USA

ISBN: (数字)9781665421591

ISBN: (纸本)9781665421607

This paper studies a special case of the problem of source coding with side information. A single transmitter describes a source to a receiver that has access to a side information observation that is unavailable at the transmitter. While the source and true side information sequences are dependent, stationary, memoryless random processes, the side information observation at the decoder is unreliable, which here means that it may or may not equal the intended side information and therefore may or may not be useful for decoding the source description. The probability of side information observation failure, caused, for example, by a faulty sensor or source decoding error, is non-vanishing but is bounded by a fixed constant independent of the blocklength. This paper proposes a coding system that uses unreliable side information to get efficient source representation subject to a fixed error probability bound. Results include achievability and converse bounds under two different models of the joint distribution of the source, the intended side information, and the side information observation.

关键词： Codes Interference cancellation Error probability Transmitters source coding Receivers Decoding

来源：评论

学校读者我要写书评

暂无评论

source coding with conditionally less noisy side information

Source coding with conditionally less noisy side information

引用

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

作者： Roy Timo Tobias J. Oechtering Michèle Wigger Institute for Telecommunications Research University of South Australia Adelaide Australia ACCESS Linnaeus Center KTH Royal Institute of Technology Stockholm Sweden Comm. and Electr. Department Telecom ParisTech Paris France

We consider a lossless multi-terminal source coding problem with one transmitter, two receivers and side information. The achievable rate region of the problem is not well understood. In this paper, we characterise the rate region when the side information at one receiver is conditionally less noisy than the side information at the other, given this other receiver's desired source. The conditionally less noisy definition includes degraded side information and a common message as special cases, and it is motivated by the concept of less noisy broadcast channels. The key contribution of the paper is a new converse theorem employing a telescoping identity and the Csiszár sum identity.

关键词： Noise measurement Receivers source coding Random variables Transmitters Markov processes

来源：评论

学校读者我要写书评

暂无评论

source coding with Limited Side Information Lookahead at the Decoder

Source Coding with Limited Side Information Lookahead at the...

引用

IEEE International Symposium on Information Theory

作者： Abbas El Gamal Tsachy Weissman Stanford University Stanford CA US Department of Electrical Engineering Stanford University Stanford CA USA

ISBN: (纸本)142440505X

We characterize the rate distortion function for the source coding with decoder side information setting when the i-th reconstruction symbol is allowed to depend only on the first i + d side information symbols, for some finite lookahead d, in addition to the index from the encoder. For the case of causal side information, i.e., d = 0, we find that the penalty of causality is the omission of the subtracted mutual information term in the Wyner-Ziv rate distortion function. For d > 0, we derive a computable "infinite-letter" expression for the rate distortion function. When specialized to the near-lossless case, our results characterize the best achievable rate for the Slepian-Wolf source coding problem with limited side information lookahead, and have some surprising implications. We find that side information is useless for any fixed d when the joint PMF of the source and side information satisfies the positivity condition P(x,y) > 0 for all (x,y). More generally, the optimal rate depends on the distribution of the pair X, Y only through the distribution of X and the bipartite graph whose edges represent the pairs x,y for which P(x,y) > 0. On the other hand, if side information lookahead d n is allowed to grow faster than logarithmic in the block length n, then H(X|Y) is achievable. Finally, we apply our approach to derive a computable expression for channel capacity when state information is available at the encoder with limited lookahead

关键词： source coding Decoding Rate-distortion Trajectory Delay Noise reduction Target tracking Channel coding Mutual information Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

source coding with quantized redundant expansions: accuracy and reconstruction

Source coding with quantized redundant expansions: accuracy ...

引用

Data Compression Conference (DCC)

作者： Z. Cvetkovic AT and T Laboratories Shannon Laboratory

Signal representations based on low-resolution quantization of redundant expansions is an interesting source coding paradigm, the most important practical case of which is oversampled A/D conversion. Signal reconstruction from quantized coefficients of a redundant expansion and accuracy of representations of this kind are problems which are still not well understood and these are studied in this paper in finite dimensional spaces. It has been previously proven that accuracy of signal representations based on quantized redundant expansions, measured as the squared Euclidean norm of the reconstruction error, cannot be better than O(1/(r/sup 2/)), where r is the expansion redundancy. We give some general conditions under which 1/(r/sup 2/) accuracy can be attained. We also suggest a form of structure for overcomplete families which facilitates reconstruction, and which enables efficient encoding of quantized coefficients with a logarithmic increase of the bit-rate in redundancy.

关键词： source coding Signal representations Redundancy Quantization Signal reconstruction Encoding

来源：评论

学校读者我要写书评

暂无评论

source coding with side information for error free perfect secrecy systems

Source coding with side information for error free perfect s...

引用

IEEE International Symposium on Information Theory

作者： Siu-Wai Ho Lifeng Lai Alex Grant Institute for Telecommunications Research University of South Australia Australia Department Electrical and Computer Engineering Worcester Polytechnic Institute USA

ISBN: (纸本)9781479904440

This paper considers source coding problems with the requirements of perfect secrecy and zero error at receivers. In the problems considered in this paper, there is always one transmitter but there can be one or two receivers. Two different scenarios depending on whether the receivers' side information are present at the transmitter or not are considered. By deriving bounds on the probability masses of the cipher-text and the key, the minimum transmission rate and key rate are characterized. Although zero-error capacities are typically difficult to characterize, the perfect secrecy constraint turns out to be the key that simplifies the problems considered in this paper and makes them analytically tractable.

关键词： Receivers Transmitters Decoding source coding Security Color

来源：评论

学校读者我要写书评

暂无评论

source coding with in-block memory and controllable causal side information

Source coding with in-block memory and controllable causal s...

引用

IEEE International Symposium on Information Theory

作者： Osvaldo Simeone New Jersey Institute of Technology USA

ISBN: (纸本)9781479904440

The recently proposed set-up of source coding with a side information “vending machine” allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the encoder and on the previously measured samples of the side information, and are cost constrained. Moreover, the final estimate of the source by the decoder is a function of the encoder's message and depends causally on the side information sequence. Previous work by Permuter and Weissman has characterized the rate-distortion-cost function in the special case in which the source and the “vending machine” are memoryless. In this work, motivated by the related channel coding model introduced by Kramer, the rate-distortion-cost function characterization is extended to a model with in-block memory. Various special cases are studied including block-feedforward and side information repeat request models.

关键词： source coding Decoding Joints Minimization Rate-distortion Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

source coding with a reversible memory-binding probability density transformation

Source coding with a reversible memory-binding probability d...

引用

IEEE-IMS Workshop on Information Theory and Statistics

作者： B.G. Talbot L.M. Talbot Analytic Sciences Corporation Reston VA USA Barton Hill Ct Reston VA USA

We present a memory-binding density transformation as a means of improving the performance of entropy coders acting on memory sources.

关键词： source coding Entropy Performance analysis Probability density function Encoding Shape Testing Performance gain

来源：评论

学校读者我要写书评

暂无评论

source coding with feedforward: Gaussian sources

Source coding with feedforward: Gaussian sources

引用

IEEE International Symposium on Information Theory

作者： S. Sandeep Pradhan University of Michigan Ann Arbor MI USA

ISBN: (纸本)0780382803

This paper describes the source coding of the information signals with feedforward Gaussian sources. A stationary memoryless Gaussian source with zero-mean and variance, and with mean squared error as the distortion measure, gives a deterministic scheme that achieves the optimal rate-distortion bound using simple uniform scalar quantizers. To reconstruct source codes, the decoder uses the optimal Shannon rate-distortion function and achieves channel coding with feedback.

关键词： source coding Decoding Distortion measurement Rate-distortion Electronic mail Encoding Seismic waves Delay Probability distribution Length measurement

来源：评论

学校读者我要写书评

暂无评论

source coding with distortion side information at the encoder

Source coding with distortion side information at the encode...

引用

Data Compression Conference (DCC)

作者： E. Martinian G.W. Wornell R. Zamir Massachusetts Institute of Technology Cambridge MA USA Tel-Aviv University Tel-Aviv Israel

We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such distortion side information can model reliabilities for noisy measurements, sensor calibration information, or perceptual effects like masking and sensitivity to context. When the distortion side information is statistically independent of the source, we show that in many cases (e.g., for additive or multiplicative distortion side information) there is no penalty for knowing the side information only at the encoder, and there is no advantage to knowing it at the decoder. Furthermore, for quadratic distortion measures scaled by the distortion side information, we evaluate the penalty for lack of encoder knowledge and show that it can be arbitrarily large. In this scenario, we also sketch transform based quantizers constructions which efficiently exploit encoder side information in the high-resolution limit.

关键词： source coding Distortion measurement Loss measurement Decoding Data compression Context modeling Calibration Biosensors Sensor systems Communication networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：